./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea17b6f261bb6e2069b46537416ceb2b28c77bf12fbc31c6c070453fa873ea8f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:52:11,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:52:11,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:52:11,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:52:11,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:52:11,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:52:11,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:52:11,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:52:11,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:52:11,353 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:52:11,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:52:11,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:52:11,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:52:11,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:52:11,354 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:52:11,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:52:11,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:52:11,354 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:52:11,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:52:11,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:52:11,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:52:11,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:52:11,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:52:11,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:52:11,354 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:52:11,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:52:11,354 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:52:11,354 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:52:11,354 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:52:11,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:52:11,354 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:52:11,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:52:11,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:52:11,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:52:11,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:52:11,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:52:11,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:52:11,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:52:11,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:52:11,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:52:11,355 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:52:11,355 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:52:11,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:52:11,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:52:11,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:52:11,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:52:11,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:52:11,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:52:11,355 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea17b6f261bb6e2069b46537416ceb2b28c77bf12fbc31c6c070453fa873ea8f [2025-01-09 04:52:11,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:52:11,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:52:11,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:52:11,584 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:52:11,585 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:52:11,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2025-01-09 04:52:12,811 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7c83aa70/c568fc4d30664b55a9cded3d0994edf0/FLAGfb3abdc02 [2025-01-09 04:52:13,288 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:52:13,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2025-01-09 04:52:13,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7c83aa70/c568fc4d30664b55a9cded3d0994edf0/FLAGfb3abdc02 [2025-01-09 04:52:13,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7c83aa70/c568fc4d30664b55a9cded3d0994edf0 [2025-01-09 04:52:13,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:52:13,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:52:13,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:52:13,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:52:13,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:52:13,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:52:13" (1/1) ... [2025-01-09 04:52:13,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78968253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:13, skipping insertion in model container [2025-01-09 04:52:13,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:52:13" (1/1) ... [2025-01-09 04:52:13,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:52:14,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[80354,80367] [2025-01-09 04:52:14,094 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[115904,115917] [2025-01-09 04:52:14,124 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[133708,133721] [2025-01-09 04:52:14,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[142627,142640] [2025-01-09 04:52:14,147 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[147060,147073] [2025-01-09 04:52:14,158 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[151393,151406] [2025-01-09 04:52:14,212 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[186229,186242] [2025-01-09 04:52:14,262 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[203860,203873] [2025-01-09 04:52:14,274 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[212816,212829] [2025-01-09 04:52:14,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[217286,217299] [2025-01-09 04:52:14,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[221656,221669] [2025-01-09 04:52:14,315 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[240553,240566] [2025-01-09 04:52:14,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[249509,249522] [2025-01-09 04:52:14,336 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[253979,253992] [2025-01-09 04:52:14,344 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[258349,258362] [2025-01-09 04:52:14,351 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[263314,263327] [2025-01-09 04:52:14,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[267693,267706] [2025-01-09 04:52:14,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[272163,272176] [2025-01-09 04:52:14,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[276533,276546] [2025-01-09 04:52:14,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[281119,281132] [2025-01-09 04:52:14,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[285656,285669] [2025-01-09 04:52:14,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[290122,290135] [2025-01-09 04:52:14,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:52:14,453 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:52:14,565 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[80354,80367] [2025-01-09 04:52:14,613 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[115904,115917] [2025-01-09 04:52:14,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[133708,133721] [2025-01-09 04:52:14,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[142627,142640] [2025-01-09 04:52:14,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[147060,147073] [2025-01-09 04:52:14,659 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[151393,151406] [2025-01-09 04:52:14,745 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[186229,186242] [2025-01-09 04:52:14,766 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[203860,203873] [2025-01-09 04:52:14,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[212816,212829] [2025-01-09 04:52:14,784 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[217286,217299] [2025-01-09 04:52:14,790 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[221656,221669] [2025-01-09 04:52:14,819 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[240553,240566] [2025-01-09 04:52:14,830 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[249509,249522] [2025-01-09 04:52:14,836 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[253979,253992] [2025-01-09 04:52:14,842 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[258349,258362] [2025-01-09 04:52:14,849 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[263314,263327] [2025-01-09 04:52:14,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[267693,267706] [2025-01-09 04:52:14,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[272163,272176] [2025-01-09 04:52:14,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[276533,276546] [2025-01-09 04:52:14,871 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[281119,281132] [2025-01-09 04:52:14,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[285656,285669] [2025-01-09 04:52:14,882 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[290122,290135] [2025-01-09 04:52:14,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:52:14,929 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:52:14,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:14 WrapperNode [2025-01-09 04:52:14,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:52:14,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:52:14,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:52:14,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:52:14,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:14" (1/1) ... [2025-01-09 04:52:14,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:14" (1/1) ... [2025-01-09 04:52:15,174 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13266 [2025-01-09 04:52:15,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:52:15,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:52:15,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:52:15,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:52:15,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:14" (1/1) ... [2025-01-09 04:52:15,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:14" (1/1) ... [2025-01-09 04:52:15,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:14" (1/1) ... [2025-01-09 04:52:15,276 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-01-09 04:52:15,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:14" (1/1) ... [2025-01-09 04:52:15,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:14" (1/1) ... [2025-01-09 04:52:15,389 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:14" (1/1) ... [2025-01-09 04:52:15,399 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:14" (1/1) ... [2025-01-09 04:52:15,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:14" (1/1) ... [2025-01-09 04:52:15,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:14" (1/1) ... [2025-01-09 04:52:15,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:14" (1/1) ... [2025-01-09 04:52:15,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:52:15,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:52:15,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:52:15,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:52:15,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:14" (1/1) ... [2025-01-09 04:52:15,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:52:15,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:52:15,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:52:15,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:52:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:52:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:52:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:52:15,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:52:15,891 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:52:15,893 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:52:20,532 INFO L? ?]: Removed 2736 outVars from TransFormulas that were not future-live. [2025-01-09 04:52:20,532 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:52:20,588 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:52:20,588 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:52:20,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:52:20 BoogieIcfgContainer [2025-01-09 04:52:20,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:52:20,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:52:20,592 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:52:20,595 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:52:20,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:52:13" (1/3) ... [2025-01-09 04:52:20,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e54a1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:52:20, skipping insertion in model container [2025-01-09 04:52:20,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:14" (2/3) ... [2025-01-09 04:52:20,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e54a1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:52:20, skipping insertion in model container [2025-01-09 04:52:20,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:52:20" (3/3) ... [2025-01-09 04:52:20,598 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2025-01-09 04:52:20,611 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:52:20,614 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c that has 1 procedures, 2541 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-01-09 04:52:20,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:52:20,734 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;@3fc3383e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:52:20,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-01-09 04:52:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 2541 states, 2518 states have (on average 1.7589356632247817) internal successors, (4429), 2540 states have internal predecessors, (4429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:20,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:52:20,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:20,775 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] [2025-01-09 04:52:20,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:20,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:20,785 INFO L85 PathProgramCache]: Analyzing trace with hash -876960142, now seen corresponding path program 1 times [2025-01-09 04:52:20,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:20,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938336370] [2025-01-09 04:52:20,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:20,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:20,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:52:21,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:52:21,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:21,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:21,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:21,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938336370] [2025-01-09 04:52:21,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938336370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:21,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:21,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:52:21,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640548375] [2025-01-09 04:52:21,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:21,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:52:21,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:21,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:52:21,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:52:21,485 INFO L87 Difference]: Start difference. First operand has 2541 states, 2518 states have (on average 1.7589356632247817) internal successors, (4429), 2540 states have internal predecessors, (4429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:23,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:23,768 INFO L93 Difference]: Finished difference Result 4213 states and 7126 transitions. [2025-01-09 04:52:23,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:52:23,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-01-09 04:52:23,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:23,806 INFO L225 Difference]: With dead ends: 4213 [2025-01-09 04:52:23,806 INFO L226 Difference]: Without dead ends: 2941 [2025-01-09 04:52:23,814 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-01-09 04:52:23,816 INFO L435 NwaCegarLoop]: 1898 mSDtfsCounter, 13160 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 2252 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13160 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:23,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13160 Valid, 2679 Invalid, 2273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2252 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 04:52:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2025-01-09 04:52:23,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 2755. [2025-01-09 04:52:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2755 states, 2733 states have (on average 1.3241858763263812) internal successors, (3619), 2754 states have internal predecessors, (3619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 3619 transitions. [2025-01-09 04:52:24,030 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 3619 transitions. Word has length 87 [2025-01-09 04:52:24,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:24,030 INFO L471 AbstractCegarLoop]: Abstraction has 2755 states and 3619 transitions. [2025-01-09 04:52:24,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:24,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 3619 transitions. [2025-01-09 04:52:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:52:24,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:24,037 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] [2025-01-09 04:52:24,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:52:24,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:24,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:24,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1410328050, now seen corresponding path program 1 times [2025-01-09 04:52:24,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:24,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092589743] [2025-01-09 04:52:24,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:24,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:24,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:52:24,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:52:24,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:24,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:24,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:24,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092589743] [2025-01-09 04:52:24,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092589743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:24,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:24,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:52:24,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778461879] [2025-01-09 04:52:24,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:24,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:52:24,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:24,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:52:24,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:52:24,318 INFO L87 Difference]: Start difference. First operand 2755 states and 3619 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:25,022 INFO L93 Difference]: Finished difference Result 3042 states and 3982 transitions. [2025-01-09 04:52:25,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:52:25,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-01-09 04:52:25,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:25,030 INFO L225 Difference]: With dead ends: 3042 [2025-01-09 04:52:25,030 INFO L226 Difference]: Without dead ends: 1713 [2025-01-09 04:52:25,034 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-01-09 04:52:25,035 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 4691 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4691 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:25,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4691 Valid, 830 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:52:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2025-01-09 04:52:25,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1713. [2025-01-09 04:52:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1713 states, 1691 states have (on average 1.3341218214074513) internal successors, (2256), 1712 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2256 transitions. [2025-01-09 04:52:25,075 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2256 transitions. Word has length 87 [2025-01-09 04:52:25,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:25,076 INFO L471 AbstractCegarLoop]: Abstraction has 1713 states and 2256 transitions. [2025-01-09 04:52:25,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:25,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2256 transitions. [2025-01-09 04:52:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:52:25,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:25,082 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] [2025-01-09 04:52:25,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:52:25,082 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:25,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:25,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1125625269, now seen corresponding path program 1 times [2025-01-09 04:52:25,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:25,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514526487] [2025-01-09 04:52:25,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:25,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:25,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:52:25,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:52:25,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:25,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:25,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:25,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514526487] [2025-01-09 04:52:25,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514526487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:25,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:25,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:52:25,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344552917] [2025-01-09 04:52:25,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:25,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:52:25,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:25,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:52:25,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:52:25,275 INFO L87 Difference]: Start difference. First operand 1713 states and 2256 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:25,709 INFO L93 Difference]: Finished difference Result 2133 states and 2819 transitions. [2025-01-09 04:52:25,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:52:25,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-01-09 04:52:25,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:25,714 INFO L225 Difference]: With dead ends: 2133 [2025-01-09 04:52:25,714 INFO L226 Difference]: Without dead ends: 1257 [2025-01-09 04:52:25,715 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-01-09 04:52:25,716 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 3411 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3411 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:25,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3411 Valid, 658 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:52:25,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-01-09 04:52:25,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1257. [2025-01-09 04:52:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1235 states have (on average 1.3522267206477734) internal successors, (1670), 1256 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1670 transitions. [2025-01-09 04:52:25,735 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1670 transitions. Word has length 87 [2025-01-09 04:52:25,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:25,735 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1670 transitions. [2025-01-09 04:52:25,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1670 transitions. [2025-01-09 04:52:25,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:52:25,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:25,737 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] [2025-01-09 04:52:25,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:52:25,738 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:25,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:25,738 INFO L85 PathProgramCache]: Analyzing trace with hash -229604869, now seen corresponding path program 1 times [2025-01-09 04:52:25,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:25,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929185678] [2025-01-09 04:52:25,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:25,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:25,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:52:25,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:52:25,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:25,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:25,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:25,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929185678] [2025-01-09 04:52:25,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929185678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:25,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:25,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:52:25,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754764200] [2025-01-09 04:52:25,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:25,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:52:25,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:25,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:52:25,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:52:25,937 INFO L87 Difference]: Start difference. First operand 1257 states and 1670 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:26,323 INFO L93 Difference]: Finished difference Result 1801 states and 2409 transitions. [2025-01-09 04:52:26,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:52:26,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-01-09 04:52:26,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:26,327 INFO L225 Difference]: With dead ends: 1801 [2025-01-09 04:52:26,328 INFO L226 Difference]: Without dead ends: 1122 [2025-01-09 04:52:26,329 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-01-09 04:52:26,329 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 3045 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3045 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:26,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3045 Valid, 597 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:52:26,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-01-09 04:52:26,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2025-01-09 04:52:26,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1100 states have (on average 1.3681818181818182) internal successors, (1505), 1121 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1505 transitions. [2025-01-09 04:52:26,344 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1505 transitions. Word has length 89 [2025-01-09 04:52:26,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:26,344 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1505 transitions. [2025-01-09 04:52:26,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:26,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1505 transitions. [2025-01-09 04:52:26,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 04:52:26,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:26,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:52:26,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:52:26,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:26,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:26,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1455647616, now seen corresponding path program 1 times [2025-01-09 04:52:26,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:26,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709379399] [2025-01-09 04:52:26,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:26,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:26,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 04:52:26,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 04:52:26,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:26,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:26,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:26,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709379399] [2025-01-09 04:52:26,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709379399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:26,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:26,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:52:26,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230899358] [2025-01-09 04:52:26,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:26,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:52:26,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:26,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:52:26,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:52:26,498 INFO L87 Difference]: Start difference. First operand 1122 states and 1505 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:26,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:26,789 INFO L93 Difference]: Finished difference Result 1612 states and 2170 transitions. [2025-01-09 04:52:26,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:52:26,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-01-09 04:52:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:26,792 INFO L225 Difference]: With dead ends: 1612 [2025-01-09 04:52:26,792 INFO L226 Difference]: Without dead ends: 1002 [2025-01-09 04:52:26,793 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-01-09 04:52:26,793 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 2698 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2698 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:26,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2698 Valid, 557 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:52:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-01-09 04:52:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2025-01-09 04:52:26,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 980 states have (on average 1.3785714285714286) internal successors, (1351), 1001 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1351 transitions. [2025-01-09 04:52:26,809 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1351 transitions. Word has length 91 [2025-01-09 04:52:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:26,809 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1351 transitions. [2025-01-09 04:52:26,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1351 transitions. [2025-01-09 04:52:26,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:52:26,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:26,811 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] [2025-01-09 04:52:26,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:52:26,811 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:26,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:26,812 INFO L85 PathProgramCache]: Analyzing trace with hash 591523847, now seen corresponding path program 1 times [2025-01-09 04:52:26,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:26,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215010485] [2025-01-09 04:52:26,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:26,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:26,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:52:26,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:52:26,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:26,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:26,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:26,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215010485] [2025-01-09 04:52:26,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215010485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:26,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:26,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:52:26,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054958339] [2025-01-09 04:52:26,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:26,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:52:26,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:26,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:52:26,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:52:26,951 INFO L87 Difference]: Start difference. First operand 1002 states and 1351 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:27,354 INFO L93 Difference]: Finished difference Result 1453 states and 1960 transitions. [2025-01-09 04:52:27,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:52:27,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-01-09 04:52:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:27,357 INFO L225 Difference]: With dead ends: 1453 [2025-01-09 04:52:27,357 INFO L226 Difference]: Without dead ends: 994 [2025-01-09 04:52:27,358 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-01-09 04:52:27,359 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 2607 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2607 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:27,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2607 Valid, 482 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:52:27,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-01-09 04:52:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2025-01-09 04:52:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3786008230452675) internal successors, (1340), 993 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1340 transitions. [2025-01-09 04:52:27,371 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1340 transitions. Word has length 93 [2025-01-09 04:52:27,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:27,372 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1340 transitions. [2025-01-09 04:52:27,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:27,372 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1340 transitions. [2025-01-09 04:52:27,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:52:27,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:27,373 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] [2025-01-09 04:52:27,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:52:27,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:27,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:27,374 INFO L85 PathProgramCache]: Analyzing trace with hash 328441748, now seen corresponding path program 1 times [2025-01-09 04:52:27,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:27,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898420610] [2025-01-09 04:52:27,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:27,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:27,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:52:27,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:52:27,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:27,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:27,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:27,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898420610] [2025-01-09 04:52:27,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898420610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:27,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:27,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:52:27,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302367219] [2025-01-09 04:52:27,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:27,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:52:27,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:27,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:52:27,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:52:27,856 INFO L87 Difference]: Start difference. First operand 994 states and 1340 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:28,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:28,641 INFO L93 Difference]: Finished difference Result 1809 states and 2377 transitions. [2025-01-09 04:52:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:52:28,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 04:52:28,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:28,645 INFO L225 Difference]: With dead ends: 1809 [2025-01-09 04:52:28,645 INFO L226 Difference]: Without dead ends: 1357 [2025-01-09 04:52:28,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:52:28,646 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 4283 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4283 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:28,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4283 Valid, 1610 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:52:28,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2025-01-09 04:52:28,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 994. [2025-01-09 04:52:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3775720164609053) internal successors, (1339), 993 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1339 transitions. [2025-01-09 04:52:28,661 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1339 transitions. Word has length 95 [2025-01-09 04:52:28,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:28,661 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1339 transitions. [2025-01-09 04:52:28,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1339 transitions. [2025-01-09 04:52:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:52:28,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:28,665 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] [2025-01-09 04:52:28,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:52:28,665 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:28,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:28,665 INFO L85 PathProgramCache]: Analyzing trace with hash 556118932, now seen corresponding path program 1 times [2025-01-09 04:52:28,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:28,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658552391] [2025-01-09 04:52:28,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:28,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:28,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:52:28,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:52:28,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:28,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:29,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:29,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658552391] [2025-01-09 04:52:29,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658552391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:29,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:29,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:29,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136844292] [2025-01-09 04:52:29,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:29,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:29,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:29,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:29,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:29,044 INFO L87 Difference]: Start difference. First operand 994 states and 1339 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:30,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:30,020 INFO L93 Difference]: Finished difference Result 1355 states and 1851 transitions. [2025-01-09 04:52:30,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:52:30,020 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 04:52:30,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:30,023 INFO L225 Difference]: With dead ends: 1355 [2025-01-09 04:52:30,023 INFO L226 Difference]: Without dead ends: 1073 [2025-01-09 04:52:30,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:52:30,024 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 2621 mSDsluCounter, 2424 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2621 SdHoareTripleChecker+Valid, 2961 SdHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:30,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2621 Valid, 2961 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:52:30,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2025-01-09 04:52:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 994. [2025-01-09 04:52:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.376543209876543) internal successors, (1338), 993 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1338 transitions. [2025-01-09 04:52:30,039 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1338 transitions. Word has length 95 [2025-01-09 04:52:30,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:30,039 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1338 transitions. [2025-01-09 04:52:30,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1338 transitions. [2025-01-09 04:52:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:52:30,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:30,041 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] [2025-01-09 04:52:30,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:52:30,041 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:30,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:30,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1071889132, now seen corresponding path program 1 times [2025-01-09 04:52:30,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:30,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455746506] [2025-01-09 04:52:30,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:30,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:30,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:52:30,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:52:30,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:30,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:30,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:30,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:30,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455746506] [2025-01-09 04:52:30,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455746506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:30,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:30,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:30,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500347860] [2025-01-09 04:52:30,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:30,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:30,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:30,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:30,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:30,405 INFO L87 Difference]: Start difference. First operand 994 states and 1338 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:31,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:31,341 INFO L93 Difference]: Finished difference Result 1772 states and 2416 transitions. [2025-01-09 04:52:31,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:52:31,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 04:52:31,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:31,346 INFO L225 Difference]: With dead ends: 1772 [2025-01-09 04:52:31,346 INFO L226 Difference]: Without dead ends: 1566 [2025-01-09 04:52:31,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:52:31,347 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 4639 mSDsluCounter, 2147 mSDsCounter, 0 mSdLazyCounter, 1959 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4639 SdHoareTripleChecker+Valid, 2790 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:31,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4639 Valid, 2790 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1959 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:52:31,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2025-01-09 04:52:31,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 994. [2025-01-09 04:52:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.375514403292181) internal successors, (1337), 993 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1337 transitions. [2025-01-09 04:52:31,365 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1337 transitions. Word has length 95 [2025-01-09 04:52:31,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:31,366 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1337 transitions. [2025-01-09 04:52:31,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:31,366 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1337 transitions. [2025-01-09 04:52:31,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:52:31,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:31,367 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] [2025-01-09 04:52:31,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:52:31,368 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:31,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:31,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1164032538, now seen corresponding path program 1 times [2025-01-09 04:52:31,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:31,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438657375] [2025-01-09 04:52:31,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:31,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:31,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:52:31,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:52:31,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:31,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:31,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:31,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438657375] [2025-01-09 04:52:31,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438657375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:31,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:31,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:31,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32114480] [2025-01-09 04:52:31,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:31,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:31,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:31,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:31,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:31,670 INFO L87 Difference]: Start difference. First operand 994 states and 1337 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:32,568 INFO L93 Difference]: Finished difference Result 1708 states and 2321 transitions. [2025-01-09 04:52:32,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:52:32,568 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-01-09 04:52:32,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:32,572 INFO L225 Difference]: With dead ends: 1708 [2025-01-09 04:52:32,572 INFO L226 Difference]: Without dead ends: 1536 [2025-01-09 04:52:32,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:52:32,573 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 4904 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 1810 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4904 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:32,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4904 Valid, 2498 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1810 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:52:32,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2025-01-09 04:52:32,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 994. [2025-01-09 04:52:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.374485596707819) internal successors, (1336), 993 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:32,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1336 transitions. [2025-01-09 04:52:32,587 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1336 transitions. Word has length 96 [2025-01-09 04:52:32,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:32,587 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1336 transitions. [2025-01-09 04:52:32,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:32,587 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1336 transitions. [2025-01-09 04:52:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:52:32,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:32,589 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] [2025-01-09 04:52:32,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:52:32,589 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:32,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:32,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1887012889, now seen corresponding path program 1 times [2025-01-09 04:52:32,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:32,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870462663] [2025-01-09 04:52:32,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:32,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:32,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:52:32,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:52:32,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:32,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:32,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:32,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870462663] [2025-01-09 04:52:32,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870462663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:32,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:32,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:32,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073313813] [2025-01-09 04:52:32,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:32,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:32,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:32,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:32,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:32,865 INFO L87 Difference]: Start difference. First operand 994 states and 1336 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:33,659 INFO L93 Difference]: Finished difference Result 1580 states and 2157 transitions. [2025-01-09 04:52:33,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:52:33,659 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-01-09 04:52:33,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:33,662 INFO L225 Difference]: With dead ends: 1580 [2025-01-09 04:52:33,662 INFO L226 Difference]: Without dead ends: 1149 [2025-01-09 04:52:33,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:52:33,663 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 2675 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2675 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:33,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2675 Valid, 2495 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:52:33,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2025-01-09 04:52:33,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 994. [2025-01-09 04:52:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3724279835390947) internal successors, (1334), 993 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1334 transitions. [2025-01-09 04:52:33,675 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1334 transitions. Word has length 97 [2025-01-09 04:52:33,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:33,675 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1334 transitions. [2025-01-09 04:52:33,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:33,675 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1334 transitions. [2025-01-09 04:52:33,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:52:33,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:33,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:52:33,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:52:33,677 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:33,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:33,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2083812519, now seen corresponding path program 1 times [2025-01-09 04:52:33,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:33,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678470379] [2025-01-09 04:52:33,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:33,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:33,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:52:33,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:52:33,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:33,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:33,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:33,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678470379] [2025-01-09 04:52:33,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678470379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:33,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:33,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:33,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413364465] [2025-01-09 04:52:33,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:33,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:33,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:33,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:33,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:33,949 INFO L87 Difference]: Start difference. First operand 994 states and 1334 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:34,696 INFO L93 Difference]: Finished difference Result 1681 states and 2269 transitions. [2025-01-09 04:52:34,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:52:34,696 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-01-09 04:52:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:34,701 INFO L225 Difference]: With dead ends: 1681 [2025-01-09 04:52:34,701 INFO L226 Difference]: Without dead ends: 1512 [2025-01-09 04:52:34,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:52:34,701 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 3677 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3677 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:34,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3677 Valid, 2328 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1712 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:52:34,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-01-09 04:52:34,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 994. [2025-01-09 04:52:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3703703703703705) internal successors, (1332), 993 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:34,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1332 transitions. [2025-01-09 04:52:34,712 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1332 transitions. Word has length 97 [2025-01-09 04:52:34,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:34,712 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1332 transitions. [2025-01-09 04:52:34,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1332 transitions. [2025-01-09 04:52:34,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:52:34,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:34,714 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] [2025-01-09 04:52:34,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:52:34,714 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:34,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:34,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1112735129, now seen corresponding path program 1 times [2025-01-09 04:52:34,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:34,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261066665] [2025-01-09 04:52:34,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:34,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:34,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:52:34,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:52:34,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:34,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:34,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:34,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261066665] [2025-01-09 04:52:34,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261066665] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:34,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:34,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:34,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969615642] [2025-01-09 04:52:34,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:34,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:34,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:34,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:34,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:34,959 INFO L87 Difference]: Start difference. First operand 994 states and 1332 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:35,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:35,814 INFO L93 Difference]: Finished difference Result 1824 states and 2477 transitions. [2025-01-09 04:52:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:52:35,815 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-01-09 04:52:35,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:35,818 INFO L225 Difference]: With dead ends: 1824 [2025-01-09 04:52:35,818 INFO L226 Difference]: Without dead ends: 1566 [2025-01-09 04:52:35,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:52:35,819 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 4003 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 2243 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4003 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:35,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4003 Valid, 3309 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2243 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:52:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2025-01-09 04:52:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 994. [2025-01-09 04:52:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.368312757201646) internal successors, (1330), 993 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1330 transitions. [2025-01-09 04:52:35,829 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1330 transitions. Word has length 97 [2025-01-09 04:52:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:35,830 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1330 transitions. [2025-01-09 04:52:35,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1330 transitions. [2025-01-09 04:52:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:52:35,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:35,831 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] [2025-01-09 04:52:35,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:52:35,831 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:35,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:35,832 INFO L85 PathProgramCache]: Analyzing trace with hash 725787161, now seen corresponding path program 1 times [2025-01-09 04:52:35,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:35,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691193361] [2025-01-09 04:52:35,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:35,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:35,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:52:35,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:52:35,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:35,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:36,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:36,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691193361] [2025-01-09 04:52:36,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691193361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:36,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:36,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:36,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465511614] [2025-01-09 04:52:36,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:36,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:36,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:36,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:36,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:36,054 INFO L87 Difference]: Start difference. First operand 994 states and 1330 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:36,744 INFO L93 Difference]: Finished difference Result 1470 states and 1940 transitions. [2025-01-09 04:52:36,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:52:36,745 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-01-09 04:52:36,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:36,748 INFO L225 Difference]: With dead ends: 1470 [2025-01-09 04:52:36,748 INFO L226 Difference]: Without dead ends: 1464 [2025-01-09 04:52:36,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:52:36,749 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 2479 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2479 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:36,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2479 Valid, 2153 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:52:36,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2025-01-09 04:52:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 994. [2025-01-09 04:52:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.367283950617284) internal successors, (1329), 993 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1329 transitions. [2025-01-09 04:52:36,758 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1329 transitions. Word has length 97 [2025-01-09 04:52:36,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:36,758 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1329 transitions. [2025-01-09 04:52:36,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:36,758 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1329 transitions. [2025-01-09 04:52:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:52:36,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:36,759 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] [2025-01-09 04:52:36,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:52:36,760 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:36,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:36,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1939604839, now seen corresponding path program 1 times [2025-01-09 04:52:36,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:36,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847159595] [2025-01-09 04:52:36,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:36,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:36,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:52:36,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:52:36,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:36,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:36,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:36,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847159595] [2025-01-09 04:52:36,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847159595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:36,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:36,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:36,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305957847] [2025-01-09 04:52:36,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:36,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:36,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:36,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:36,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:36,993 INFO L87 Difference]: Start difference. First operand 994 states and 1329 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:37,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:37,822 INFO L93 Difference]: Finished difference Result 1669 states and 2247 transitions. [2025-01-09 04:52:37,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:52:37,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-01-09 04:52:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:37,825 INFO L225 Difference]: With dead ends: 1669 [2025-01-09 04:52:37,825 INFO L226 Difference]: Without dead ends: 1512 [2025-01-09 04:52:37,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:52:37,826 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 4149 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 2056 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4149 SdHoareTripleChecker+Valid, 2888 SdHoareTripleChecker+Invalid, 2063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:37,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4149 Valid, 2888 Invalid, 2063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2056 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:52:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-01-09 04:52:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 994. [2025-01-09 04:52:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3662551440329218) internal successors, (1328), 993 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1328 transitions. [2025-01-09 04:52:37,835 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1328 transitions. Word has length 97 [2025-01-09 04:52:37,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:37,835 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1328 transitions. [2025-01-09 04:52:37,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1328 transitions. [2025-01-09 04:52:37,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:52:37,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:37,836 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] [2025-01-09 04:52:37,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:52:37,838 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:37,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:37,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1267448231, now seen corresponding path program 1 times [2025-01-09 04:52:37,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:37,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452070768] [2025-01-09 04:52:37,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:37,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:37,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:52:37,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:52:37,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:37,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:38,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:38,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452070768] [2025-01-09 04:52:38,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452070768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:38,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:38,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:52:38,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899616991] [2025-01-09 04:52:38,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:38,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:52:38,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:38,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:52:38,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:52:38,398 INFO L87 Difference]: Start difference. First operand 994 states and 1328 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:39,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:39,841 INFO L93 Difference]: Finished difference Result 2398 states and 3320 transitions. [2025-01-09 04:52:39,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:52:39,842 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-01-09 04:52:39,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:39,847 INFO L225 Difference]: With dead ends: 2398 [2025-01-09 04:52:39,847 INFO L226 Difference]: Without dead ends: 2178 [2025-01-09 04:52:39,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:52:39,848 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 5593 mSDsluCounter, 3243 mSDsCounter, 0 mSdLazyCounter, 2924 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5593 SdHoareTripleChecker+Valid, 4049 SdHoareTripleChecker+Invalid, 3126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 2924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:39,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5593 Valid, 4049 Invalid, 3126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 2924 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:52:39,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2025-01-09 04:52:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 999. [2025-01-09 04:52:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 977 states have (on average 1.3643807574206754) internal successors, (1333), 998 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1333 transitions. [2025-01-09 04:52:39,859 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1333 transitions. Word has length 97 [2025-01-09 04:52:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:39,859 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1333 transitions. [2025-01-09 04:52:39,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1333 transitions. [2025-01-09 04:52:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:52:39,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:39,860 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] [2025-01-09 04:52:39,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:52:39,861 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:39,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1888632039, now seen corresponding path program 1 times [2025-01-09 04:52:39,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:39,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490911731] [2025-01-09 04:52:39,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:39,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:39,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:52:39,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:52:39,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:39,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:40,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:40,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:40,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490911731] [2025-01-09 04:52:40,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490911731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:40,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:40,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:40,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454900269] [2025-01-09 04:52:40,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:40,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:40,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:40,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:40,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:40,092 INFO L87 Difference]: Start difference. First operand 999 states and 1333 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:41,023 INFO L93 Difference]: Finished difference Result 1718 states and 2321 transitions. [2025-01-09 04:52:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:52:41,024 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-01-09 04:52:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:41,027 INFO L225 Difference]: With dead ends: 1718 [2025-01-09 04:52:41,027 INFO L226 Difference]: Without dead ends: 1541 [2025-01-09 04:52:41,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:52:41,028 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 3091 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3091 SdHoareTripleChecker+Valid, 3296 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:41,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3091 Valid, 3296 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:52:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2025-01-09 04:52:41,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 999. [2025-01-09 04:52:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 977 states have (on average 1.3633572159672467) internal successors, (1332), 998 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1332 transitions. [2025-01-09 04:52:41,038 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1332 transitions. Word has length 97 [2025-01-09 04:52:41,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:41,038 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1332 transitions. [2025-01-09 04:52:41,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1332 transitions. [2025-01-09 04:52:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:52:41,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:41,040 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] [2025-01-09 04:52:41,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:52:41,040 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:41,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:41,040 INFO L85 PathProgramCache]: Analyzing trace with hash -983974751, now seen corresponding path program 1 times [2025-01-09 04:52:41,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:41,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525104566] [2025-01-09 04:52:41,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:41,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:41,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:52:41,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:52:41,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:41,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:41,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:41,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525104566] [2025-01-09 04:52:41,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525104566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:41,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:41,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:41,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276814431] [2025-01-09 04:52:41,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:41,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:41,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:41,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:41,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:41,240 INFO L87 Difference]: Start difference. First operand 999 states and 1332 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:41,994 INFO L93 Difference]: Finished difference Result 1740 states and 2348 transitions. [2025-01-09 04:52:41,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:52:41,995 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-01-09 04:52:41,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:41,998 INFO L225 Difference]: With dead ends: 1740 [2025-01-09 04:52:41,998 INFO L226 Difference]: Without dead ends: 1541 [2025-01-09 04:52:41,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:52:42,000 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 3350 mSDsluCounter, 2081 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3350 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:42,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3350 Valid, 2709 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:52:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2025-01-09 04:52:42,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 999. [2025-01-09 04:52:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 977 states have (on average 1.361310133060389) internal successors, (1330), 998 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1330 transitions. [2025-01-09 04:52:42,009 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1330 transitions. Word has length 98 [2025-01-09 04:52:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:42,009 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1330 transitions. [2025-01-09 04:52:42,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1330 transitions. [2025-01-09 04:52:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:52:42,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:42,010 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] [2025-01-09 04:52:42,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:52:42,010 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:42,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:42,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1325336959, now seen corresponding path program 1 times [2025-01-09 04:52:42,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:42,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116146555] [2025-01-09 04:52:42,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:42,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:42,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:52:42,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:52:42,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:42,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:42,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:42,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116146555] [2025-01-09 04:52:42,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116146555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:42,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:42,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:42,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486029219] [2025-01-09 04:52:42,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:42,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:42,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:42,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:42,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:42,263 INFO L87 Difference]: Start difference. First operand 999 states and 1330 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:43,094 INFO L93 Difference]: Finished difference Result 1685 states and 2262 transitions. [2025-01-09 04:52:43,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:52:43,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-01-09 04:52:43,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:43,097 INFO L225 Difference]: With dead ends: 1685 [2025-01-09 04:52:43,097 INFO L226 Difference]: Without dead ends: 1517 [2025-01-09 04:52:43,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:52:43,097 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 4055 mSDsluCounter, 2476 mSDsCounter, 0 mSdLazyCounter, 2164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4055 SdHoareTripleChecker+Valid, 3062 SdHoareTripleChecker+Invalid, 2171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:43,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4055 Valid, 3062 Invalid, 2171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2164 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:52:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2025-01-09 04:52:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 999. [2025-01-09 04:52:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 977 states have (on average 1.3592630501535312) internal successors, (1328), 998 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1328 transitions. [2025-01-09 04:52:43,106 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1328 transitions. Word has length 98 [2025-01-09 04:52:43,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:43,106 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1328 transitions. [2025-01-09 04:52:43,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1328 transitions. [2025-01-09 04:52:43,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:52:43,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:43,107 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] [2025-01-09 04:52:43,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:52:43,107 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:43,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:43,108 INFO L85 PathProgramCache]: Analyzing trace with hash -773485919, now seen corresponding path program 1 times [2025-01-09 04:52:43,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:43,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372034549] [2025-01-09 04:52:43,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:43,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:43,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:52:43,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:52:43,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:43,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:43,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:43,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:43,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372034549] [2025-01-09 04:52:43,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372034549] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:43,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:43,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:52:43,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397583099] [2025-01-09 04:52:43,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:43,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:52:43,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:43,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:52:43,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:52:43,448 INFO L87 Difference]: Start difference. First operand 999 states and 1328 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:44,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:44,778 INFO L93 Difference]: Finished difference Result 2250 states and 3094 transitions. [2025-01-09 04:52:44,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:52:44,778 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-01-09 04:52:44,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:44,781 INFO L225 Difference]: With dead ends: 2250 [2025-01-09 04:52:44,781 INFO L226 Difference]: Without dead ends: 2073 [2025-01-09 04:52:44,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:52:44,782 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 7272 mSDsluCounter, 3212 mSDsCounter, 0 mSdLazyCounter, 2912 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7272 SdHoareTripleChecker+Valid, 3897 SdHoareTripleChecker+Invalid, 3138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 2912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:44,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7272 Valid, 3897 Invalid, 3138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 2912 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:52:44,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2025-01-09 04:52:44,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 1004. [2025-01-09 04:52:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 982 states have (on average 1.3574338085539714) internal successors, (1333), 1003 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:44,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1333 transitions. [2025-01-09 04:52:44,794 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1333 transitions. Word has length 98 [2025-01-09 04:52:44,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:44,794 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1333 transitions. [2025-01-09 04:52:44,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:44,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1333 transitions. [2025-01-09 04:52:44,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:52:44,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:44,795 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] [2025-01-09 04:52:44,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:52:44,796 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:44,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:44,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1077039647, now seen corresponding path program 1 times [2025-01-09 04:52:44,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:44,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058660922] [2025-01-09 04:52:44,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:44,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:44,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:52:44,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:52:44,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:44,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:45,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:45,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058660922] [2025-01-09 04:52:45,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058660922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:45,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:45,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:45,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428327759] [2025-01-09 04:52:45,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:45,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:45,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:45,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:45,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:45,045 INFO L87 Difference]: Start difference. First operand 1004 states and 1333 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:45,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:45,850 INFO L93 Difference]: Finished difference Result 1680 states and 2252 transitions. [2025-01-09 04:52:45,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:52:45,850 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-01-09 04:52:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:45,852 INFO L225 Difference]: With dead ends: 1680 [2025-01-09 04:52:45,852 INFO L226 Difference]: Without dead ends: 1522 [2025-01-09 04:52:45,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:52:45,853 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 3953 mSDsluCounter, 2639 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3953 SdHoareTripleChecker+Valid, 3280 SdHoareTripleChecker+Invalid, 2341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:45,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3953 Valid, 3280 Invalid, 2341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:52:45,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2025-01-09 04:52:45,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1004. [2025-01-09 04:52:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 982 states have (on average 1.3564154786150713) internal successors, (1332), 1003 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:45,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1332 transitions. [2025-01-09 04:52:45,862 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1332 transitions. Word has length 98 [2025-01-09 04:52:45,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:45,862 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1332 transitions. [2025-01-09 04:52:45,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:45,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1332 transitions. [2025-01-09 04:52:45,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:52:45,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:45,863 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] [2025-01-09 04:52:45,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:52:45,863 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:45,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:45,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1588992191, now seen corresponding path program 1 times [2025-01-09 04:52:45,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:45,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611768981] [2025-01-09 04:52:45,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:45,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:45,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:52:45,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:52:45,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:45,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:46,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:46,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:46,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611768981] [2025-01-09 04:52:46,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611768981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:46,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:46,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:46,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864584951] [2025-01-09 04:52:46,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:46,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:46,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:46,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:46,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:46,059 INFO L87 Difference]: Start difference. First operand 1004 states and 1332 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:46,715 INFO L93 Difference]: Finished difference Result 1680 states and 2251 transitions. [2025-01-09 04:52:46,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:52:46,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-01-09 04:52:46,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:46,721 INFO L225 Difference]: With dead ends: 1680 [2025-01-09 04:52:46,721 INFO L226 Difference]: Without dead ends: 1522 [2025-01-09 04:52:46,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:52:46,722 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 4007 mSDsluCounter, 1912 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4007 SdHoareTripleChecker+Valid, 2496 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:46,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4007 Valid, 2496 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:52:46,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2025-01-09 04:52:46,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1004. [2025-01-09 04:52:46,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 982 states have (on average 1.3553971486761711) internal successors, (1331), 1003 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:46,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1331 transitions. [2025-01-09 04:52:46,732 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1331 transitions. Word has length 98 [2025-01-09 04:52:46,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:46,732 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1331 transitions. [2025-01-09 04:52:46,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:46,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1331 transitions. [2025-01-09 04:52:46,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:52:46,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:46,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] [2025-01-09 04:52:46,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:52:46,733 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:46,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:46,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1926953537, now seen corresponding path program 1 times [2025-01-09 04:52:46,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:46,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131879568] [2025-01-09 04:52:46,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:46,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:46,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:52:46,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:52:46,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:46,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:47,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:47,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131879568] [2025-01-09 04:52:47,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131879568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:47,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:47,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:47,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505246515] [2025-01-09 04:52:47,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:47,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:47,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:47,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:47,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:47,005 INFO L87 Difference]: Start difference. First operand 1004 states and 1331 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:47,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:47,793 INFO L93 Difference]: Finished difference Result 1623 states and 2156 transitions. [2025-01-09 04:52:47,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:52:47,793 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-01-09 04:52:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:47,795 INFO L225 Difference]: With dead ends: 1623 [2025-01-09 04:52:47,795 INFO L226 Difference]: Without dead ends: 1474 [2025-01-09 04:52:47,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:52:47,797 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 4150 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 2020 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4150 SdHoareTripleChecker+Valid, 2769 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:47,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4150 Valid, 2769 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2020 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:52:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2025-01-09 04:52:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1004. [2025-01-09 04:52:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 982 states have (on average 1.354378818737271) internal successors, (1330), 1003 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1330 transitions. [2025-01-09 04:52:47,812 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1330 transitions. Word has length 98 [2025-01-09 04:52:47,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:47,812 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1330 transitions. [2025-01-09 04:52:47,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:47,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1330 transitions. [2025-01-09 04:52:47,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:52:47,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:47,814 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] [2025-01-09 04:52:47,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:52:47,814 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:47,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:47,814 INFO L85 PathProgramCache]: Analyzing trace with hash -650592069, now seen corresponding path program 1 times [2025-01-09 04:52:47,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:47,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021101925] [2025-01-09 04:52:47,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:47,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:47,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:52:47,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:52:47,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:47,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:48,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:48,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021101925] [2025-01-09 04:52:48,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021101925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:48,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:48,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:48,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939488965] [2025-01-09 04:52:48,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:48,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:48,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:48,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:48,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:48,020 INFO L87 Difference]: Start difference. First operand 1004 states and 1330 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:48,667 INFO L93 Difference]: Finished difference Result 1684 states and 2252 transitions. [2025-01-09 04:52:48,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:52:48,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-01-09 04:52:48,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:48,670 INFO L225 Difference]: With dead ends: 1684 [2025-01-09 04:52:48,670 INFO L226 Difference]: Without dead ends: 1522 [2025-01-09 04:52:48,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:52:48,671 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 3489 mSDsluCounter, 1919 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3489 SdHoareTripleChecker+Valid, 2505 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:48,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3489 Valid, 2505 Invalid, 1791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:52:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2025-01-09 04:52:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1004. [2025-01-09 04:52:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 982 states have (on average 1.3533604887983706) internal successors, (1329), 1003 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1329 transitions. [2025-01-09 04:52:48,680 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1329 transitions. Word has length 98 [2025-01-09 04:52:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:48,680 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1329 transitions. [2025-01-09 04:52:48,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1329 transitions. [2025-01-09 04:52:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:52:48,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:48,681 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] [2025-01-09 04:52:48,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:52:48,682 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:48,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:48,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1680548315, now seen corresponding path program 1 times [2025-01-09 04:52:48,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:48,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45707297] [2025-01-09 04:52:48,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:48,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:48,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:52:48,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:52:48,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:48,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:48,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:48,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45707297] [2025-01-09 04:52:48,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45707297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:48,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:48,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:48,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844806515] [2025-01-09 04:52:48,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:48,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:48,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:48,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:48,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:48,905 INFO L87 Difference]: Start difference. First operand 1004 states and 1329 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:49,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:49,841 INFO L93 Difference]: Finished difference Result 1791 states and 2412 transitions. [2025-01-09 04:52:49,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:52:49,841 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-01-09 04:52:49,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:49,844 INFO L225 Difference]: With dead ends: 1791 [2025-01-09 04:52:49,844 INFO L226 Difference]: Without dead ends: 1571 [2025-01-09 04:52:49,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:52:49,845 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 2714 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 2393 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2714 SdHoareTripleChecker+Valid, 3496 SdHoareTripleChecker+Invalid, 2398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:49,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2714 Valid, 3496 Invalid, 2398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2393 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:52:49,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2025-01-09 04:52:49,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 999. [2025-01-09 04:52:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 977 states have (on average 1.354145342886387) internal successors, (1323), 998 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1323 transitions. [2025-01-09 04:52:49,853 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1323 transitions. Word has length 98 [2025-01-09 04:52:49,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:49,853 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1323 transitions. [2025-01-09 04:52:49,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:49,853 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1323 transitions. [2025-01-09 04:52:49,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:52:49,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:49,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:52:49,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:52:49,854 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:49,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:49,855 INFO L85 PathProgramCache]: Analyzing trace with hash -542784863, now seen corresponding path program 1 times [2025-01-09 04:52:49,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:49,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725140412] [2025-01-09 04:52:49,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:49,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:49,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:52:49,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:52:49,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:49,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:50,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:50,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725140412] [2025-01-09 04:52:50,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725140412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:50,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:50,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:50,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048356318] [2025-01-09 04:52:50,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:50,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:50,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:50,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:50,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:50,072 INFO L87 Difference]: Start difference. First operand 999 states and 1323 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:50,756 INFO L93 Difference]: Finished difference Result 1675 states and 2241 transitions. [2025-01-09 04:52:50,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:52:50,757 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-01-09 04:52:50,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:50,759 INFO L225 Difference]: With dead ends: 1675 [2025-01-09 04:52:50,759 INFO L226 Difference]: Without dead ends: 1517 [2025-01-09 04:52:50,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:52:50,760 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 3156 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3156 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:50,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3156 Valid, 2788 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1951 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:52:50,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2025-01-09 04:52:50,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 999. [2025-01-09 04:52:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 977 states have (on average 1.353121801432958) internal successors, (1322), 998 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1322 transitions. [2025-01-09 04:52:50,768 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1322 transitions. Word has length 98 [2025-01-09 04:52:50,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:50,768 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1322 transitions. [2025-01-09 04:52:50,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:50,769 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1322 transitions. [2025-01-09 04:52:50,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:52:50,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:50,769 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] [2025-01-09 04:52:50,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:52:50,770 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:50,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:50,770 INFO L85 PathProgramCache]: Analyzing trace with hash -308070434, now seen corresponding path program 1 times [2025-01-09 04:52:50,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:50,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858410506] [2025-01-09 04:52:50,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:50,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:50,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:52:50,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:52:50,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:50,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:50,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:50,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858410506] [2025-01-09 04:52:50,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858410506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:50,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:50,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:50,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103171221] [2025-01-09 04:52:50,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:50,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:50,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:50,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:50,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:50,946 INFO L87 Difference]: Start difference. First operand 999 states and 1322 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:51,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:51,717 INFO L93 Difference]: Finished difference Result 1863 states and 2504 transitions. [2025-01-09 04:52:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:52:51,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 04:52:51,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:51,720 INFO L225 Difference]: With dead ends: 1863 [2025-01-09 04:52:51,720 INFO L226 Difference]: Without dead ends: 1571 [2025-01-09 04:52:51,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:52:51,721 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 1850 mSDsluCounter, 2663 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1850 SdHoareTripleChecker+Valid, 3480 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:51,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1850 Valid, 3480 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2375 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:52:51,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2025-01-09 04:52:51,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 999. [2025-01-09 04:52:51,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 977 states have (on average 1.3510747185261003) internal successors, (1320), 998 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1320 transitions. [2025-01-09 04:52:51,729 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1320 transitions. Word has length 99 [2025-01-09 04:52:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:51,730 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1320 transitions. [2025-01-09 04:52:51,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:51,730 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1320 transitions. [2025-01-09 04:52:51,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:52:51,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:51,730 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] [2025-01-09 04:52:51,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:52:51,731 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:51,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:51,731 INFO L85 PathProgramCache]: Analyzing trace with hash 234210846, now seen corresponding path program 1 times [2025-01-09 04:52:51,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:51,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266050798] [2025-01-09 04:52:51,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:51,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:51,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:52:51,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:52:51,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:51,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:51,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:51,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266050798] [2025-01-09 04:52:51,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266050798] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:51,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:51,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:51,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140556009] [2025-01-09 04:52:51,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:51,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:51,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:51,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:51,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:51,950 INFO L87 Difference]: Start difference. First operand 999 states and 1320 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:52,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:52,786 INFO L93 Difference]: Finished difference Result 1747 states and 2344 transitions. [2025-01-09 04:52:52,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:52:52,787 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 04:52:52,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:52,789 INFO L225 Difference]: With dead ends: 1747 [2025-01-09 04:52:52,789 INFO L226 Difference]: Without dead ends: 1536 [2025-01-09 04:52:52,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:52:52,790 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 4076 mSDsluCounter, 2394 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4076 SdHoareTripleChecker+Valid, 3127 SdHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:52,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4076 Valid, 3127 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:52:52,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2025-01-09 04:52:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 999. [2025-01-09 04:52:52,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 977 states have (on average 1.3490276356192425) internal successors, (1318), 998 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1318 transitions. [2025-01-09 04:52:52,799 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1318 transitions. Word has length 99 [2025-01-09 04:52:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:52,800 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1318 transitions. [2025-01-09 04:52:52,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1318 transitions. [2025-01-09 04:52:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:52:52,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:52,801 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] [2025-01-09 04:52:52,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:52:52,801 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:52,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:52,801 INFO L85 PathProgramCache]: Analyzing trace with hash -271572002, now seen corresponding path program 1 times [2025-01-09 04:52:52,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:52,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500094287] [2025-01-09 04:52:52,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:52,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:52,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:52:52,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:52:52,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:52,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:52,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:52,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500094287] [2025-01-09 04:52:52,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500094287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:52,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:52,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:52,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412522799] [2025-01-09 04:52:52,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:52,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:52,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:53,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:53,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:53,003 INFO L87 Difference]: Start difference. First operand 999 states and 1318 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:53,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:53,651 INFO L93 Difference]: Finished difference Result 1627 states and 2153 transitions. [2025-01-09 04:52:53,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:52:53,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 04:52:53,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:53,653 INFO L225 Difference]: With dead ends: 1627 [2025-01-09 04:52:53,653 INFO L226 Difference]: Without dead ends: 1469 [2025-01-09 04:52:53,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:52:53,654 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 4617 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4617 SdHoareTripleChecker+Valid, 2335 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:53,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4617 Valid, 2335 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:52:53,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2025-01-09 04:52:53,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 999. [2025-01-09 04:52:53,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 977 states have (on average 1.3469805527123848) internal successors, (1316), 998 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1316 transitions. [2025-01-09 04:52:53,663 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1316 transitions. Word has length 99 [2025-01-09 04:52:53,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:53,663 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1316 transitions. [2025-01-09 04:52:53,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:53,664 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1316 transitions. [2025-01-09 04:52:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:52:53,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:53,665 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] [2025-01-09 04:52:53,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:52:53,665 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:53,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:53,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1756072034, now seen corresponding path program 1 times [2025-01-09 04:52:53,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:53,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951872463] [2025-01-09 04:52:53,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:53,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:53,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:52:53,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:52:53,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:53,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:53,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:53,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951872463] [2025-01-09 04:52:53,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951872463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:53,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:53,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:53,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920397089] [2025-01-09 04:52:53,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:53,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:53,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:53,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:53,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:53,853 INFO L87 Difference]: Start difference. First operand 999 states and 1316 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:54,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:54,558 INFO L93 Difference]: Finished difference Result 1733 states and 2319 transitions. [2025-01-09 04:52:54,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:52:54,558 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 04:52:54,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:54,561 INFO L225 Difference]: With dead ends: 1733 [2025-01-09 04:52:54,561 INFO L226 Difference]: Without dead ends: 1536 [2025-01-09 04:52:54,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:52:54,562 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 3723 mSDsluCounter, 2387 mSDsCounter, 0 mSdLazyCounter, 2088 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3723 SdHoareTripleChecker+Valid, 3118 SdHoareTripleChecker+Invalid, 2095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:54,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3723 Valid, 3118 Invalid, 2095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2088 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:52:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2025-01-09 04:52:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 999. [2025-01-09 04:52:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 977 states have (on average 1.344933469805527) internal successors, (1314), 998 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:54,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1314 transitions. [2025-01-09 04:52:54,571 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1314 transitions. Word has length 99 [2025-01-09 04:52:54,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:54,572 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1314 transitions. [2025-01-09 04:52:54,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:54,572 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1314 transitions. [2025-01-09 04:52:54,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:52:54,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:54,573 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] [2025-01-09 04:52:54,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:52:54,573 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:54,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:54,573 INFO L85 PathProgramCache]: Analyzing trace with hash 786851038, now seen corresponding path program 1 times [2025-01-09 04:52:54,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:54,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981260458] [2025-01-09 04:52:54,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:54,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:54,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:52:54,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:52:54,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:54,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:54,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:54,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:54,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981260458] [2025-01-09 04:52:54,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981260458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:54,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:54,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:54,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540987266] [2025-01-09 04:52:54,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:54,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:54,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:54,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:54,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:54,788 INFO L87 Difference]: Start difference. First operand 999 states and 1314 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:55,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:55,424 INFO L93 Difference]: Finished difference Result 1475 states and 1921 transitions. [2025-01-09 04:52:55,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:52:55,424 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 04:52:55,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:55,426 INFO L225 Difference]: With dead ends: 1475 [2025-01-09 04:52:55,427 INFO L226 Difference]: Without dead ends: 1469 [2025-01-09 04:52:55,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:52:55,427 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 3491 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3491 SdHoareTripleChecker+Valid, 2335 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:55,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3491 Valid, 2335 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:52:55,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2025-01-09 04:52:55,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 999. [2025-01-09 04:52:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 977 states have (on average 1.3428863868986693) internal successors, (1312), 998 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1312 transitions. [2025-01-09 04:52:55,436 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1312 transitions. Word has length 99 [2025-01-09 04:52:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:55,436 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1312 transitions. [2025-01-09 04:52:55,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:55,436 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1312 transitions. [2025-01-09 04:52:55,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:52:55,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:55,437 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] [2025-01-09 04:52:55,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 04:52:55,437 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:55,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:55,438 INFO L85 PathProgramCache]: Analyzing trace with hash -370973194, now seen corresponding path program 1 times [2025-01-09 04:52:55,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:55,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134151741] [2025-01-09 04:52:55,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:55,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:55,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:52:55,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:52:55,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:55,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:55,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:55,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134151741] [2025-01-09 04:52:55,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134151741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:55,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:55,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:55,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628543365] [2025-01-09 04:52:55,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:55,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:55,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:55,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:55,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:55,650 INFO L87 Difference]: Start difference. First operand 999 states and 1312 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:56,368 INFO L93 Difference]: Finished difference Result 1617 states and 2132 transitions. [2025-01-09 04:52:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:52:56,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 04:52:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:56,370 INFO L225 Difference]: With dead ends: 1617 [2025-01-09 04:52:56,370 INFO L226 Difference]: Without dead ends: 1467 [2025-01-09 04:52:56,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:52:56,371 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 4066 mSDsluCounter, 2279 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4066 SdHoareTripleChecker+Valid, 2843 SdHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:56,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4066 Valid, 2843 Invalid, 2029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:52:56,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2025-01-09 04:52:56,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 997. [2025-01-09 04:52:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 975 states have (on average 1.3415384615384616) internal successors, (1308), 996 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1308 transitions. [2025-01-09 04:52:56,387 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1308 transitions. Word has length 99 [2025-01-09 04:52:56,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:56,387 INFO L471 AbstractCegarLoop]: Abstraction has 997 states and 1308 transitions. [2025-01-09 04:52:56,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:56,387 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1308 transitions. [2025-01-09 04:52:56,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:52:56,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:56,388 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] [2025-01-09 04:52:56,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 04:52:56,388 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:56,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:56,389 INFO L85 PathProgramCache]: Analyzing trace with hash 193533868, now seen corresponding path program 1 times [2025-01-09 04:52:56,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:56,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839248350] [2025-01-09 04:52:56,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:56,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:56,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:52:56,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:52:56,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:56,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:56,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:56,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:56,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839248350] [2025-01-09 04:52:56,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839248350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:56,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:56,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:56,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205177929] [2025-01-09 04:52:56,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:56,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:56,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:56,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:56,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:56,620 INFO L87 Difference]: Start difference. First operand 997 states and 1308 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:57,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:57,427 INFO L93 Difference]: Finished difference Result 1615 states and 2128 transitions. [2025-01-09 04:52:57,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:52:57,427 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 04:52:57,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:57,429 INFO L225 Difference]: With dead ends: 1615 [2025-01-09 04:52:57,429 INFO L226 Difference]: Without dead ends: 1466 [2025-01-09 04:52:57,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:52:57,430 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 4058 mSDsluCounter, 2279 mSDsCounter, 0 mSdLazyCounter, 2014 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4058 SdHoareTripleChecker+Valid, 2843 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:57,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4058 Valid, 2843 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2014 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:52:57,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2025-01-09 04:52:57,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 996. [2025-01-09 04:52:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 974 states have (on average 1.3408624229979467) internal successors, (1306), 995 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:57,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1306 transitions. [2025-01-09 04:52:57,438 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1306 transitions. Word has length 99 [2025-01-09 04:52:57,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:57,438 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1306 transitions. [2025-01-09 04:52:57,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:57,439 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1306 transitions. [2025-01-09 04:52:57,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:52:57,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:57,440 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] [2025-01-09 04:52:57,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:52:57,440 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:57,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:57,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1237089452, now seen corresponding path program 1 times [2025-01-09 04:52:57,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:57,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317622122] [2025-01-09 04:52:57,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:57,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:57,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:52:57,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:52:57,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:57,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:57,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:57,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317622122] [2025-01-09 04:52:57,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317622122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:57,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:57,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:57,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263126991] [2025-01-09 04:52:57,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:57,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:57,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:57,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:57,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:57,650 INFO L87 Difference]: Start difference. First operand 996 states and 1306 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:58,406 INFO L93 Difference]: Finished difference Result 1614 states and 2126 transitions. [2025-01-09 04:52:58,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:52:58,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 04:52:58,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:58,408 INFO L225 Difference]: With dead ends: 1614 [2025-01-09 04:52:58,408 INFO L226 Difference]: Without dead ends: 1465 [2025-01-09 04:52:58,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:52:58,409 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 3089 mSDsluCounter, 2483 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3089 SdHoareTripleChecker+Valid, 3115 SdHoareTripleChecker+Invalid, 2180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:58,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3089 Valid, 3115 Invalid, 2180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:52:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2025-01-09 04:52:58,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 995. [2025-01-09 04:52:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 973 states have (on average 1.3401849948612539) internal successors, (1304), 994 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:58,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1304 transitions. [2025-01-09 04:52:58,416 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1304 transitions. Word has length 99 [2025-01-09 04:52:58,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:58,417 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1304 transitions. [2025-01-09 04:52:58,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1304 transitions. [2025-01-09 04:52:58,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:52:58,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:58,418 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] [2025-01-09 04:52:58,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:52:58,418 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:58,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:58,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1049556564, now seen corresponding path program 1 times [2025-01-09 04:52:58,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:58,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255551443] [2025-01-09 04:52:58,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:58,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:58,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:52:58,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:52:58,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:58,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:58,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:58,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255551443] [2025-01-09 04:52:58,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255551443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:58,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:58,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:58,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100946112] [2025-01-09 04:52:58,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:58,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:58,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:58,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:58,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:58,611 INFO L87 Difference]: Start difference. First operand 995 states and 1304 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:59,231 INFO L93 Difference]: Finished difference Result 1612 states and 2123 transitions. [2025-01-09 04:52:59,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:52:59,231 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 04:52:59,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:59,233 INFO L225 Difference]: With dead ends: 1612 [2025-01-09 04:52:59,233 INFO L226 Difference]: Without dead ends: 1463 [2025-01-09 04:52:59,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:52:59,233 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 4003 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4003 SdHoareTripleChecker+Valid, 2320 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:59,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4003 Valid, 2320 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:52:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2025-01-09 04:52:59,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 994. [2025-01-09 04:52:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3395061728395061) internal successors, (1302), 993 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1302 transitions. [2025-01-09 04:52:59,243 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1302 transitions. Word has length 99 [2025-01-09 04:52:59,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:59,245 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1302 transitions. [2025-01-09 04:52:59,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:59,245 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1302 transitions. [2025-01-09 04:52:59,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:52:59,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:59,246 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] [2025-01-09 04:52:59,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 04:52:59,246 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:52:59,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:59,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1664921314, now seen corresponding path program 1 times [2025-01-09 04:52:59,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:59,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551993163] [2025-01-09 04:52:59,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:59,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:59,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:52:59,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:52:59,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:59,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:59,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:59,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551993163] [2025-01-09 04:52:59,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551993163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:59,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:59,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:52:59,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203591521] [2025-01-09 04:52:59,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:59,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:52:59,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:59,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:52:59,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:52:59,745 INFO L87 Difference]: Start difference. First operand 994 states and 1302 transitions. Second operand has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:00,643 INFO L93 Difference]: Finished difference Result 2437 states and 3210 transitions. [2025-01-09 04:53:00,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:53:00,644 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 04:53:00,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:00,646 INFO L225 Difference]: With dead ends: 2437 [2025-01-09 04:53:00,646 INFO L226 Difference]: Without dead ends: 2284 [2025-01-09 04:53:00,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:53:00,647 INFO L435 NwaCegarLoop]: 1077 mSDtfsCounter, 4218 mSDsluCounter, 7205 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4218 SdHoareTripleChecker+Valid, 8282 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:00,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4218 Valid, 8282 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:53:00,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2025-01-09 04:53:00,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 989. [2025-01-09 04:53:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 967 states have (on average 1.3381592554291624) internal successors, (1294), 988 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:00,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1294 transitions. [2025-01-09 04:53:00,656 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1294 transitions. Word has length 99 [2025-01-09 04:53:00,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:00,656 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1294 transitions. [2025-01-09 04:53:00,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:00,656 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1294 transitions. [2025-01-09 04:53:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:53:00,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:00,657 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] [2025-01-09 04:53:00,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 04:53:00,657 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:00,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:00,658 INFO L85 PathProgramCache]: Analyzing trace with hash 703065305, now seen corresponding path program 1 times [2025-01-09 04:53:00,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:00,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053222020] [2025-01-09 04:53:00,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:00,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:00,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:53:00,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:53:00,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:00,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:00,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:00,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:00,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053222020] [2025-01-09 04:53:00,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053222020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:00,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:00,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:00,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538406046] [2025-01-09 04:53:00,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:00,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:00,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:00,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:00,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:00,853 INFO L87 Difference]: Start difference. First operand 989 states and 1294 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:01,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:01,587 INFO L93 Difference]: Finished difference Result 1702 states and 2266 transitions. [2025-01-09 04:53:01,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:53:01,587 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 04:53:01,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:01,588 INFO L225 Difference]: With dead ends: 1702 [2025-01-09 04:53:01,588 INFO L226 Difference]: Without dead ends: 1525 [2025-01-09 04:53:01,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:53:01,589 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 1927 mSDsluCounter, 2430 mSDsCounter, 0 mSdLazyCounter, 2087 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1927 SdHoareTripleChecker+Valid, 3176 SdHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:01,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1927 Valid, 3176 Invalid, 2093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2087 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:53:01,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2025-01-09 04:53:01,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 984. [2025-01-09 04:53:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 962 states have (on average 1.338877338877339) internal successors, (1288), 983 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1288 transitions. [2025-01-09 04:53:01,596 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1288 transitions. Word has length 99 [2025-01-09 04:53:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:01,596 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1288 transitions. [2025-01-09 04:53:01,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1288 transitions. [2025-01-09 04:53:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:53:01,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:01,597 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] [2025-01-09 04:53:01,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 04:53:01,597 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:01,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:01,598 INFO L85 PathProgramCache]: Analyzing trace with hash -178103298, now seen corresponding path program 1 times [2025-01-09 04:53:01,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:01,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170815159] [2025-01-09 04:53:01,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:01,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:01,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:53:01,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:53:01,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:01,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:01,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:01,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170815159] [2025-01-09 04:53:01,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170815159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:01,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:01,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:01,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777927602] [2025-01-09 04:53:01,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:01,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:01,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:01,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:01,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:01,779 INFO L87 Difference]: Start difference. First operand 984 states and 1288 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:02,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:02,477 INFO L93 Difference]: Finished difference Result 1663 states and 2208 transitions. [2025-01-09 04:53:02,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:53:02,477 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 04:53:02,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:02,478 INFO L225 Difference]: With dead ends: 1663 [2025-01-09 04:53:02,479 INFO L226 Difference]: Without dead ends: 1501 [2025-01-09 04:53:02,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:53:02,479 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 3604 mSDsluCounter, 2126 mSDsCounter, 0 mSdLazyCounter, 1891 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3604 SdHoareTripleChecker+Valid, 2783 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:02,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3604 Valid, 2783 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1891 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:53:02,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2025-01-09 04:53:02,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 984. [2025-01-09 04:53:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 962 states have (on average 1.337837837837838) internal successors, (1287), 983 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1287 transitions. [2025-01-09 04:53:02,487 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1287 transitions. Word has length 99 [2025-01-09 04:53:02,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:02,487 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1287 transitions. [2025-01-09 04:53:02,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1287 transitions. [2025-01-09 04:53:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:53:02,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:02,488 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] [2025-01-09 04:53:02,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 04:53:02,488 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:02,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:02,489 INFO L85 PathProgramCache]: Analyzing trace with hash -679193058, now seen corresponding path program 1 times [2025-01-09 04:53:02,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:02,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084835052] [2025-01-09 04:53:02,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:02,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:02,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:53:02,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:53:02,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:02,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:02,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:02,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:02,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084835052] [2025-01-09 04:53:02,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084835052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:02,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:02,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:02,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296307658] [2025-01-09 04:53:02,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:02,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:02,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:02,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:02,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:02,679 INFO L87 Difference]: Start difference. First operand 984 states and 1287 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:03,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:03,438 INFO L93 Difference]: Finished difference Result 1711 states and 2274 transitions. [2025-01-09 04:53:03,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:53:03,438 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 04:53:03,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:03,440 INFO L225 Difference]: With dead ends: 1711 [2025-01-09 04:53:03,440 INFO L226 Difference]: Without dead ends: 1525 [2025-01-09 04:53:03,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:53:03,441 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 3827 mSDsluCounter, 2430 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3827 SdHoareTripleChecker+Valid, 3176 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:03,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3827 Valid, 3176 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2074 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:53:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2025-01-09 04:53:03,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 984. [2025-01-09 04:53:03,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 962 states have (on average 1.3367983367983367) internal successors, (1286), 983 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1286 transitions. [2025-01-09 04:53:03,450 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1286 transitions. Word has length 99 [2025-01-09 04:53:03,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:03,450 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1286 transitions. [2025-01-09 04:53:03,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:03,450 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1286 transitions. [2025-01-09 04:53:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:53:03,451 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:03,451 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] [2025-01-09 04:53:03,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 04:53:03,451 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:03,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:03,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1060069596, now seen corresponding path program 1 times [2025-01-09 04:53:03,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:03,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97915795] [2025-01-09 04:53:03,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:03,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:03,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:53:03,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:53:03,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:03,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:03,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:03,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:03,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97915795] [2025-01-09 04:53:03,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97915795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:03,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:03,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:03,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322131040] [2025-01-09 04:53:03,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:03,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:03,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:03,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:03,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:03,664 INFO L87 Difference]: Start difference. First operand 984 states and 1286 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:04,389 INFO L93 Difference]: Finished difference Result 1607 states and 2110 transitions. [2025-01-09 04:53:04,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:53:04,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-01-09 04:53:04,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:04,391 INFO L225 Difference]: With dead ends: 1607 [2025-01-09 04:53:04,391 INFO L226 Difference]: Without dead ends: 1453 [2025-01-09 04:53:04,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:53:04,392 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 3969 mSDsluCounter, 2296 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3969 SdHoareTripleChecker+Valid, 2866 SdHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:04,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3969 Valid, 2866 Invalid, 1990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:53:04,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2025-01-09 04:53:04,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 984. [2025-01-09 04:53:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 962 states have (on average 1.3347193347193347) internal successors, (1284), 983 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1284 transitions. [2025-01-09 04:53:04,399 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1284 transitions. Word has length 100 [2025-01-09 04:53:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:04,399 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1284 transitions. [2025-01-09 04:53:04,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:04,399 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1284 transitions. [2025-01-09 04:53:04,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:53:04,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:04,400 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] [2025-01-09 04:53:04,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 04:53:04,400 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:04,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:04,401 INFO L85 PathProgramCache]: Analyzing trace with hash -253824772, now seen corresponding path program 1 times [2025-01-09 04:53:04,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:04,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617662405] [2025-01-09 04:53:04,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:04,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:04,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:53:04,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:53:04,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:04,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:04,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:04,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:04,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617662405] [2025-01-09 04:53:04,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617662405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:04,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:04,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:04,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284721370] [2025-01-09 04:53:04,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:04,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:04,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:04,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:04,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:04,619 INFO L87 Difference]: Start difference. First operand 984 states and 1284 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:05,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:05,504 INFO L93 Difference]: Finished difference Result 1675 states and 2217 transitions. [2025-01-09 04:53:05,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:53:05,505 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-01-09 04:53:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:05,506 INFO L225 Difference]: With dead ends: 1675 [2025-01-09 04:53:05,506 INFO L226 Difference]: Without dead ends: 1501 [2025-01-09 04:53:05,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:53:05,507 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 3739 mSDsluCounter, 2784 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3739 SdHoareTripleChecker+Valid, 3474 SdHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:05,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3739 Valid, 3474 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2282 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:53:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2025-01-09 04:53:05,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 984. [2025-01-09 04:53:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 962 states have (on average 1.3326403326403327) internal successors, (1282), 983 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:05,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1282 transitions. [2025-01-09 04:53:05,516 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1282 transitions. Word has length 100 [2025-01-09 04:53:05,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:05,516 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1282 transitions. [2025-01-09 04:53:05,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1282 transitions. [2025-01-09 04:53:05,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:53:05,517 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:05,517 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] [2025-01-09 04:53:05,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 04:53:05,517 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:05,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:05,517 INFO L85 PathProgramCache]: Analyzing trace with hash 2105960988, now seen corresponding path program 1 times [2025-01-09 04:53:05,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:05,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174757322] [2025-01-09 04:53:05,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:05,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:05,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:53:05,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:53:05,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:05,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:05,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:05,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174757322] [2025-01-09 04:53:05,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174757322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:05,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:05,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:05,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876795085] [2025-01-09 04:53:05,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:05,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:05,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:05,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:05,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:05,760 INFO L87 Difference]: Start difference. First operand 984 states and 1282 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:06,597 INFO L93 Difference]: Finished difference Result 1607 states and 2106 transitions. [2025-01-09 04:53:06,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:53:06,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-01-09 04:53:06,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:06,599 INFO L225 Difference]: With dead ends: 1607 [2025-01-09 04:53:06,599 INFO L226 Difference]: Without dead ends: 1453 [2025-01-09 04:53:06,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:53:06,600 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 3942 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 1991 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3942 SdHoareTripleChecker+Valid, 2913 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:06,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3942 Valid, 2913 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1991 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:53:06,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2025-01-09 04:53:06,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 984. [2025-01-09 04:53:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 962 states have (on average 1.3305613305613306) internal successors, (1280), 983 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1280 transitions. [2025-01-09 04:53:06,611 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1280 transitions. Word has length 100 [2025-01-09 04:53:06,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:06,611 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1280 transitions. [2025-01-09 04:53:06,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1280 transitions. [2025-01-09 04:53:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:53:06,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:06,612 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] [2025-01-09 04:53:06,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 04:53:06,613 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:06,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:06,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1799923268, now seen corresponding path program 1 times [2025-01-09 04:53:06,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:06,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535263068] [2025-01-09 04:53:06,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:06,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:06,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:53:06,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:53:06,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:06,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:06,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:06,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:06,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535263068] [2025-01-09 04:53:06,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535263068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:06,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:06,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:06,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740974757] [2025-01-09 04:53:06,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:06,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:06,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:06,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:06,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:06,799 INFO L87 Difference]: Start difference. First operand 984 states and 1280 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:07,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:07,607 INFO L93 Difference]: Finished difference Result 1670 states and 2206 transitions. [2025-01-09 04:53:07,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:53:07,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-01-09 04:53:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:07,609 INFO L225 Difference]: With dead ends: 1670 [2025-01-09 04:53:07,609 INFO L226 Difference]: Without dead ends: 1501 [2025-01-09 04:53:07,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:53:07,610 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 2786 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2786 SdHoareTripleChecker+Valid, 3421 SdHoareTripleChecker+Invalid, 2274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:07,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2786 Valid, 3421 Invalid, 2274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:53:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2025-01-09 04:53:07,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 984. [2025-01-09 04:53:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 962 states have (on average 1.3284823284823284) internal successors, (1278), 983 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1278 transitions. [2025-01-09 04:53:07,632 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1278 transitions. Word has length 100 [2025-01-09 04:53:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:07,632 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1278 transitions. [2025-01-09 04:53:07,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:07,632 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1278 transitions. [2025-01-09 04:53:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:53:07,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:07,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:53:07,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 04:53:07,633 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:07,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:07,634 INFO L85 PathProgramCache]: Analyzing trace with hash -41033476, now seen corresponding path program 1 times [2025-01-09 04:53:07,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:07,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020379290] [2025-01-09 04:53:07,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:07,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:07,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:53:07,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:53:07,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:07,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:07,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:07,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020379290] [2025-01-09 04:53:07,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020379290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:07,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:07,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:07,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080495898] [2025-01-09 04:53:07,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:07,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:07,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:07,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:07,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:07,817 INFO L87 Difference]: Start difference. First operand 984 states and 1278 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:08,484 INFO L93 Difference]: Finished difference Result 1607 states and 2102 transitions. [2025-01-09 04:53:08,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:53:08,484 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-01-09 04:53:08,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:08,485 INFO L225 Difference]: With dead ends: 1607 [2025-01-09 04:53:08,485 INFO L226 Difference]: Without dead ends: 1453 [2025-01-09 04:53:08,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:53:08,486 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 3778 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 1869 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3778 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 1875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:08,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3778 Valid, 2667 Invalid, 1875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1869 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:53:08,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2025-01-09 04:53:08,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 984. [2025-01-09 04:53:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 962 states have (on average 1.3264033264033264) internal successors, (1276), 983 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1276 transitions. [2025-01-09 04:53:08,494 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1276 transitions. Word has length 100 [2025-01-09 04:53:08,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:08,495 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1276 transitions. [2025-01-09 04:53:08,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1276 transitions. [2025-01-09 04:53:08,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:53:08,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:08,496 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] [2025-01-09 04:53:08,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 04:53:08,496 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:08,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:08,496 INFO L85 PathProgramCache]: Analyzing trace with hash 361781404, now seen corresponding path program 1 times [2025-01-09 04:53:08,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:08,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203513332] [2025-01-09 04:53:08,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:08,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:08,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:53:08,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:53:08,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:08,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:08,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:08,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203513332] [2025-01-09 04:53:08,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203513332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:08,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:08,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:08,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226100684] [2025-01-09 04:53:08,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:08,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:08,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:08,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:08,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:08,670 INFO L87 Difference]: Start difference. First operand 984 states and 1276 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:09,295 INFO L93 Difference]: Finished difference Result 1607 states and 2100 transitions. [2025-01-09 04:53:09,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:53:09,295 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-01-09 04:53:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:09,297 INFO L225 Difference]: With dead ends: 1607 [2025-01-09 04:53:09,297 INFO L226 Difference]: Without dead ends: 1453 [2025-01-09 04:53:09,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:53:09,298 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 2230 mSDsluCounter, 1839 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2230 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:09,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2230 Valid, 2428 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:53:09,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2025-01-09 04:53:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 984. [2025-01-09 04:53:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 962 states have (on average 1.3243243243243243) internal successors, (1274), 983 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1274 transitions. [2025-01-09 04:53:09,305 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1274 transitions. Word has length 100 [2025-01-09 04:53:09,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:09,305 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1274 transitions. [2025-01-09 04:53:09,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:09,305 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1274 transitions. [2025-01-09 04:53:09,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:53:09,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:09,306 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] [2025-01-09 04:53:09,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 04:53:09,307 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:09,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:09,307 INFO L85 PathProgramCache]: Analyzing trace with hash 489610460, now seen corresponding path program 1 times [2025-01-09 04:53:09,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:09,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313955689] [2025-01-09 04:53:09,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:09,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:09,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:53:09,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:53:09,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:09,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:09,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:09,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313955689] [2025-01-09 04:53:09,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313955689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:09,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:09,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:09,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053323884] [2025-01-09 04:53:09,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:09,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:09,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:09,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:09,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:09,512 INFO L87 Difference]: Start difference. First operand 984 states and 1274 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:10,216 INFO L93 Difference]: Finished difference Result 1604 states and 2093 transitions. [2025-01-09 04:53:10,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:53:10,217 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-01-09 04:53:10,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:10,218 INFO L225 Difference]: With dead ends: 1604 [2025-01-09 04:53:10,218 INFO L226 Difference]: Without dead ends: 1453 [2025-01-09 04:53:10,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:53:10,219 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 3908 mSDsluCounter, 2360 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3908 SdHoareTripleChecker+Valid, 2952 SdHoareTripleChecker+Invalid, 1995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:10,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3908 Valid, 2952 Invalid, 1995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1988 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:53:10,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2025-01-09 04:53:10,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 984. [2025-01-09 04:53:10,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 962 states have (on average 1.3232848232848233) internal successors, (1273), 983 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1273 transitions. [2025-01-09 04:53:10,226 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1273 transitions. Word has length 100 [2025-01-09 04:53:10,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:10,226 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1273 transitions. [2025-01-09 04:53:10,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1273 transitions. [2025-01-09 04:53:10,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:53:10,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:10,227 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] [2025-01-09 04:53:10,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 04:53:10,228 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:10,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:10,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1868837564, now seen corresponding path program 1 times [2025-01-09 04:53:10,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:10,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542767116] [2025-01-09 04:53:10,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:10,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:10,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:53:10,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:53:10,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:10,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:10,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:10,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542767116] [2025-01-09 04:53:10,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542767116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:10,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:10,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:53:10,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290732470] [2025-01-09 04:53:10,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:10,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:53:10,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:10,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:53:10,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:53:10,529 INFO L87 Difference]: Start difference. First operand 984 states and 1273 transitions. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:11,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:11,563 INFO L93 Difference]: Finished difference Result 2115 states and 2847 transitions. [2025-01-09 04:53:11,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:53:11,563 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-01-09 04:53:11,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:11,565 INFO L225 Difference]: With dead ends: 2115 [2025-01-09 04:53:11,565 INFO L226 Difference]: Without dead ends: 1953 [2025-01-09 04:53:11,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:53:11,566 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 6167 mSDsluCounter, 2411 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6167 SdHoareTripleChecker+Valid, 3095 SdHoareTripleChecker+Invalid, 2279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:11,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6167 Valid, 3095 Invalid, 2279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:53:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2025-01-09 04:53:11,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 989. [2025-01-09 04:53:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 967 states have (on average 1.3216132368148914) internal successors, (1278), 988 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1278 transitions. [2025-01-09 04:53:11,574 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1278 transitions. Word has length 100 [2025-01-09 04:53:11,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:11,574 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1278 transitions. [2025-01-09 04:53:11,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1278 transitions. [2025-01-09 04:53:11,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:53:11,575 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:11,575 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] [2025-01-09 04:53:11,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 04:53:11,575 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:11,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:11,575 INFO L85 PathProgramCache]: Analyzing trace with hash 930233820, now seen corresponding path program 1 times [2025-01-09 04:53:11,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:11,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057223438] [2025-01-09 04:53:11,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:11,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:53:11,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:53:11,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:11,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:11,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:11,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:11,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057223438] [2025-01-09 04:53:11,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057223438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:11,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:11,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:53:11,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283120806] [2025-01-09 04:53:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:11,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:53:11,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:11,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:53:11,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:53:11,893 INFO L87 Difference]: Start difference. First operand 989 states and 1278 transitions. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:12,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:12,955 INFO L93 Difference]: Finished difference Result 1981 states and 2637 transitions. [2025-01-09 04:53:12,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:53:12,955 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-01-09 04:53:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:12,957 INFO L225 Difference]: With dead ends: 1981 [2025-01-09 04:53:12,957 INFO L226 Difference]: Without dead ends: 1830 [2025-01-09 04:53:12,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:53:12,958 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 5691 mSDsluCounter, 2185 mSDsCounter, 0 mSdLazyCounter, 2021 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5691 SdHoareTripleChecker+Valid, 2821 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 2021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:12,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5691 Valid, 2821 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 2021 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:53:12,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2025-01-09 04:53:12,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 994. [2025-01-09 04:53:12,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3199588477366255) internal successors, (1283), 993 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1283 transitions. [2025-01-09 04:53:12,968 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1283 transitions. Word has length 100 [2025-01-09 04:53:12,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:12,968 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1283 transitions. [2025-01-09 04:53:12,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:12,968 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1283 transitions. [2025-01-09 04:53:12,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:53:12,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:12,969 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] [2025-01-09 04:53:12,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-01-09 04:53:12,969 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:12,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:12,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1626725788, now seen corresponding path program 1 times [2025-01-09 04:53:12,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:12,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960836186] [2025-01-09 04:53:12,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:12,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:12,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:53:13,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:53:13,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:13,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:13,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:13,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960836186] [2025-01-09 04:53:13,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960836186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:13,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:13,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:13,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518469105] [2025-01-09 04:53:13,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:13,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:13,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:13,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:13,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:13,158 INFO L87 Difference]: Start difference. First operand 994 states and 1283 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:13,793 INFO L93 Difference]: Finished difference Result 1609 states and 2096 transitions. [2025-01-09 04:53:13,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:53:13,794 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-01-09 04:53:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:13,795 INFO L225 Difference]: With dead ends: 1609 [2025-01-09 04:53:13,795 INFO L226 Difference]: Without dead ends: 1458 [2025-01-09 04:53:13,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:53:13,796 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 2633 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2633 SdHoareTripleChecker+Valid, 2420 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:13,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2633 Valid, 2420 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1679 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:53:13,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2025-01-09 04:53:13,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 994. [2025-01-09 04:53:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3189300411522633) internal successors, (1282), 993 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1282 transitions. [2025-01-09 04:53:13,803 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1282 transitions. Word has length 100 [2025-01-09 04:53:13,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:13,803 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1282 transitions. [2025-01-09 04:53:13,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1282 transitions. [2025-01-09 04:53:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:53:13,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:13,804 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] [2025-01-09 04:53:13,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-01-09 04:53:13,804 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:13,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:13,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1268155292, now seen corresponding path program 1 times [2025-01-09 04:53:13,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:13,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638912151] [2025-01-09 04:53:13,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:13,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:13,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:53:13,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:53:13,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:13,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:14,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:14,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:14,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638912151] [2025-01-09 04:53:14,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638912151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:14,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:14,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:14,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103805381] [2025-01-09 04:53:14,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:14,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:14,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:14,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:14,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:14,010 INFO L87 Difference]: Start difference. First operand 994 states and 1282 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:14,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:14,750 INFO L93 Difference]: Finished difference Result 1609 states and 2094 transitions. [2025-01-09 04:53:14,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:53:14,750 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-01-09 04:53:14,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:14,751 INFO L225 Difference]: With dead ends: 1609 [2025-01-09 04:53:14,751 INFO L226 Difference]: Without dead ends: 1458 [2025-01-09 04:53:14,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:53:14,752 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 3805 mSDsluCounter, 2514 mSDsCounter, 0 mSdLazyCounter, 2141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3805 SdHoareTripleChecker+Valid, 3158 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:14,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3805 Valid, 3158 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2141 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:53:14,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2025-01-09 04:53:14,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 994. [2025-01-09 04:53:14,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3179012345679013) internal successors, (1281), 993 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:14,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1281 transitions. [2025-01-09 04:53:14,768 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1281 transitions. Word has length 100 [2025-01-09 04:53:14,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:14,768 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1281 transitions. [2025-01-09 04:53:14,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:14,768 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1281 transitions. [2025-01-09 04:53:14,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:53:14,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:14,769 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] [2025-01-09 04:53:14,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-01-09 04:53:14,769 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:14,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:14,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1688175644, now seen corresponding path program 1 times [2025-01-09 04:53:14,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:14,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532489881] [2025-01-09 04:53:14,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:14,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:14,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:53:14,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:53:14,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:14,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:14,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:14,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532489881] [2025-01-09 04:53:14,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532489881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:14,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:14,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:14,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511267046] [2025-01-09 04:53:14,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:14,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:14,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:14,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:14,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:14,963 INFO L87 Difference]: Start difference. First operand 994 states and 1281 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:15,589 INFO L93 Difference]: Finished difference Result 1609 states and 2093 transitions. [2025-01-09 04:53:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:53:15,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-01-09 04:53:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:15,591 INFO L225 Difference]: With dead ends: 1609 [2025-01-09 04:53:15,591 INFO L226 Difference]: Without dead ends: 1458 [2025-01-09 04:53:15,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:53:15,592 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 4342 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4342 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:15,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4342 Valid, 2411 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:53:15,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2025-01-09 04:53:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 994. [2025-01-09 04:53:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.316872427983539) internal successors, (1280), 993 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1280 transitions. [2025-01-09 04:53:15,598 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1280 transitions. Word has length 100 [2025-01-09 04:53:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:15,598 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1280 transitions. [2025-01-09 04:53:15,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1280 transitions. [2025-01-09 04:53:15,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:53:15,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:15,599 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] [2025-01-09 04:53:15,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-01-09 04:53:15,599 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:15,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:15,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1307086337, now seen corresponding path program 1 times [2025-01-09 04:53:15,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:15,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770748244] [2025-01-09 04:53:15,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:15,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:15,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:53:15,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:53:15,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:15,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:15,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:15,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770748244] [2025-01-09 04:53:15,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770748244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:15,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:15,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:15,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421092059] [2025-01-09 04:53:15,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:15,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:15,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:15,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:15,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:15,805 INFO L87 Difference]: Start difference. First operand 994 states and 1280 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:16,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:16,504 INFO L93 Difference]: Finished difference Result 1607 states and 2089 transitions. [2025-01-09 04:53:16,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:53:16,504 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-01-09 04:53:16,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:16,506 INFO L225 Difference]: With dead ends: 1607 [2025-01-09 04:53:16,506 INFO L226 Difference]: Without dead ends: 1458 [2025-01-09 04:53:16,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:53:16,506 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 3897 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3897 SdHoareTripleChecker+Valid, 2940 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:16,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3897 Valid, 2940 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1951 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:53:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2025-01-09 04:53:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 994. [2025-01-09 04:53:16,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3158436213991769) internal successors, (1279), 993 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1279 transitions. [2025-01-09 04:53:16,513 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1279 transitions. Word has length 100 [2025-01-09 04:53:16,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:16,513 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1279 transitions. [2025-01-09 04:53:16,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1279 transitions. [2025-01-09 04:53:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:53:16,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:16,514 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] [2025-01-09 04:53:16,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-01-09 04:53:16,515 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:16,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:16,515 INFO L85 PathProgramCache]: Analyzing trace with hash 623323004, now seen corresponding path program 1 times [2025-01-09 04:53:16,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:16,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365868338] [2025-01-09 04:53:16,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:16,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:16,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:53:16,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:53:16,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:16,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:16,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:16,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365868338] [2025-01-09 04:53:16,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365868338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:16,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:16,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:16,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302794450] [2025-01-09 04:53:16,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:16,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:16,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:16,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:16,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:16,709 INFO L87 Difference]: Start difference. First operand 994 states and 1279 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:17,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:17,407 INFO L93 Difference]: Finished difference Result 1609 states and 2090 transitions. [2025-01-09 04:53:17,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:53:17,407 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-01-09 04:53:17,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:17,409 INFO L225 Difference]: With dead ends: 1609 [2025-01-09 04:53:17,409 INFO L226 Difference]: Without dead ends: 1458 [2025-01-09 04:53:17,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:53:17,410 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 3891 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3891 SdHoareTripleChecker+Valid, 2940 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:17,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3891 Valid, 2940 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1947 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:53:17,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2025-01-09 04:53:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 994. [2025-01-09 04:53:17,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3148148148148149) internal successors, (1278), 993 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1278 transitions. [2025-01-09 04:53:17,419 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1278 transitions. Word has length 100 [2025-01-09 04:53:17,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:17,419 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1278 transitions. [2025-01-09 04:53:17,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:17,419 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1278 transitions. [2025-01-09 04:53:17,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:53:17,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:17,420 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] [2025-01-09 04:53:17,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-01-09 04:53:17,421 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:17,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:17,421 INFO L85 PathProgramCache]: Analyzing trace with hash 205443651, now seen corresponding path program 1 times [2025-01-09 04:53:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222756509] [2025-01-09 04:53:17,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:17,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:17,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:53:17,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:53:17,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:17,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:17,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:17,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:17,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222756509] [2025-01-09 04:53:17,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222756509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:17,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:17,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:17,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256214459] [2025-01-09 04:53:17,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:17,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:17,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:17,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:17,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:17,627 INFO L87 Difference]: Start difference. First operand 994 states and 1278 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:18,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:18,304 INFO L93 Difference]: Finished difference Result 1616 states and 2097 transitions. [2025-01-09 04:53:18,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:53:18,304 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-01-09 04:53:18,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:18,305 INFO L225 Difference]: With dead ends: 1616 [2025-01-09 04:53:18,305 INFO L226 Difference]: Without dead ends: 1458 [2025-01-09 04:53:18,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:53:18,306 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 3885 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3885 SdHoareTripleChecker+Valid, 2944 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:18,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3885 Valid, 2944 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1939 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:53:18,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2025-01-09 04:53:18,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 994. [2025-01-09 04:53:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3127572016460904) internal successors, (1276), 993 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1276 transitions. [2025-01-09 04:53:18,313 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1276 transitions. Word has length 101 [2025-01-09 04:53:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:18,313 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1276 transitions. [2025-01-09 04:53:18,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1276 transitions. [2025-01-09 04:53:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:53:18,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:18,314 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] [2025-01-09 04:53:18,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-01-09 04:53:18,315 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:18,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:18,315 INFO L85 PathProgramCache]: Analyzing trace with hash 558214531, now seen corresponding path program 1 times [2025-01-09 04:53:18,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:18,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812271993] [2025-01-09 04:53:18,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:18,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:18,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:53:18,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:53:18,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:18,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:18,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:18,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812271993] [2025-01-09 04:53:18,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812271993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:18,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:18,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:18,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948962082] [2025-01-09 04:53:18,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:18,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:18,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:18,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:18,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:18,506 INFO L87 Difference]: Start difference. First operand 994 states and 1276 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:19,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:19,269 INFO L93 Difference]: Finished difference Result 1681 states and 2200 transitions. [2025-01-09 04:53:19,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:53:19,269 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-01-09 04:53:19,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:19,271 INFO L225 Difference]: With dead ends: 1681 [2025-01-09 04:53:19,271 INFO L226 Difference]: Without dead ends: 1506 [2025-01-09 04:53:19,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:53:19,271 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 3704 mSDsluCounter, 2754 mSDsCounter, 0 mSdLazyCounter, 2179 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3704 SdHoareTripleChecker+Valid, 3434 SdHoareTripleChecker+Invalid, 2186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:19,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3704 Valid, 3434 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2179 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:53:19,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-09 04:53:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 994. [2025-01-09 04:53:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3106995884773662) internal successors, (1274), 993 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1274 transitions. [2025-01-09 04:53:19,278 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1274 transitions. Word has length 101 [2025-01-09 04:53:19,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:19,278 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1274 transitions. [2025-01-09 04:53:19,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:19,278 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1274 transitions. [2025-01-09 04:53:19,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:53:19,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:19,279 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] [2025-01-09 04:53:19,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-01-09 04:53:19,279 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:19,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:19,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1900513027, now seen corresponding path program 1 times [2025-01-09 04:53:19,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:19,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964425258] [2025-01-09 04:53:19,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:19,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:19,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:53:19,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:53:19,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:19,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:19,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:19,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964425258] [2025-01-09 04:53:19,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964425258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:19,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:19,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:53:19,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492945918] [2025-01-09 04:53:19,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:19,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:53:19,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:19,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:53:19,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:53:19,587 INFO L87 Difference]: Start difference. First operand 994 states and 1274 transitions. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:20,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:20,661 INFO L93 Difference]: Finished difference Result 2296 states and 3082 transitions. [2025-01-09 04:53:20,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:53:20,661 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-01-09 04:53:20,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:20,663 INFO L225 Difference]: With dead ends: 2296 [2025-01-09 04:53:20,663 INFO L226 Difference]: Without dead ends: 2077 [2025-01-09 04:53:20,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:53:20,664 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 7193 mSDsluCounter, 2640 mSDsCounter, 0 mSdLazyCounter, 2160 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7193 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 2160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:20,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7193 Valid, 3382 Invalid, 2354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 2160 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:53:20,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2025-01-09 04:53:20,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 1004. [2025-01-09 04:53:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 982 states have (on average 1.3075356415478616) internal successors, (1284), 1003 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1284 transitions. [2025-01-09 04:53:20,678 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1284 transitions. Word has length 101 [2025-01-09 04:53:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:20,678 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1284 transitions. [2025-01-09 04:53:20,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1284 transitions. [2025-01-09 04:53:20,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:53:20,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:20,679 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] [2025-01-09 04:53:20,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-01-09 04:53:20,679 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:20,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:20,680 INFO L85 PathProgramCache]: Analyzing trace with hash -93828413, now seen corresponding path program 1 times [2025-01-09 04:53:20,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:20,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861224396] [2025-01-09 04:53:20,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:20,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:20,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:53:20,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:53:20,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:20,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:20,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-01-09 04:53:20,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:20,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861224396] [2025-01-09 04:53:20,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861224396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:20,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:20,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:53:20,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713361755] [2025-01-09 04:53:20,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:20,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:53:20,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:21,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:53:21,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:53:21,000 INFO L87 Difference]: Start difference. First operand 1004 states and 1284 transitions. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:22,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:22,088 INFO L93 Difference]: Finished difference Result 2143 states and 2868 transitions. [2025-01-09 04:53:22,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:53:22,088 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-01-09 04:53:22,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:22,090 INFO L225 Difference]: With dead ends: 2143 [2025-01-09 04:53:22,090 INFO L226 Difference]: Without dead ends: 1968 [2025-01-09 04:53:22,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:53:22,091 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 5422 mSDsluCounter, 2571 mSDsCounter, 0 mSdLazyCounter, 2257 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5422 SdHoareTripleChecker+Valid, 3294 SdHoareTripleChecker+Invalid, 2456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 2257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:22,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5422 Valid, 3294 Invalid, 2456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 2257 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:53:22,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2025-01-09 04:53:22,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1014. [2025-01-09 04:53:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 992 states have (on average 1.3044354838709677) internal successors, (1294), 1013 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1294 transitions. [2025-01-09 04:53:22,100 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1294 transitions. Word has length 101 [2025-01-09 04:53:22,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:22,100 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1294 transitions. [2025-01-09 04:53:22,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:22,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1294 transitions. [2025-01-09 04:53:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:53:22,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:22,101 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] [2025-01-09 04:53:22,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-01-09 04:53:22,101 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:22,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:22,102 INFO L85 PathProgramCache]: Analyzing trace with hash -446599293, now seen corresponding path program 1 times [2025-01-09 04:53:22,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:22,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852853729] [2025-01-09 04:53:22,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:22,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:22,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:53:22,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:53:22,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:22,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:22,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:22,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:22,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852853729] [2025-01-09 04:53:22,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852853729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:22,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:22,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:22,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083692717] [2025-01-09 04:53:22,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:22,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:22,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:22,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:22,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:22,309 INFO L87 Difference]: Start difference. First operand 1014 states and 1294 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:23,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:23,022 INFO L93 Difference]: Finished difference Result 1636 states and 2113 transitions. [2025-01-09 04:53:23,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:53:23,022 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-01-09 04:53:23,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:23,024 INFO L225 Difference]: With dead ends: 1636 [2025-01-09 04:53:23,024 INFO L226 Difference]: Without dead ends: 1478 [2025-01-09 04:53:23,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:53:23,024 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 3853 mSDsluCounter, 2398 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3853 SdHoareTripleChecker+Valid, 3003 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:23,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3853 Valid, 3003 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:53:23,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2025-01-09 04:53:23,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1014. [2025-01-09 04:53:23,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 992 states have (on average 1.3024193548387097) internal successors, (1292), 1013 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1292 transitions. [2025-01-09 04:53:23,031 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1292 transitions. Word has length 101 [2025-01-09 04:53:23,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:23,031 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1292 transitions. [2025-01-09 04:53:23,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:23,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1292 transitions. [2025-01-09 04:53:23,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:53:23,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:23,032 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] [2025-01-09 04:53:23,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-01-09 04:53:23,032 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:23,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:23,033 INFO L85 PathProgramCache]: Analyzing trace with hash 102612419, now seen corresponding path program 1 times [2025-01-09 04:53:23,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:23,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296885338] [2025-01-09 04:53:23,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:23,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:23,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:53:23,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:53:23,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:23,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:23,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:23,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296885338] [2025-01-09 04:53:23,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296885338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:23,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:23,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:23,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840412498] [2025-01-09 04:53:23,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:23,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:23,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:23,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:23,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:23,203 INFO L87 Difference]: Start difference. First operand 1014 states and 1292 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:23,906 INFO L93 Difference]: Finished difference Result 1535 states and 1969 transitions. [2025-01-09 04:53:23,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:53:23,906 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-01-09 04:53:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:23,908 INFO L225 Difference]: With dead ends: 1535 [2025-01-09 04:53:23,908 INFO L226 Difference]: Without dead ends: 1516 [2025-01-09 04:53:23,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:53:23,908 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 2035 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2035 SdHoareTripleChecker+Valid, 2802 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:23,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2035 Valid, 2802 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:53:23,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2025-01-09 04:53:23,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1014. [2025-01-09 04:53:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 992 states have (on average 1.3004032258064515) internal successors, (1290), 1013 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1290 transitions. [2025-01-09 04:53:23,916 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1290 transitions. Word has length 101 [2025-01-09 04:53:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:23,916 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1290 transitions. [2025-01-09 04:53:23,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1290 transitions. [2025-01-09 04:53:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:53:23,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:23,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:53:23,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-01-09 04:53:23,917 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:23,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:23,918 INFO L85 PathProgramCache]: Analyzing trace with hash -250158461, now seen corresponding path program 1 times [2025-01-09 04:53:23,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:23,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865646620] [2025-01-09 04:53:23,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:23,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:23,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:53:23,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:53:23,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:23,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:24,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:24,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865646620] [2025-01-09 04:53:24,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865646620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:24,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:24,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:24,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169499243] [2025-01-09 04:53:24,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:24,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:24,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:24,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:24,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:24,124 INFO L87 Difference]: Start difference. First operand 1014 states and 1290 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:24,837 INFO L93 Difference]: Finished difference Result 1484 states and 1883 transitions. [2025-01-09 04:53:24,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:53:24,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-01-09 04:53:24,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:24,839 INFO L225 Difference]: With dead ends: 1484 [2025-01-09 04:53:24,839 INFO L226 Difference]: Without dead ends: 1478 [2025-01-09 04:53:24,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:53:24,839 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 3822 mSDsluCounter, 2439 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3822 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:24,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3822 Valid, 3058 Invalid, 1978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:53:24,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2025-01-09 04:53:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1014. [2025-01-09 04:53:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 992 states have (on average 1.2983870967741935) internal successors, (1288), 1013 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:24,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1288 transitions. [2025-01-09 04:53:24,846 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1288 transitions. Word has length 101 [2025-01-09 04:53:24,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:24,846 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1288 transitions. [2025-01-09 04:53:24,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:24,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1288 transitions. [2025-01-09 04:53:24,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:53:24,847 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:24,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] [2025-01-09 04:53:24,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-01-09 04:53:24,847 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:24,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:24,848 INFO L85 PathProgramCache]: Analyzing trace with hash -56955485, now seen corresponding path program 1 times [2025-01-09 04:53:24,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:24,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460003188] [2025-01-09 04:53:24,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:24,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:24,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:53:24,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:53:24,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:24,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:25,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:25,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460003188] [2025-01-09 04:53:25,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460003188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:25,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:25,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:25,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945766830] [2025-01-09 04:53:25,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:25,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:25,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:25,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:25,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:25,009 INFO L87 Difference]: Start difference. First operand 1014 states and 1288 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:25,631 INFO L93 Difference]: Finished difference Result 1484 states and 1881 transitions. [2025-01-09 04:53:25,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:53:25,632 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-01-09 04:53:25,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:25,633 INFO L225 Difference]: With dead ends: 1484 [2025-01-09 04:53:25,633 INFO L226 Difference]: Without dead ends: 1478 [2025-01-09 04:53:25,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:53:25,634 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 4179 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4179 SdHoareTripleChecker+Valid, 2534 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:25,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4179 Valid, 2534 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:53:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2025-01-09 04:53:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1014. [2025-01-09 04:53:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 992 states have (on average 1.2963709677419355) internal successors, (1286), 1013 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1286 transitions. [2025-01-09 04:53:25,641 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1286 transitions. Word has length 101 [2025-01-09 04:53:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:25,641 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1286 transitions. [2025-01-09 04:53:25,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1286 transitions. [2025-01-09 04:53:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:53:25,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:25,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:53:25,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-01-09 04:53:25,642 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:25,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:25,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1631964749, now seen corresponding path program 1 times [2025-01-09 04:53:25,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:25,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248930014] [2025-01-09 04:53:25,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:25,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:25,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:53:25,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:53:25,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:25,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:25,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:25,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248930014] [2025-01-09 04:53:25,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248930014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:25,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:25,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:25,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268800934] [2025-01-09 04:53:25,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:25,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:25,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:25,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:25,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:25,822 INFO L87 Difference]: Start difference. First operand 1014 states and 1286 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:26,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:26,491 INFO L93 Difference]: Finished difference Result 1629 states and 2095 transitions. [2025-01-09 04:53:26,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:53:26,491 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-01-09 04:53:26,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:26,492 INFO L225 Difference]: With dead ends: 1629 [2025-01-09 04:53:26,492 INFO L226 Difference]: Without dead ends: 1478 [2025-01-09 04:53:26,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:53:26,493 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 3200 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3200 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:26,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3200 Valid, 2542 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:53:26,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2025-01-09 04:53:26,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1009. [2025-01-09 04:53:26,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 987 states have (on average 1.2968591691995948) internal successors, (1280), 1008 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:26,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1280 transitions. [2025-01-09 04:53:26,500 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1280 transitions. Word has length 101 [2025-01-09 04:53:26,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:26,500 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1280 transitions. [2025-01-09 04:53:26,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:26,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1280 transitions. [2025-01-09 04:53:26,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:53:26,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:26,501 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] [2025-01-09 04:53:26,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-01-09 04:53:26,501 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:26,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:26,502 INFO L85 PathProgramCache]: Analyzing trace with hash 547033555, now seen corresponding path program 1 times [2025-01-09 04:53:26,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:26,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704015044] [2025-01-09 04:53:26,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:26,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:26,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:53:26,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:53:26,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:26,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:26,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:26,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:26,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704015044] [2025-01-09 04:53:26,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704015044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:26,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:26,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:26,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866297330] [2025-01-09 04:53:26,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:26,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:26,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:26,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:26,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:26,676 INFO L87 Difference]: Start difference. First operand 1009 states and 1280 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:27,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:27,386 INFO L93 Difference]: Finished difference Result 1673 states and 2166 transitions. [2025-01-09 04:53:27,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:53:27,387 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-01-09 04:53:27,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:27,388 INFO L225 Difference]: With dead ends: 1673 [2025-01-09 04:53:27,388 INFO L226 Difference]: Without dead ends: 1511 [2025-01-09 04:53:27,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:53:27,389 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 3289 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3289 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:27,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3289 Valid, 3028 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:53:27,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2025-01-09 04:53:27,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1004. [2025-01-09 04:53:27,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 982 states have (on average 1.2973523421588595) internal successors, (1274), 1003 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1274 transitions. [2025-01-09 04:53:27,397 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1274 transitions. Word has length 101 [2025-01-09 04:53:27,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:27,397 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1274 transitions. [2025-01-09 04:53:27,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:27,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1274 transitions. [2025-01-09 04:53:27,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:53:27,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:27,398 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] [2025-01-09 04:53:27,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-01-09 04:53:27,398 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:27,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:27,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1060602141, now seen corresponding path program 1 times [2025-01-09 04:53:27,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:27,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116703636] [2025-01-09 04:53:27,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:27,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:27,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:53:27,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:53:27,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:27,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:27,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:27,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116703636] [2025-01-09 04:53:27,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116703636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:27,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:27,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:53:27,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505849254] [2025-01-09 04:53:27,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:27,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:53:27,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:27,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:53:27,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:53:27,706 INFO L87 Difference]: Start difference. First operand 1004 states and 1274 transitions. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:28,720 INFO L93 Difference]: Finished difference Result 1999 states and 2631 transitions. [2025-01-09 04:53:28,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:53:28,720 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-01-09 04:53:28,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:28,722 INFO L225 Difference]: With dead ends: 1999 [2025-01-09 04:53:28,722 INFO L226 Difference]: Without dead ends: 1845 [2025-01-09 04:53:28,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:53:28,723 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 5460 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5460 SdHoareTripleChecker+Valid, 2932 SdHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:28,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5460 Valid, 2932 Invalid, 2212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 2007 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:53:28,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2025-01-09 04:53:28,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1009. [2025-01-09 04:53:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 987 states have (on average 1.2958459979736576) internal successors, (1279), 1008 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1279 transitions. [2025-01-09 04:53:28,731 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1279 transitions. Word has length 101 [2025-01-09 04:53:28,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:28,731 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1279 transitions. [2025-01-09 04:53:28,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1279 transitions. [2025-01-09 04:53:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:53:28,732 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:28,732 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] [2025-01-09 04:53:28,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-01-09 04:53:28,733 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:28,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:28,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1048495107, now seen corresponding path program 1 times [2025-01-09 04:53:28,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:28,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060364388] [2025-01-09 04:53:28,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:28,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:28,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:53:28,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:53:28,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:28,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:28,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:28,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060364388] [2025-01-09 04:53:28,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060364388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:28,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:28,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:53:28,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020270241] [2025-01-09 04:53:28,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:28,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:53:28,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:28,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:53:28,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:53:28,916 INFO L87 Difference]: Start difference. First operand 1009 states and 1279 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:29,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:53:29,522 INFO L93 Difference]: Finished difference Result 1627 states and 2090 transitions. [2025-01-09 04:53:29,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:53:29,522 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-01-09 04:53:29,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:53:29,524 INFO L225 Difference]: With dead ends: 1627 [2025-01-09 04:53:29,524 INFO L226 Difference]: Without dead ends: 1473 [2025-01-09 04:53:29,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:53:29,524 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 3152 mSDsluCounter, 1938 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3152 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:53:29,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3152 Valid, 2561 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:53:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2025-01-09 04:53:29,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1009. [2025-01-09 04:53:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 987 states have (on average 1.2948328267477203) internal successors, (1278), 1008 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1278 transitions. [2025-01-09 04:53:29,532 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1278 transitions. Word has length 101 [2025-01-09 04:53:29,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:53:29,532 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1278 transitions. [2025-01-09 04:53:29,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:53:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1278 transitions. [2025-01-09 04:53:29,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:53:29,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:53:29,533 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] [2025-01-09 04:53:29,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-01-09 04:53:29,533 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-01-09 04:53:29,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:53:29,533 INFO L85 PathProgramCache]: Analyzing trace with hash -385148189, now seen corresponding path program 1 times [2025-01-09 04:53:29,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:53:29,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347418691] [2025-01-09 04:53:29,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:53:29,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:53:29,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:53:29,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:53:29,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:53:29,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:53:29,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:53:29,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:53:29,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347418691] [2025-01-09 04:53:29,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347418691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:53:29,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:53:29,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:53:29,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730499429] [2025-01-09 04:53:29,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:53:29,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:53:29,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:53:29,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:53:29,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:53:29,829 INFO L87 Difference]: Start difference. First operand 1009 states and 1278 transitions. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)