./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.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.5.ufo.BOUNDED-10.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 930b16bc37a672cceaa805d09eab083d07141f7f88feaee710c310c880a88e07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:51:28,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:51:28,251 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:51:28,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:51:28,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:51:28,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:51:28,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:51:28,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:51:28,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:51:28,287 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:51:28,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:51:28,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:51:28,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:51:28,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:51:28,288 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:51:28,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:51:28,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:51:28,288 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:51:28,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:51:28,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:51:28,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:51:28,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:51:28,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:51:28,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:51:28,288 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:51:28,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:51:28,289 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:51:28,289 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:51:28,289 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:51:28,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:51:28,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:51:28,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:51:28,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:51:28,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:51:28,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:51:28,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:51:28,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:51:28,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:51:28,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:51:28,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:51:28,289 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:51:28,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:51:28,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:51:28,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:51:28,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:51:28,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:51:28,293 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:51:28,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:51:28,293 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 -> 930b16bc37a672cceaa805d09eab083d07141f7f88feaee710c310c880a88e07 [2025-01-09 04:51:28,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:51:28,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:51:28,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:51:28,553 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:51:28,554 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:51:28,555 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2025-01-09 04:51:29,699 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1319f6bcb/21003260a4ce4723b018294b8a98de12/FLAG6ff302978 [2025-01-09 04:51:30,197 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:51:30,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2025-01-09 04:51:30,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1319f6bcb/21003260a4ce4723b018294b8a98de12/FLAG6ff302978 [2025-01-09 04:51:30,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1319f6bcb/21003260a4ce4723b018294b8a98de12 [2025-01-09 04:51:30,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:51:30,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:51:30,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:51:30,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:51:30,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:51:30,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:51:30" (1/1) ... [2025-01-09 04:51:30,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a92815f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:30, skipping insertion in model container [2025-01-09 04:51:30,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:51:30" (1/1) ... [2025-01-09 04:51:30,365 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:51:30,749 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[37686,37699] [2025-01-09 04:51:30,813 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[53661,53674] [2025-01-09 04:51:30,839 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[61658,61671] [2025-01-09 04:51:30,852 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[65640,65653] [2025-01-09 04:51:30,864 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[69487,69500] [2025-01-09 04:51:30,908 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[86510,86523] [2025-01-09 04:51:30,923 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[94544,94557] [2025-01-09 04:51:30,932 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[98563,98576] [2025-01-09 04:51:30,945 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[102447,102460] [2025-01-09 04:51:30,956 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[106961,106974] [2025-01-09 04:51:30,965 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[110869,110882] [2025-01-09 04:51:30,980 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[114888,114901] [2025-01-09 04:51:30,990 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[118772,118785] [2025-01-09 04:51:31,004 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[122907,122920] [2025-01-09 04:51:31,017 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[126958,126971] [2025-01-09 04:51:31,030 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[130958,130971] [2025-01-09 04:51:31,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:51:31,085 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:51:31,189 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[37686,37699] [2025-01-09 04:51:31,211 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[53661,53674] [2025-01-09 04:51:31,221 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[61658,61671] [2025-01-09 04:51:31,227 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[65640,65653] [2025-01-09 04:51:31,232 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[69487,69500] [2025-01-09 04:51:31,258 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[86510,86523] [2025-01-09 04:51:31,268 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[94544,94557] [2025-01-09 04:51:31,275 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[98563,98576] [2025-01-09 04:51:31,280 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[102447,102460] [2025-01-09 04:51:31,285 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[106961,106974] [2025-01-09 04:51:31,290 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[110869,110882] [2025-01-09 04:51:31,335 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[114888,114901] [2025-01-09 04:51:31,341 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[118772,118785] [2025-01-09 04:51:31,347 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[122907,122920] [2025-01-09 04:51:31,353 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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[126958,126971] [2025-01-09 04:51:31,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.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c[130958,130971] [2025-01-09 04:51:31,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:51:31,394 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:51:31,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:31 WrapperNode [2025-01-09 04:51:31,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:51:31,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:51:31,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:51:31,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:51:31,401 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:51:31" (1/1) ... [2025-01-09 04:51:31,434 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:51:31" (1/1) ... [2025-01-09 04:51:31,542 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6234 [2025-01-09 04:51:31,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:51:31,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:51:31,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:51:31,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:51:31,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:31" (1/1) ... [2025-01-09 04:51:31,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:31" (1/1) ... [2025-01-09 04:51:31,585 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:31" (1/1) ... [2025-01-09 04:51:31,643 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:51:31,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:31" (1/1) ... [2025-01-09 04:51:31,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:31" (1/1) ... [2025-01-09 04:51:31,688 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:31" (1/1) ... [2025-01-09 04:51:31,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:31" (1/1) ... [2025-01-09 04:51:31,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:31" (1/1) ... [2025-01-09 04:51:31,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:31" (1/1) ... [2025-01-09 04:51:31,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:31" (1/1) ... [2025-01-09 04:51:31,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:51:31,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:51:31,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:51:31,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:51:31,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:31" (1/1) ... [2025-01-09 04:51:31,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:51:31,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:51:31,791 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:51:31,794 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:51:31,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:51:31,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:51:31,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:51:31,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:51:31,999 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:51:32,001 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:51:34,494 INFO L? ?]: Removed 1254 outVars from TransFormulas that were not future-live. [2025-01-09 04:51:34,494 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:51:34,520 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:51:34,521 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:51:34,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:51:34 BoogieIcfgContainer [2025-01-09 04:51:34,521 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:51:34,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:51:34,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:51:34,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:51:34,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:51:30" (1/3) ... [2025-01-09 04:51:34,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262c68ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:51:34, skipping insertion in model container [2025-01-09 04:51:34,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:31" (2/3) ... [2025-01-09 04:51:34,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262c68ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:51:34, skipping insertion in model container [2025-01-09 04:51:34,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:51:34" (3/3) ... [2025-01-09 04:51:34,528 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2025-01-09 04:51:34,555 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:51:34,557 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c that has 1 procedures, 1193 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-01-09 04:51:34,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:51:34,653 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;@2b318235, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:51:34,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-09 04:51:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 1193 states, 1176 states have (on average 1.7704081632653061) internal successors, (2082), 1192 states have internal predecessors, (2082), 0 states have call successors, (0), 0 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:51:34,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:51:34,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:34,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:34,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:34,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:34,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1494001524, now seen corresponding path program 1 times [2025-01-09 04:51:34,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:34,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221548952] [2025-01-09 04:51:34,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:34,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:34,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:51:34,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:51:34,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:34,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:35,275 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:51:35,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:35,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221548952] [2025-01-09 04:51:35,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221548952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:35,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:35,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:51:35,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841326294] [2025-01-09 04:51:35,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:35,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:51:35,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:35,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:51:35,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:51:35,299 INFO L87 Difference]: Start difference. First operand has 1193 states, 1176 states have (on average 1.7704081632653061) internal successors, (2082), 1192 states have internal predecessors, (2082), 0 states have call successors, (0), 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 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:35,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:35,985 INFO L93 Difference]: Finished difference Result 1556 states and 2660 transitions. [2025-01-09 04:51:35,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:51:35,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-09 04:51:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:35,996 INFO L225 Difference]: With dead ends: 1556 [2025-01-09 04:51:35,996 INFO L226 Difference]: Without dead ends: 945 [2025-01-09 04:51:36,000 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:51:36,002 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 4735 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4735 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:36,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4735 Valid, 931 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:51:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-01-09 04:51:36,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2025-01-09 04:51:36,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 929 states have (on average 1.2927879440258343) internal successors, (1201), 944 states have internal predecessors, (1201), 0 states have call successors, (0), 0 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:51:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1201 transitions. [2025-01-09 04:51:36,053 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1201 transitions. Word has length 73 [2025-01-09 04:51:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:36,053 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1201 transitions. [2025-01-09 04:51:36,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1201 transitions. [2025-01-09 04:51:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:51:36,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:36,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:36,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:51:36,060 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:36,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:36,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2060458333, now seen corresponding path program 1 times [2025-01-09 04:51:36,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:36,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973648110] [2025-01-09 04:51:36,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:36,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:36,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:51:36,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:51:36,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:36,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:36,302 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:51:36,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:36,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973648110] [2025-01-09 04:51:36,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973648110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:36,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:36,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:51:36,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353520791] [2025-01-09 04:51:36,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:36,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:51:36,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:36,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:51:36,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:51:36,305 INFO L87 Difference]: Start difference. First operand 945 states and 1201 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:37,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:37,237 INFO L93 Difference]: Finished difference Result 1347 states and 1726 transitions. [2025-01-09 04:51:37,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:51:37,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-09 04:51:37,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:37,241 INFO L225 Difference]: With dead ends: 1347 [2025-01-09 04:51:37,243 INFO L226 Difference]: Without dead ends: 881 [2025-01-09 04:51:37,244 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:51:37,246 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 3281 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3281 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:37,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3281 Valid, 563 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:51:37,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-01-09 04:51:37,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2025-01-09 04:51:37,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 865 states have (on average 1.3040462427745665) internal successors, (1128), 880 states have internal predecessors, (1128), 0 states have call successors, (0), 0 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:51:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1128 transitions. [2025-01-09 04:51:37,274 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1128 transitions. Word has length 73 [2025-01-09 04:51:37,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:37,274 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1128 transitions. [2025-01-09 04:51:37,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:37,275 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1128 transitions. [2025-01-09 04:51:37,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:51:37,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:37,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:37,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:51:37,280 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:37,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:37,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1618618520, now seen corresponding path program 1 times [2025-01-09 04:51:37,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:37,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092178681] [2025-01-09 04:51:37,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:37,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:37,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:51:37,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:51:37,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:37,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:37,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:37,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092178681] [2025-01-09 04:51:37,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092178681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:37,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:37,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:51:37,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193163217] [2025-01-09 04:51:37,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:37,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:51:37,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:37,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:51:37,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:51:37,533 INFO L87 Difference]: Start difference. First operand 881 states and 1128 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:37,868 INFO L93 Difference]: Finished difference Result 1019 states and 1292 transitions. [2025-01-09 04:51:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:51:37,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-09 04:51:37,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:37,870 INFO L225 Difference]: With dead ends: 1019 [2025-01-09 04:51:37,870 INFO L226 Difference]: Without dead ends: 585 [2025-01-09 04:51:37,871 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:51:37,871 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 2145 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:37,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 417 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:51:37,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-01-09 04:51:37,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2025-01-09 04:51:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 569 states have (on average 1.3057996485061512) internal successors, (743), 584 states have internal predecessors, (743), 0 states have call successors, (0), 0 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:51:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 743 transitions. [2025-01-09 04:51:37,880 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 743 transitions. Word has length 73 [2025-01-09 04:51:37,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:37,880 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 743 transitions. [2025-01-09 04:51:37,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:37,880 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 743 transitions. [2025-01-09 04:51:37,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 04:51:37,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:37,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:37,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:51:37,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:37,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:37,882 INFO L85 PathProgramCache]: Analyzing trace with hash -700009990, now seen corresponding path program 1 times [2025-01-09 04:51:37,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:37,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938814929] [2025-01-09 04:51:37,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:37,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:37,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 04:51:37,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 04:51:37,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:37,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:38,016 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:51:38,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:38,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938814929] [2025-01-09 04:51:38,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938814929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:38,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:38,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:51:38,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930602679] [2025-01-09 04:51:38,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:38,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:51:38,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:38,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:51:38,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:51:38,018 INFO L87 Difference]: Start difference. First operand 585 states and 743 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:38,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:38,283 INFO L93 Difference]: Finished difference Result 807 states and 1026 transitions. [2025-01-09 04:51:38,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:51:38,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-01-09 04:51:38,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:38,285 INFO L225 Difference]: With dead ends: 807 [2025-01-09 04:51:38,285 INFO L226 Difference]: Without dead ends: 500 [2025-01-09 04:51:38,286 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:51:38,286 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 1851 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1851 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:38,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1851 Valid, 368 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:51:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-01-09 04:51:38,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2025-01-09 04:51:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 484 states have (on average 1.3161157024793388) internal successors, (637), 499 states have internal predecessors, (637), 0 states have call successors, (0), 0 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:51:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 637 transitions. [2025-01-09 04:51:38,294 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 637 transitions. Word has length 75 [2025-01-09 04:51:38,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:38,294 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 637 transitions. [2025-01-09 04:51:38,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:38,294 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 637 transitions. [2025-01-09 04:51:38,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:51:38,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:38,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:38,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:51:38,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:38,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:38,296 INFO L85 PathProgramCache]: Analyzing trace with hash 137435073, now seen corresponding path program 1 times [2025-01-09 04:51:38,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:38,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26336464] [2025-01-09 04:51:38,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:38,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:38,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:51:38,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:51:38,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:38,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:38,449 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:51:38,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:38,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26336464] [2025-01-09 04:51:38,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26336464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:38,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:38,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:51:38,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646138982] [2025-01-09 04:51:38,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:38,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:51:38,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:38,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:51:38,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:51:38,451 INFO L87 Difference]: Start difference. First operand 500 states and 637 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:38,642 INFO L93 Difference]: Finished difference Result 686 states and 871 transitions. [2025-01-09 04:51:38,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:51:38,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 04:51:38,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:38,644 INFO L225 Difference]: With dead ends: 686 [2025-01-09 04:51:38,644 INFO L226 Difference]: Without dead ends: 423 [2025-01-09 04:51:38,644 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:51:38,645 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 1540 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:38,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 334 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:51:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-01-09 04:51:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2025-01-09 04:51:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 407 states have (on average 1.3194103194103195) internal successors, (537), 422 states have internal predecessors, (537), 0 states have call successors, (0), 0 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:51:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 537 transitions. [2025-01-09 04:51:38,651 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 537 transitions. Word has length 77 [2025-01-09 04:51:38,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:38,651 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 537 transitions. [2025-01-09 04:51:38,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 537 transitions. [2025-01-09 04:51:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:51:38,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:38,652 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] [2025-01-09 04:51:38,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:51:38,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:38,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:38,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1748744325, now seen corresponding path program 1 times [2025-01-09 04:51:38,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:38,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522080251] [2025-01-09 04:51:38,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:38,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:38,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:51:38,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:51:38,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:38,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:39,262 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:51:39,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:39,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522080251] [2025-01-09 04:51:39,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522080251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:39,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:39,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:51:39,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205242293] [2025-01-09 04:51:39,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:39,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:51:39,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:39,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:51:39,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:51:39,264 INFO L87 Difference]: Start difference. First operand 423 states and 537 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:51:39,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:39,807 INFO L93 Difference]: Finished difference Result 821 states and 1026 transitions. [2025-01-09 04:51:39,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:51:39,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-01-09 04:51:39,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:39,810 INFO L225 Difference]: With dead ends: 821 [2025-01-09 04:51:39,810 INFO L226 Difference]: Without dead ends: 592 [2025-01-09 04:51:39,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:51:39,811 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 2212 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2212 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:39,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2212 Valid, 1282 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:51:39,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-01-09 04:51:39,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 423. [2025-01-09 04:51:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 407 states have (on average 1.316953316953317) internal successors, (536), 422 states have internal predecessors, (536), 0 states have call successors, (0), 0 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:51:39,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 536 transitions. [2025-01-09 04:51:39,818 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 536 transitions. Word has length 79 [2025-01-09 04:51:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:39,818 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 536 transitions. [2025-01-09 04:51:39,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:51:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 536 transitions. [2025-01-09 04:51:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:51:39,819 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:39,819 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] [2025-01-09 04:51:39,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:51:39,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:39,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:39,820 INFO L85 PathProgramCache]: Analyzing trace with hash -883245509, now seen corresponding path program 1 times [2025-01-09 04:51:39,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:39,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676530434] [2025-01-09 04:51:39,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:39,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:39,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:51:39,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:51:39,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:39,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:40,131 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:51:40,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:40,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676530434] [2025-01-09 04:51:40,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676530434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:40,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:40,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:40,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174964561] [2025-01-09 04:51:40,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:40,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:40,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:40,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:40,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:40,133 INFO L87 Difference]: Start difference. First operand 423 states and 536 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:51:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:40,688 INFO L93 Difference]: Finished difference Result 745 states and 964 transitions. [2025-01-09 04:51:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:51:40,689 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-01-09 04:51:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:40,691 INFO L225 Difference]: With dead ends: 745 [2025-01-09 04:51:40,691 INFO L226 Difference]: Without dead ends: 651 [2025-01-09 04:51:40,691 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:51:40,692 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 3049 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3049 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:40,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3049 Valid, 1389 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:51:40,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-01-09 04:51:40,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 423. [2025-01-09 04:51:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 407 states have (on average 1.3144963144963144) internal successors, (535), 422 states have internal predecessors, (535), 0 states have call successors, (0), 0 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:51:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 535 transitions. [2025-01-09 04:51:40,699 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 535 transitions. Word has length 79 [2025-01-09 04:51:40,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:40,699 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 535 transitions. [2025-01-09 04:51:40,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:51:40,699 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 535 transitions. [2025-01-09 04:51:40,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:51:40,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:40,700 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] [2025-01-09 04:51:40,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:51:40,701 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:40,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:40,701 INFO L85 PathProgramCache]: Analyzing trace with hash -876086789, now seen corresponding path program 1 times [2025-01-09 04:51:40,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:40,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170369804] [2025-01-09 04:51:40,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:40,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:40,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:51:40,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:51:40,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:40,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:41,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:41,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170369804] [2025-01-09 04:51:41,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170369804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:41,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:41,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:41,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984204005] [2025-01-09 04:51:41,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:41,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:41,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:41,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:41,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:41,021 INFO L87 Difference]: Start difference. First operand 423 states and 535 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:51:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:41,724 INFO L93 Difference]: Finished difference Result 792 states and 1022 transitions. [2025-01-09 04:51:41,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:51:41,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-01-09 04:51:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:41,726 INFO L225 Difference]: With dead ends: 792 [2025-01-09 04:51:41,726 INFO L226 Difference]: Without dead ends: 655 [2025-01-09 04:51:41,727 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:51:41,727 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 2252 mSDsluCounter, 1819 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2252 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:41,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2252 Valid, 2265 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:51:41,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-01-09 04:51:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 423. [2025-01-09 04:51:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 407 states have (on average 1.3120393120393121) internal successors, (534), 422 states have internal predecessors, (534), 0 states have call successors, (0), 0 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:51:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 534 transitions. [2025-01-09 04:51:41,735 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 534 transitions. Word has length 79 [2025-01-09 04:51:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:41,735 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 534 transitions. [2025-01-09 04:51:41,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:51:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 534 transitions. [2025-01-09 04:51:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 04:51:41,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:41,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:41,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:51:41,736 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:41,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:41,737 INFO L85 PathProgramCache]: Analyzing trace with hash -178984548, now seen corresponding path program 1 times [2025-01-09 04:51:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:41,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602479909] [2025-01-09 04:51:41,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:41,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:41,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 04:51:41,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 04:51:41,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:41,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:42,002 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:51:42,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:42,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602479909] [2025-01-09 04:51:42,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602479909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:42,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:42,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:42,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899781217] [2025-01-09 04:51:42,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:42,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:42,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:42,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:42,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:42,004 INFO L87 Difference]: Start difference. First operand 423 states and 534 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 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:51:42,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:42,616 INFO L93 Difference]: Finished difference Result 695 states and 883 transitions. [2025-01-09 04:51:42,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:51:42,617 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-01-09 04:51:42,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:42,619 INFO L225 Difference]: With dead ends: 695 [2025-01-09 04:51:42,619 INFO L226 Difference]: Without dead ends: 627 [2025-01-09 04:51:42,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:51:42,620 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 2932 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2932 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:42,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2932 Valid, 1286 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:51:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-01-09 04:51:42,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 423. [2025-01-09 04:51:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 407 states have (on average 1.3095823095823096) internal successors, (533), 422 states have internal predecessors, (533), 0 states have call successors, (0), 0 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:51:42,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 533 transitions. [2025-01-09 04:51:42,629 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 533 transitions. Word has length 80 [2025-01-09 04:51:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:42,629 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 533 transitions. [2025-01-09 04:51:42,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 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:51:42,630 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 533 transitions. [2025-01-09 04:51:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:51:42,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:42,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:42,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:51:42,630 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:42,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:42,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1495415488, now seen corresponding path program 1 times [2025-01-09 04:51:42,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:42,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79787627] [2025-01-09 04:51:42,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:42,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:42,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:51:42,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:51:42,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:42,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:42,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:42,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79787627] [2025-01-09 04:51:42,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79787627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:42,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:42,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:51:42,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392133955] [2025-01-09 04:51:42,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:42,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:51:42,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:42,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:51:42,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:51:42,991 INFO L87 Difference]: Start difference. First operand 423 states and 533 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:43,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:43,790 INFO L93 Difference]: Finished difference Result 736 states and 932 transitions. [2025-01-09 04:51:43,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:51:43,791 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 04:51:43,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:43,793 INFO L225 Difference]: With dead ends: 736 [2025-01-09 04:51:43,793 INFO L226 Difference]: Without dead ends: 665 [2025-01-09 04:51:43,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:51:43,794 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 2790 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2790 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:43,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2790 Valid, 1613 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:51:43,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-01-09 04:51:43,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 435. [2025-01-09 04:51:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 419 states have (on average 1.3150357995226731) internal successors, (551), 434 states have internal predecessors, (551), 0 states have call successors, (0), 0 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:51:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 551 transitions. [2025-01-09 04:51:43,804 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 551 transitions. Word has length 81 [2025-01-09 04:51:43,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:43,804 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 551 transitions. [2025-01-09 04:51:43,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 551 transitions. [2025-01-09 04:51:43,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:51:43,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:43,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:43,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:51:43,805 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:43,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:43,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1272101888, now seen corresponding path program 1 times [2025-01-09 04:51:43,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:43,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718583811] [2025-01-09 04:51:43,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:43,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:43,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:51:43,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:51:43,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:43,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:44,017 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:51:44,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:44,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718583811] [2025-01-09 04:51:44,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718583811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:44,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:44,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:44,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152733847] [2025-01-09 04:51:44,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:44,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:44,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:44,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:44,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:44,019 INFO L87 Difference]: Start difference. First operand 435 states and 551 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:44,623 INFO L93 Difference]: Finished difference Result 807 states and 1032 transitions. [2025-01-09 04:51:44,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:51:44,623 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 04:51:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:44,625 INFO L225 Difference]: With dead ends: 807 [2025-01-09 04:51:44,625 INFO L226 Difference]: Without dead ends: 655 [2025-01-09 04:51:44,626 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:51:44,626 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 1808 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1808 SdHoareTripleChecker+Valid, 1883 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:44,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1808 Valid, 1883 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:51:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-01-09 04:51:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 423. [2025-01-09 04:51:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 407 states have (on average 1.307125307125307) internal successors, (532), 422 states have internal predecessors, (532), 0 states have call successors, (0), 0 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:51:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 532 transitions. [2025-01-09 04:51:44,634 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 532 transitions. Word has length 81 [2025-01-09 04:51:44,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:44,634 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 532 transitions. [2025-01-09 04:51:44,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 532 transitions. [2025-01-09 04:51:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:51:44,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:44,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:44,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:51:44,635 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:44,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:44,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1996016320, now seen corresponding path program 1 times [2025-01-09 04:51:44,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:44,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45084559] [2025-01-09 04:51:44,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:44,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:44,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:51:44,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:51:44,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:44,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:44,855 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:51:44,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:44,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45084559] [2025-01-09 04:51:44,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45084559] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:44,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:44,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:44,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596030330] [2025-01-09 04:51:44,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:44,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:44,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:44,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:44,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:44,857 INFO L87 Difference]: Start difference. First operand 423 states and 532 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:45,486 INFO L93 Difference]: Finished difference Result 754 states and 967 transitions. [2025-01-09 04:51:45,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:51:45,486 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 04:51:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:45,488 INFO L225 Difference]: With dead ends: 754 [2025-01-09 04:51:45,488 INFO L226 Difference]: Without dead ends: 651 [2025-01-09 04:51:45,488 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:51:45,488 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 1619 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1619 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:45,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1619 Valid, 2045 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:51:45,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-01-09 04:51:45,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 423. [2025-01-09 04:51:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 407 states have (on average 1.3046683046683047) internal successors, (531), 422 states have internal predecessors, (531), 0 states have call successors, (0), 0 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:51:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 531 transitions. [2025-01-09 04:51:45,504 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 531 transitions. Word has length 81 [2025-01-09 04:51:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:45,504 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 531 transitions. [2025-01-09 04:51:45,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 531 transitions. [2025-01-09 04:51:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:51:45,505 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:45,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:45,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:51:45,505 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:45,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:45,509 INFO L85 PathProgramCache]: Analyzing trace with hash -583258688, now seen corresponding path program 1 times [2025-01-09 04:51:45,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:45,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747904209] [2025-01-09 04:51:45,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:45,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:45,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:51:45,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:51:45,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:45,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:45,824 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:51:45,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:45,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747904209] [2025-01-09 04:51:45,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747904209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:45,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:45,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:45,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292538451] [2025-01-09 04:51:45,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:45,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:45,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:45,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:45,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:45,825 INFO L87 Difference]: Start difference. First operand 423 states and 531 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:46,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:46,378 INFO L93 Difference]: Finished difference Result 722 states and 921 transitions. [2025-01-09 04:51:46,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:51:46,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 04:51:46,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:46,380 INFO L225 Difference]: With dead ends: 722 [2025-01-09 04:51:46,380 INFO L226 Difference]: Without dead ends: 643 [2025-01-09 04:51:46,381 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:51:46,381 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 2746 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2746 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:46,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2746 Valid, 1550 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:51:46,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-01-09 04:51:46,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 423. [2025-01-09 04:51:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 407 states have (on average 1.3022113022113022) internal successors, (530), 422 states have internal predecessors, (530), 0 states have call successors, (0), 0 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:51:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 530 transitions. [2025-01-09 04:51:46,389 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 530 transitions. Word has length 81 [2025-01-09 04:51:46,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:46,389 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 530 transitions. [2025-01-09 04:51:46,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 530 transitions. [2025-01-09 04:51:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:51:46,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:46,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:46,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:51:46,390 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:46,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:46,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1694349184, now seen corresponding path program 1 times [2025-01-09 04:51:46,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:46,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431700770] [2025-01-09 04:51:46,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:46,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:46,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:51:46,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:51:46,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:46,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:46,612 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:51:46,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:46,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431700770] [2025-01-09 04:51:46,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431700770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:46,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:46,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:46,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068831336] [2025-01-09 04:51:46,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:46,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:46,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:46,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:46,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:46,614 INFO L87 Difference]: Start difference. First operand 423 states and 530 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:47,159 INFO L93 Difference]: Finished difference Result 722 states and 921 transitions. [2025-01-09 04:51:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:51:47,159 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 04:51:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:47,161 INFO L225 Difference]: With dead ends: 722 [2025-01-09 04:51:47,161 INFO L226 Difference]: Without dead ends: 643 [2025-01-09 04:51:47,161 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:51:47,162 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 2742 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2742 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:47,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2742 Valid, 1550 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:51:47,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-01-09 04:51:47,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 423. [2025-01-09 04:51:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 407 states have (on average 1.2997542997542997) internal successors, (529), 422 states have internal predecessors, (529), 0 states have call successors, (0), 0 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:51:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 529 transitions. [2025-01-09 04:51:47,168 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 529 transitions. Word has length 81 [2025-01-09 04:51:47,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:47,168 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 529 transitions. [2025-01-09 04:51:47,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 529 transitions. [2025-01-09 04:51:47,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:51:47,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:47,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:47,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:51:47,169 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:47,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:47,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1372385248, now seen corresponding path program 1 times [2025-01-09 04:51:47,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:47,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285706308] [2025-01-09 04:51:47,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:47,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:47,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:51:47,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:51:47,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:47,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:47,512 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:51:47,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285706308] [2025-01-09 04:51:47,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285706308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:47,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:47,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:51:47,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982256478] [2025-01-09 04:51:47,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:47,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:51:47,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:47,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:51:47,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:51:47,514 INFO L87 Difference]: Start difference. First operand 423 states and 529 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:48,453 INFO L93 Difference]: Finished difference Result 1002 states and 1325 transitions. [2025-01-09 04:51:48,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:51:48,454 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 04:51:48,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:48,456 INFO L225 Difference]: With dead ends: 1002 [2025-01-09 04:51:48,456 INFO L226 Difference]: Without dead ends: 899 [2025-01-09 04:51:48,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:51:48,457 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 5008 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5008 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:48,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5008 Valid, 2169 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:51:48,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2025-01-09 04:51:48,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 428. [2025-01-09 04:51:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 412 states have (on average 1.296116504854369) internal successors, (534), 427 states have internal predecessors, (534), 0 states have call successors, (0), 0 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:51:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 534 transitions. [2025-01-09 04:51:48,467 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 534 transitions. Word has length 81 [2025-01-09 04:51:48,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:48,468 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 534 transitions. [2025-01-09 04:51:48,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 534 transitions. [2025-01-09 04:51:48,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:51:48,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:48,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:48,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:51:48,469 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:48,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:48,469 INFO L85 PathProgramCache]: Analyzing trace with hash 845637120, now seen corresponding path program 1 times [2025-01-09 04:51:48,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:48,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558982147] [2025-01-09 04:51:48,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:48,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:48,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:51:48,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:51:48,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:48,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:48,676 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:51:48,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:48,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558982147] [2025-01-09 04:51:48,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558982147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:48,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:48,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:48,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858922193] [2025-01-09 04:51:48,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:48,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:48,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:48,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:48,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:48,679 INFO L87 Difference]: Start difference. First operand 428 states and 534 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:49,281 INFO L93 Difference]: Finished difference Result 727 states and 924 transitions. [2025-01-09 04:51:49,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:51:49,282 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 04:51:49,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:49,284 INFO L225 Difference]: With dead ends: 727 [2025-01-09 04:51:49,284 INFO L226 Difference]: Without dead ends: 648 [2025-01-09 04:51:49,284 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:51:49,284 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 2017 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:49,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 1535 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:51:49,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-01-09 04:51:49,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 428. [2025-01-09 04:51:49,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 412 states have (on average 1.2936893203883495) internal successors, (533), 427 states have internal predecessors, (533), 0 states have call successors, (0), 0 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:51:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 533 transitions. [2025-01-09 04:51:49,290 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 533 transitions. Word has length 81 [2025-01-09 04:51:49,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:49,290 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 533 transitions. [2025-01-09 04:51:49,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:49,290 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 533 transitions. [2025-01-09 04:51:49,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:51:49,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:49,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:49,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:51:49,291 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:49,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash 962867702, now seen corresponding path program 1 times [2025-01-09 04:51:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:49,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969507693] [2025-01-09 04:51:49,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:49,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:49,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:51:49,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:51:49,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:49,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:49,506 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:51:49,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:49,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969507693] [2025-01-09 04:51:49,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969507693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:49,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:49,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:49,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105434795] [2025-01-09 04:51:49,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:49,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:49,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:49,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:49,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:49,509 INFO L87 Difference]: Start difference. First operand 428 states and 533 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:50,067 INFO L93 Difference]: Finished difference Result 697 states and 878 transitions. [2025-01-09 04:51:50,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:51:50,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 04:51:50,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:50,070 INFO L225 Difference]: With dead ends: 697 [2025-01-09 04:51:50,070 INFO L226 Difference]: Without dead ends: 631 [2025-01-09 04:51:50,070 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:51:50,071 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 2393 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2393 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:50,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2393 Valid, 1731 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:51:50,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-01-09 04:51:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 427. [2025-01-09 04:51:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 411 states have (on average 1.2919708029197081) internal successors, (531), 426 states have internal predecessors, (531), 0 states have call successors, (0), 0 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:51:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 531 transitions. [2025-01-09 04:51:50,077 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 531 transitions. Word has length 81 [2025-01-09 04:51:50,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:50,077 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 531 transitions. [2025-01-09 04:51:50,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 531 transitions. [2025-01-09 04:51:50,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 04:51:50,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:50,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:50,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:51:50,078 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:50,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:50,079 INFO L85 PathProgramCache]: Analyzing trace with hash 547042711, now seen corresponding path program 1 times [2025-01-09 04:51:50,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:50,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891022667] [2025-01-09 04:51:50,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:50,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:50,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 04:51:50,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 04:51:50,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:50,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:50,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:51:50,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:50,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891022667] [2025-01-09 04:51:50,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891022667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:50,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:50,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:50,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830241950] [2025-01-09 04:51:50,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:50,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:50,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:50,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:50,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:50,275 INFO L87 Difference]: Start difference. First operand 427 states and 531 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:50,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:50,853 INFO L93 Difference]: Finished difference Result 699 states and 879 transitions. [2025-01-09 04:51:50,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:51:50,853 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 04:51:50,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:50,855 INFO L225 Difference]: With dead ends: 699 [2025-01-09 04:51:50,855 INFO L226 Difference]: Without dead ends: 631 [2025-01-09 04:51:50,855 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:51:50,856 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 2387 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2387 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:50,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2387 Valid, 1735 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:51:50,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-01-09 04:51:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 427. [2025-01-09 04:51:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 411 states have (on average 1.289537712895377) internal successors, (530), 426 states have internal predecessors, (530), 0 states have call successors, (0), 0 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:51:50,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 530 transitions. [2025-01-09 04:51:50,861 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 530 transitions. Word has length 82 [2025-01-09 04:51:50,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:50,861 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 530 transitions. [2025-01-09 04:51:50,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 530 transitions. [2025-01-09 04:51:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 04:51:50,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:50,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:50,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:51:50,862 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:50,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:50,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1592889193, now seen corresponding path program 1 times [2025-01-09 04:51:50,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:50,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161973687] [2025-01-09 04:51:50,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:50,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:50,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 04:51:50,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 04:51:50,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:50,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:51,056 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:51:51,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:51,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161973687] [2025-01-09 04:51:51,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161973687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:51,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:51,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:51,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685110395] [2025-01-09 04:51:51,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:51,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:51,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:51,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:51,057 INFO L87 Difference]: Start difference. First operand 427 states and 530 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:51,532 INFO L93 Difference]: Finished difference Result 699 states and 878 transitions. [2025-01-09 04:51:51,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:51:51,533 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 04:51:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:51,534 INFO L225 Difference]: With dead ends: 699 [2025-01-09 04:51:51,534 INFO L226 Difference]: Without dead ends: 631 [2025-01-09 04:51:51,535 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:51:51,535 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 2352 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2352 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:51,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2352 Valid, 1412 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:51:51,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-01-09 04:51:51,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 427. [2025-01-09 04:51:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 411 states have (on average 1.2871046228710463) internal successors, (529), 426 states have internal predecessors, (529), 0 states have call successors, (0), 0 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:51:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 529 transitions. [2025-01-09 04:51:51,540 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 529 transitions. Word has length 82 [2025-01-09 04:51:51,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:51,540 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 529 transitions. [2025-01-09 04:51:51,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 529 transitions. [2025-01-09 04:51:51,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 04:51:51,541 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:51,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:51,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:51:51,542 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:51,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:51,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1441526830, now seen corresponding path program 1 times [2025-01-09 04:51:51,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:51,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392378068] [2025-01-09 04:51:51,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:51,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:51,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 04:51:51,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 04:51:51,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:51,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:51,702 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:51:51,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:51,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392378068] [2025-01-09 04:51:51,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392378068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:51,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:51,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:51,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270132005] [2025-01-09 04:51:51,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:51,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:51,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:51,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:51,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:51,704 INFO L87 Difference]: Start difference. First operand 427 states and 529 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:52,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:52,259 INFO L93 Difference]: Finished difference Result 753 states and 958 transitions. [2025-01-09 04:51:52,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:51:52,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 04:51:52,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:52,261 INFO L225 Difference]: With dead ends: 753 [2025-01-09 04:51:52,261 INFO L226 Difference]: Without dead ends: 650 [2025-01-09 04:51:52,262 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:51:52,262 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 1782 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1782 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:52,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1782 Valid, 1876 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:51:52,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-01-09 04:51:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 422. [2025-01-09 04:51:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 406 states have (on average 1.2881773399014778) internal successors, (523), 421 states have internal predecessors, (523), 0 states have call successors, (0), 0 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:51:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 523 transitions. [2025-01-09 04:51:52,267 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 523 transitions. Word has length 82 [2025-01-09 04:51:52,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:52,267 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 523 transitions. [2025-01-09 04:51:52,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 523 transitions. [2025-01-09 04:51:52,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 04:51:52,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:52,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:52,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:51:52,269 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:52,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:52,270 INFO L85 PathProgramCache]: Analyzing trace with hash 906756407, now seen corresponding path program 1 times [2025-01-09 04:51:52,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:52,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418989410] [2025-01-09 04:51:52,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:52,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:52,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 04:51:52,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 04:51:52,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:52,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:52,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:52,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418989410] [2025-01-09 04:51:52,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418989410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:52,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:52,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:52,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931459730] [2025-01-09 04:51:52,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:52,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:52,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:52,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:52,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:52,516 INFO L87 Difference]: Start difference. First operand 422 states and 523 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:53,079 INFO L93 Difference]: Finished difference Result 694 states and 871 transitions. [2025-01-09 04:51:53,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:51:53,085 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 04:51:53,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:53,087 INFO L225 Difference]: With dead ends: 694 [2025-01-09 04:51:53,087 INFO L226 Difference]: Without dead ends: 626 [2025-01-09 04:51:53,087 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:51:53,088 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 2374 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:53,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2374 Valid, 1735 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:51:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-01-09 04:51:53,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 422. [2025-01-09 04:51:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 406 states have (on average 1.2857142857142858) internal successors, (522), 421 states have internal predecessors, (522), 0 states have call successors, (0), 0 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:51:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 522 transitions. [2025-01-09 04:51:53,100 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 522 transitions. Word has length 82 [2025-01-09 04:51:53,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:53,101 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 522 transitions. [2025-01-09 04:51:53,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:53,102 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 522 transitions. [2025-01-09 04:51:53,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 04:51:53,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:53,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:53,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:51:53,103 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:53,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:53,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1083737591, now seen corresponding path program 1 times [2025-01-09 04:51:53,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:53,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744113666] [2025-01-09 04:51:53,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:53,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:53,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 04:51:53,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 04:51:53,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:53,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:53,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:53,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744113666] [2025-01-09 04:51:53,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744113666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:53,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:53,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:53,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255211944] [2025-01-09 04:51:53,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:53,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:53,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:53,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:53,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:53,434 INFO L87 Difference]: Start difference. First operand 422 states and 522 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:53,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:53,943 INFO L93 Difference]: Finished difference Result 717 states and 906 transitions. [2025-01-09 04:51:53,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:51:53,946 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 04:51:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:53,948 INFO L225 Difference]: With dead ends: 717 [2025-01-09 04:51:53,948 INFO L226 Difference]: Without dead ends: 642 [2025-01-09 04:51:53,948 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:51:53,949 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 1760 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:53,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 1867 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:51:53,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-01-09 04:51:53,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 422. [2025-01-09 04:51:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 406 states have (on average 1.2832512315270936) internal successors, (521), 421 states have internal predecessors, (521), 0 states have call successors, (0), 0 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:51:53,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 521 transitions. [2025-01-09 04:51:53,955 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 521 transitions. Word has length 82 [2025-01-09 04:51:53,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:53,955 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 521 transitions. [2025-01-09 04:51:53,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:53,955 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 521 transitions. [2025-01-09 04:51:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:51:53,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:53,956 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] [2025-01-09 04:51:53,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:51:53,956 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:53,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:53,957 INFO L85 PathProgramCache]: Analyzing trace with hash 2120283973, now seen corresponding path program 1 times [2025-01-09 04:51:53,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:53,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337961327] [2025-01-09 04:51:53,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:53,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:53,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:51:54,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:51:54,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:54,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:54,213 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:51:54,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:54,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337961327] [2025-01-09 04:51:54,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337961327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:54,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:54,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:54,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082060477] [2025-01-09 04:51:54,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:54,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:54,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:54,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:54,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:54,214 INFO L87 Difference]: Start difference. First operand 422 states and 521 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:51:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:54,702 INFO L93 Difference]: Finished difference Result 632 states and 776 transitions. [2025-01-09 04:51:54,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:51:54,703 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-01-09 04:51:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:54,704 INFO L225 Difference]: With dead ends: 632 [2025-01-09 04:51:54,704 INFO L226 Difference]: Without dead ends: 626 [2025-01-09 04:51:54,705 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:51:54,705 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 2349 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2349 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:54,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2349 Valid, 1762 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:51:54,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-01-09 04:51:54,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 422. [2025-01-09 04:51:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 406 states have (on average 1.2807881773399015) internal successors, (520), 421 states have internal predecessors, (520), 0 states have call successors, (0), 0 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:51:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 520 transitions. [2025-01-09 04:51:54,710 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 520 transitions. Word has length 83 [2025-01-09 04:51:54,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:54,710 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 520 transitions. [2025-01-09 04:51:54,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:51:54,710 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 520 transitions. [2025-01-09 04:51:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:51:54,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:54,711 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] [2025-01-09 04:51:54,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:51:54,711 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:54,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:54,711 INFO L85 PathProgramCache]: Analyzing trace with hash -647233403, now seen corresponding path program 1 times [2025-01-09 04:51:54,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:54,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116799785] [2025-01-09 04:51:54,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:54,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:54,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:51:54,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:51:54,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:54,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:54,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:54,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116799785] [2025-01-09 04:51:54,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116799785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:54,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:54,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:54,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628149257] [2025-01-09 04:51:54,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:54,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:54,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:54,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:54,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:54,879 INFO L87 Difference]: Start difference. First operand 422 states and 520 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:51:55,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:55,325 INFO L93 Difference]: Finished difference Result 661 states and 816 transitions. [2025-01-09 04:51:55,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:51:55,326 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-01-09 04:51:55,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:55,327 INFO L225 Difference]: With dead ends: 661 [2025-01-09 04:51:55,327 INFO L226 Difference]: Without dead ends: 642 [2025-01-09 04:51:55,328 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:51:55,329 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 1237 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1237 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:55,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1237 Valid, 1670 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:51:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-01-09 04:51:55,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 422. [2025-01-09 04:51:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 406 states have (on average 1.2783251231527093) internal successors, (519), 421 states have internal predecessors, (519), 0 states have call successors, (0), 0 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:51:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 519 transitions. [2025-01-09 04:51:55,333 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 519 transitions. Word has length 83 [2025-01-09 04:51:55,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:55,333 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 519 transitions. [2025-01-09 04:51:55,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:51:55,333 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 519 transitions. [2025-01-09 04:51:55,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:51:55,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:55,334 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] [2025-01-09 04:51:55,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:51:55,335 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:55,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:55,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1292109307, now seen corresponding path program 1 times [2025-01-09 04:51:55,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:55,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376957527] [2025-01-09 04:51:55,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:55,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:55,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:51:55,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:51:55,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:55,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:55,522 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:51:55,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:55,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376957527] [2025-01-09 04:51:55,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376957527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:55,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:55,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:55,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290283603] [2025-01-09 04:51:55,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:55,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:55,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:55,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:55,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:55,524 INFO L87 Difference]: Start difference. First operand 422 states and 519 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:51:55,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:55,953 INFO L93 Difference]: Finished difference Result 632 states and 774 transitions. [2025-01-09 04:51:55,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:51:55,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-01-09 04:51:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:55,958 INFO L225 Difference]: With dead ends: 632 [2025-01-09 04:51:55,958 INFO L226 Difference]: Without dead ends: 626 [2025-01-09 04:51:55,958 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:51:55,959 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 1976 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1976 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:55,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1976 Valid, 1477 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:51:55,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-01-09 04:51:55,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 422. [2025-01-09 04:51:55,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 406 states have (on average 1.2758620689655173) internal successors, (518), 421 states have internal predecessors, (518), 0 states have call successors, (0), 0 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:51:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 518 transitions. [2025-01-09 04:51:55,963 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 518 transitions. Word has length 83 [2025-01-09 04:51:55,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:55,963 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 518 transitions. [2025-01-09 04:51:55,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:51:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 518 transitions. [2025-01-09 04:51:55,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:51:55,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:55,964 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] [2025-01-09 04:51:55,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:51:55,964 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:55,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:55,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2136665467, now seen corresponding path program 1 times [2025-01-09 04:51:55,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:55,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763391550] [2025-01-09 04:51:55,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:55,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:55,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:51:56,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:51:56,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:56,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:56,141 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:51:56,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:56,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763391550] [2025-01-09 04:51:56,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763391550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:56,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:56,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:56,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612153366] [2025-01-09 04:51:56,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:56,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:56,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:56,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:56,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:56,144 INFO L87 Difference]: Start difference. First operand 422 states and 518 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:51:56,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:56,748 INFO L93 Difference]: Finished difference Result 697 states and 868 transitions. [2025-01-09 04:51:56,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:51:56,749 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-01-09 04:51:56,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:56,750 INFO L225 Difference]: With dead ends: 697 [2025-01-09 04:51:56,750 INFO L226 Difference]: Without dead ends: 626 [2025-01-09 04:51:56,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:51:56,752 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 1821 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1821 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:56,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1821 Valid, 1823 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:51:56,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-01-09 04:51:56,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 422. [2025-01-09 04:51:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 406 states have (on average 1.2733990147783252) internal successors, (517), 421 states have internal predecessors, (517), 0 states have call successors, (0), 0 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:51:56,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 517 transitions. [2025-01-09 04:51:56,761 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 517 transitions. Word has length 83 [2025-01-09 04:51:56,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:56,761 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 517 transitions. [2025-01-09 04:51:56,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:51:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 517 transitions. [2025-01-09 04:51:56,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:51:56,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:56,762 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] [2025-01-09 04:51:56,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:51:56,762 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:56,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:56,762 INFO L85 PathProgramCache]: Analyzing trace with hash -609215547, now seen corresponding path program 1 times [2025-01-09 04:51:56,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:56,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360171213] [2025-01-09 04:51:56,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:56,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:56,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:51:56,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:51:56,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:56,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:56,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:51:56,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:56,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360171213] [2025-01-09 04:51:56,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360171213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:56,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:56,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:56,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48032485] [2025-01-09 04:51:56,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:56,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:56,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:56,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:56,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:56,949 INFO L87 Difference]: Start difference. First operand 422 states and 517 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:51:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:57,444 INFO L93 Difference]: Finished difference Result 726 states and 908 transitions. [2025-01-09 04:51:57,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:51:57,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-01-09 04:51:57,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:57,446 INFO L225 Difference]: With dead ends: 726 [2025-01-09 04:51:57,446 INFO L226 Difference]: Without dead ends: 642 [2025-01-09 04:51:57,447 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:51:57,447 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 1231 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:57,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 1685 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:51:57,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-01-09 04:51:57,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 422. [2025-01-09 04:51:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 406 states have (on average 1.270935960591133) internal successors, (516), 421 states have internal predecessors, (516), 0 states have call successors, (0), 0 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:51:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 516 transitions. [2025-01-09 04:51:57,451 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 516 transitions. Word has length 83 [2025-01-09 04:51:57,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:57,451 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 516 transitions. [2025-01-09 04:51:57,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:51:57,452 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 516 transitions. [2025-01-09 04:51:57,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:51:57,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:57,452 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] [2025-01-09 04:51:57,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:51:57,453 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:57,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:57,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2078948027, now seen corresponding path program 1 times [2025-01-09 04:51:57,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:57,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278722435] [2025-01-09 04:51:57,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:57,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:57,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:51:57,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:51:57,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:57,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:57,729 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:51:57,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:57,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278722435] [2025-01-09 04:51:57,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278722435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:57,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:57,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:51:57,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750882164] [2025-01-09 04:51:57,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:57,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:51:57,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:57,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:51:57,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:51:57,730 INFO L87 Difference]: Start difference. First operand 422 states and 516 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:51:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:58,707 INFO L93 Difference]: Finished difference Result 1007 states and 1313 transitions. [2025-01-09 04:51:58,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:51:58,707 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-01-09 04:51:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:58,709 INFO L225 Difference]: With dead ends: 1007 [2025-01-09 04:51:58,709 INFO L226 Difference]: Without dead ends: 898 [2025-01-09 04:51:58,709 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:51:58,710 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 4134 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4134 SdHoareTripleChecker+Valid, 2228 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:58,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4134 Valid, 2228 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:51:58,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2025-01-09 04:51:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 427. [2025-01-09 04:51:58,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 411 states have (on average 1.267639902676399) internal successors, (521), 426 states have internal predecessors, (521), 0 states have call successors, (0), 0 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:51:58,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 521 transitions. [2025-01-09 04:51:58,716 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 521 transitions. Word has length 83 [2025-01-09 04:51:58,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:58,716 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 521 transitions. [2025-01-09 04:51:58,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:51:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 521 transitions. [2025-01-09 04:51:58,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:51:58,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:58,717 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] [2025-01-09 04:51:58,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:51:58,717 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:58,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:58,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1135938619, now seen corresponding path program 1 times [2025-01-09 04:51:58,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:58,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055763379] [2025-01-09 04:51:58,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:58,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:58,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:51:58,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:51:58,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:58,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:59,022 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:51:59,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:59,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055763379] [2025-01-09 04:51:59,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055763379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:59,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:59,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:59,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403669863] [2025-01-09 04:51:59,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:59,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:59,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:59,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:59,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:59,025 INFO L87 Difference]: Start difference. First operand 427 states and 521 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:51:59,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:59,599 INFO L93 Difference]: Finished difference Result 702 states and 871 transitions. [2025-01-09 04:51:59,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:51:59,600 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-01-09 04:51:59,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:59,601 INFO L225 Difference]: With dead ends: 702 [2025-01-09 04:51:59,601 INFO L226 Difference]: Without dead ends: 631 [2025-01-09 04:51:59,602 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:51:59,603 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 2282 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2282 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:59,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2282 Valid, 1876 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:51:59,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-01-09 04:51:59,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 427. [2025-01-09 04:51:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 411 states have (on average 1.2652068126520681) internal successors, (520), 426 states have internal predecessors, (520), 0 states have call successors, (0), 0 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:51:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 520 transitions. [2025-01-09 04:51:59,611 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 520 transitions. Word has length 83 [2025-01-09 04:51:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:59,611 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 520 transitions. [2025-01-09 04:51:59,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:51:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 520 transitions. [2025-01-09 04:51:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:51:59,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:59,614 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] [2025-01-09 04:51:59,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:51:59,614 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:51:59,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:59,615 INFO L85 PathProgramCache]: Analyzing trace with hash -120186235, now seen corresponding path program 1 times [2025-01-09 04:51:59,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:59,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743111619] [2025-01-09 04:51:59,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:59,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:59,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:51:59,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:51:59,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:59,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:59,902 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:51:59,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:59,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743111619] [2025-01-09 04:51:59,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743111619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:59,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:59,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:51:59,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860063993] [2025-01-09 04:51:59,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:59,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:51:59,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:59,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:51:59,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:51:59,904 INFO L87 Difference]: Start difference. First operand 427 states and 520 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:00,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:00,775 INFO L93 Difference]: Finished difference Result 939 states and 1210 transitions. [2025-01-09 04:52:00,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:52:00,775 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-01-09 04:52:00,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:00,777 INFO L225 Difference]: With dead ends: 939 [2025-01-09 04:52:00,777 INFO L226 Difference]: Without dead ends: 855 [2025-01-09 04:52:00,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:52:00,778 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 5068 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5068 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:00,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5068 Valid, 1785 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:52:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-01-09 04:52:00,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 432. [2025-01-09 04:52:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 416 states have (on average 1.2620192307692308) internal successors, (525), 431 states have internal predecessors, (525), 0 states have call successors, (0), 0 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:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 525 transitions. [2025-01-09 04:52:00,783 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 525 transitions. Word has length 83 [2025-01-09 04:52:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:00,783 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 525 transitions. [2025-01-09 04:52:00,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 525 transitions. [2025-01-09 04:52:00,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:52:00,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:00,784 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] [2025-01-09 04:52:00,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:52:00,784 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:00,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:00,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1344158299, now seen corresponding path program 1 times [2025-01-09 04:52:00,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:00,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112384607] [2025-01-09 04:52:00,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:00,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:00,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:52:00,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:52:00,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:00,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:01,050 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:01,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:01,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112384607] [2025-01-09 04:52:01,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112384607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:01,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:01,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:52:01,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808258893] [2025-01-09 04:52:01,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:01,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:52:01,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:01,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:52:01,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:52:01,051 INFO L87 Difference]: Start difference. First operand 432 states and 525 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:01,878 INFO L93 Difference]: Finished difference Result 875 states and 1115 transitions. [2025-01-09 04:52:01,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:52:01,878 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-01-09 04:52:01,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:01,880 INFO L225 Difference]: With dead ends: 875 [2025-01-09 04:52:01,880 INFO L226 Difference]: Without dead ends: 804 [2025-01-09 04:52:01,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:52:01,881 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 5008 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5008 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:01,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5008 Valid, 1621 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:52:01,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-01-09 04:52:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 437. [2025-01-09 04:52:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 421 states have (on average 1.2589073634204275) internal successors, (530), 436 states have internal predecessors, (530), 0 states have call successors, (0), 0 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:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 530 transitions. [2025-01-09 04:52:01,887 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 530 transitions. Word has length 83 [2025-01-09 04:52:01,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:01,888 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 530 transitions. [2025-01-09 04:52:01,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 530 transitions. [2025-01-09 04:52:01,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:52:01,888 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:01,892 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] [2025-01-09 04:52:01,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 04:52:01,893 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:01,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:01,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1785662459, now seen corresponding path program 1 times [2025-01-09 04:52:01,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:01,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262452968] [2025-01-09 04:52:01,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:01,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:01,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:52:01,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:52:01,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:01,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:02,465 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:02,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:02,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262452968] [2025-01-09 04:52:02,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262452968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:02,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:02,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:52:02,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775359153] [2025-01-09 04:52:02,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:02,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:52:02,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:02,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:52:02,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:52:02,467 INFO L87 Difference]: Start difference. First operand 437 states and 530 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:03,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:03,474 INFO L93 Difference]: Finished difference Result 810 states and 1018 transitions. [2025-01-09 04:52:03,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:52:03,474 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-01-09 04:52:03,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:03,476 INFO L225 Difference]: With dead ends: 810 [2025-01-09 04:52:03,476 INFO L226 Difference]: Without dead ends: 804 [2025-01-09 04:52:03,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:52:03,478 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 4999 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4999 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:03,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4999 Valid, 1939 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:52:03,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-01-09 04:52:03,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 442. [2025-01-09 04:52:03,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 426 states have (on average 1.255868544600939) internal successors, (535), 441 states have internal predecessors, (535), 0 states have call successors, (0), 0 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:03,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 535 transitions. [2025-01-09 04:52:03,489 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 535 transitions. Word has length 83 [2025-01-09 04:52:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:03,489 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 535 transitions. [2025-01-09 04:52:03,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 535 transitions. [2025-01-09 04:52:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 04:52:03,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:03,494 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] [2025-01-09 04:52:03,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 04:52:03,494 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:03,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:03,495 INFO L85 PathProgramCache]: Analyzing trace with hash 901356690, now seen corresponding path program 1 times [2025-01-09 04:52:03,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:03,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949691510] [2025-01-09 04:52:03,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:03,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:03,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 04:52:03,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 04:52:03,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:03,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:03,905 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:03,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:03,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949691510] [2025-01-09 04:52:03,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949691510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:03,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:03,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:52:03,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445708837] [2025-01-09 04:52:03,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:03,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:52:03,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:03,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:52:03,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:52:03,906 INFO L87 Difference]: Start difference. First operand 442 states and 535 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:04,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:04,817 INFO L93 Difference]: Finished difference Result 993 states and 1207 transitions. [2025-01-09 04:52:04,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:52:04,817 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-01-09 04:52:04,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:04,820 INFO L225 Difference]: With dead ends: 993 [2025-01-09 04:52:04,820 INFO L226 Difference]: Without dead ends: 927 [2025-01-09 04:52:04,820 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:52:04,821 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 2661 mSDsluCounter, 3555 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2661 SdHoareTripleChecker+Valid, 4233 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:04,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2661 Valid, 4233 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:52:04,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-01-09 04:52:04,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 441. [2025-01-09 04:52:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 425 states have (on average 1.2541176470588236) internal successors, (533), 440 states have internal predecessors, (533), 0 states have call successors, (0), 0 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:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 533 transitions. [2025-01-09 04:52:04,834 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 533 transitions. Word has length 84 [2025-01-09 04:52:04,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:04,835 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 533 transitions. [2025-01-09 04:52:04,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:04,835 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 533 transitions. [2025-01-09 04:52:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 04:52:04,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:04,835 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] [2025-01-09 04:52:04,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:52:04,836 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:04,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:04,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1803038574, now seen corresponding path program 1 times [2025-01-09 04:52:04,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:04,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467118168] [2025-01-09 04:52:04,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:04,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:04,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 04:52:04,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 04:52:04,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:04,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:05,242 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:05,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:05,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467118168] [2025-01-09 04:52:05,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467118168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:05,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:05,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:52:05,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572499522] [2025-01-09 04:52:05,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:05,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:52:05,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:05,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:52:05,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:52:05,244 INFO L87 Difference]: Start difference. First operand 441 states and 533 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:05,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:05,691 INFO L93 Difference]: Finished difference Result 671 states and 841 transitions. [2025-01-09 04:52:05,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:52:05,691 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-01-09 04:52:05,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:05,692 INFO L225 Difference]: With dead ends: 671 [2025-01-09 04:52:05,692 INFO L226 Difference]: Without dead ends: 537 [2025-01-09 04:52:05,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:52:05,693 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 1709 mSDsluCounter, 2752 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 3328 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:05,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 3328 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:52:05,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-01-09 04:52:05,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 372. [2025-01-09 04:52:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 360 states have (on average 1.2583333333333333) internal successors, (453), 371 states have internal predecessors, (453), 0 states have call successors, (0), 0 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:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 453 transitions. [2025-01-09 04:52:05,697 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 453 transitions. Word has length 84 [2025-01-09 04:52:05,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:05,697 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 453 transitions. [2025-01-09 04:52:05,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:05,697 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 453 transitions. [2025-01-09 04:52:05,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 04:52:05,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:05,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:52:05,698 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:05,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:05,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1236288997, now seen corresponding path program 1 times [2025-01-09 04:52:05,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:05,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357933146] [2025-01-09 04:52:05,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:05,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:05,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 04:52:05,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 04:52:05,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:05,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:05,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:52:05,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:05,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357933146] [2025-01-09 04:52:05,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357933146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:05,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:05,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:05,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842897526] [2025-01-09 04:52:05,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:05,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:05,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:05,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:05,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:05,894 INFO L87 Difference]: Start difference. First operand 372 states and 453 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:06,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:06,447 INFO L93 Difference]: Finished difference Result 714 states and 893 transitions. [2025-01-09 04:52:06,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:52:06,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-01-09 04:52:06,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:06,449 INFO L225 Difference]: With dead ends: 714 [2025-01-09 04:52:06,449 INFO L226 Difference]: Without dead ends: 605 [2025-01-09 04:52:06,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:52:06,450 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 1787 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1787 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:06,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1787 Valid, 1838 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:52:06,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-01-09 04:52:06,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 367. [2025-01-09 04:52:06,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 355 states have (on average 1.2591549295774649) internal successors, (447), 366 states have internal predecessors, (447), 0 states have call successors, (0), 0 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:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 447 transitions. [2025-01-09 04:52:06,454 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 447 transitions. Word has length 84 [2025-01-09 04:52:06,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:06,454 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 447 transitions. [2025-01-09 04:52:06,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:06,454 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 447 transitions. [2025-01-09 04:52:06,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 04:52:06,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:06,455 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] [2025-01-09 04:52:06,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 04:52:06,455 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:06,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:06,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2078732722, now seen corresponding path program 1 times [2025-01-09 04:52:06,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:06,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268453821] [2025-01-09 04:52:06,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:06,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:06,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 04:52:06,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 04:52:06,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:06,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:07,167 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:07,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:07,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268453821] [2025-01-09 04:52:07,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268453821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:07,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:07,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:52:07,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955117013] [2025-01-09 04:52:07,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:07,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:52:07,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:07,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:52:07,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:52:07,169 INFO L87 Difference]: Start difference. First operand 367 states and 447 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:07,896 INFO L93 Difference]: Finished difference Result 840 states and 1044 transitions. [2025-01-09 04:52:07,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:52:07,897 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-01-09 04:52:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:07,899 INFO L225 Difference]: With dead ends: 840 [2025-01-09 04:52:07,899 INFO L226 Difference]: Without dead ends: 774 [2025-01-09 04:52:07,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:52:07,900 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 2086 mSDsluCounter, 2802 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2086 SdHoareTripleChecker+Valid, 3218 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:07,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2086 Valid, 3218 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:52:07,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2025-01-09 04:52:07,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 366. [2025-01-09 04:52:07,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 354 states have (on average 1.2570621468926553) internal successors, (445), 365 states have internal predecessors, (445), 0 states have call successors, (0), 0 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:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 445 transitions. [2025-01-09 04:52:07,906 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 445 transitions. Word has length 84 [2025-01-09 04:52:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:07,907 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 445 transitions. [2025-01-09 04:52:07,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 445 transitions. [2025-01-09 04:52:07,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 04:52:07,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:07,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:52:07,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 04:52:07,907 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:07,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:07,908 INFO L85 PathProgramCache]: Analyzing trace with hash -918543470, now seen corresponding path program 1 times [2025-01-09 04:52:07,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:07,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179636214] [2025-01-09 04:52:07,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:07,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:07,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 04:52:07,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 04:52:07,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:07,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:08,725 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:08,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:08,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179636214] [2025-01-09 04:52:08,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179636214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:08,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:08,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:52:08,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790261260] [2025-01-09 04:52:08,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:08,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:52:08,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:08,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:52:08,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:52:08,728 INFO L87 Difference]: Start difference. First operand 366 states and 445 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:09,665 INFO L93 Difference]: Finished difference Result 839 states and 1042 transitions. [2025-01-09 04:52:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:52:09,665 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-01-09 04:52:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:09,667 INFO L225 Difference]: With dead ends: 839 [2025-01-09 04:52:09,667 INFO L226 Difference]: Without dead ends: 773 [2025-01-09 04:52:09,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:52:09,668 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 1912 mSDsluCounter, 3569 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1912 SdHoareTripleChecker+Valid, 4044 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:09,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1912 Valid, 4044 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:52:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2025-01-09 04:52:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 365. [2025-01-09 04:52:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 353 states have (on average 1.254957507082153) internal successors, (443), 364 states have internal predecessors, (443), 0 states have call successors, (0), 0 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:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 443 transitions. [2025-01-09 04:52:09,672 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 443 transitions. Word has length 84 [2025-01-09 04:52:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:09,673 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 443 transitions. [2025-01-09 04:52:09,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 443 transitions. [2025-01-09 04:52:09,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 04:52:09,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:09,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:52:09,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 04:52:09,674 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:09,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:09,674 INFO L85 PathProgramCache]: Analyzing trace with hash 880993138, now seen corresponding path program 1 times [2025-01-09 04:52:09,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:09,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298460534] [2025-01-09 04:52:09,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:09,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:09,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 04:52:09,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 04:52:09,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:09,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:10,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:52:10,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:10,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298460534] [2025-01-09 04:52:10,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298460534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:10,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:10,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:52:10,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670516704] [2025-01-09 04:52:10,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:10,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:52:10,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:10,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:52:10,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:52:10,011 INFO L87 Difference]: Start difference. First operand 365 states and 443 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:10,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:10,408 INFO L93 Difference]: Finished difference Result 785 states and 994 transitions. [2025-01-09 04:52:10,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:52:10,409 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-01-09 04:52:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:10,410 INFO L225 Difference]: With dead ends: 785 [2025-01-09 04:52:10,410 INFO L226 Difference]: Without dead ends: 574 [2025-01-09 04:52:10,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:52:10,412 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 1288 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:10,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 2281 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:52:10,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-01-09 04:52:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 219. [2025-01-09 04:52:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 212 states have (on average 1.25) internal successors, (265), 218 states have internal predecessors, (265), 0 states have call successors, (0), 0 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:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 265 transitions. [2025-01-09 04:52:10,415 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 265 transitions. Word has length 84 [2025-01-09 04:52:10,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:10,416 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 265 transitions. [2025-01-09 04:52:10,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 265 transitions. [2025-01-09 04:52:10,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 04:52:10,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:10,417 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] [2025-01-09 04:52:10,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 04:52:10,417 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:10,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:10,417 INFO L85 PathProgramCache]: Analyzing trace with hash -249178582, now seen corresponding path program 1 times [2025-01-09 04:52:10,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:10,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696201572] [2025-01-09 04:52:10,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:10,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:10,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 04:52:10,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 04:52:10,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:10,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:10,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:10,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696201572] [2025-01-09 04:52:10,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696201572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:10,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:10,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:52:10,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678761538] [2025-01-09 04:52:10,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:10,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:52:10,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:10,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:52:10,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:52:10,953 INFO L87 Difference]: Start difference. First operand 219 states and 265 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 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:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:11,450 INFO L93 Difference]: Finished difference Result 569 states and 746 transitions. [2025-01-09 04:52:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 04:52:11,451 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-01-09 04:52:11,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:11,452 INFO L225 Difference]: With dead ends: 569 [2025-01-09 04:52:11,452 INFO L226 Difference]: Without dead ends: 487 [2025-01-09 04:52:11,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:52:11,453 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 1111 mSDsluCounter, 2092 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 2429 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:11,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 2429 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:52:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-01-09 04:52:11,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 202. [2025-01-09 04:52:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.2436548223350254) internal successors, (245), 201 states have internal predecessors, (245), 0 states have call successors, (0), 0 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:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 245 transitions. [2025-01-09 04:52:11,456 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 245 transitions. Word has length 85 [2025-01-09 04:52:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:11,456 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 245 transitions. [2025-01-09 04:52:11,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 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:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 245 transitions. [2025-01-09 04:52:11,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 04:52:11,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:11,456 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] [2025-01-09 04:52:11,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 04:52:11,456 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:11,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:11,457 INFO L85 PathProgramCache]: Analyzing trace with hash 690370282, now seen corresponding path program 1 times [2025-01-09 04:52:11,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:11,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038789656] [2025-01-09 04:52:11,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:11,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:11,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 04:52:11,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 04:52:11,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:11,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:11,823 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:11,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:11,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038789656] [2025-01-09 04:52:11,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038789656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:11,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:11,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:52:11,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941702394] [2025-01-09 04:52:11,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:11,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:52:11,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:11,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:52:11,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:52:11,825 INFO L87 Difference]: Start difference. First operand 202 states and 245 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 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:12,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:12,375 INFO L93 Difference]: Finished difference Result 367 states and 476 transitions. [2025-01-09 04:52:12,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:52:12,376 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-01-09 04:52:12,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:12,380 INFO L225 Difference]: With dead ends: 367 [2025-01-09 04:52:12,380 INFO L226 Difference]: Without dead ends: 267 [2025-01-09 04:52:12,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:52:12,381 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 753 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:12,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1775 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:52:12,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-09 04:52:12,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 167. [2025-01-09 04:52:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 165 states have (on average 1.2363636363636363) internal successors, (204), 166 states have internal predecessors, (204), 0 states have call successors, (0), 0 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:12,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 204 transitions. [2025-01-09 04:52:12,383 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 204 transitions. Word has length 85 [2025-01-09 04:52:12,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:12,384 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 204 transitions. [2025-01-09 04:52:12,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 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:12,384 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 204 transitions. [2025-01-09 04:52:12,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:52:12,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:12,387 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:12,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 04:52:12,387 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:12,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:12,388 INFO L85 PathProgramCache]: Analyzing trace with hash -309288342, now seen corresponding path program 1 times [2025-01-09 04:52:12,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:12,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371164812] [2025-01-09 04:52:12,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:12,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:12,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:52:12,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:52:12,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:12,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:12,643 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:12,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:12,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371164812] [2025-01-09 04:52:12,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371164812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:12,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:12,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:52:12,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113028897] [2025-01-09 04:52:12,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:12,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:52:12,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:12,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:52:12,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:52:12,644 INFO L87 Difference]: Start difference. First operand 167 states and 204 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 11 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:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:13,163 INFO L93 Difference]: Finished difference Result 555 states and 750 transitions. [2025-01-09 04:52:13,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:52:13,164 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 11 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:13,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:13,165 INFO L225 Difference]: With dead ends: 555 [2025-01-09 04:52:13,168 INFO L226 Difference]: Without dead ends: 470 [2025-01-09 04:52:13,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:52:13,169 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 2930 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2930 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:13,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2930 Valid, 681 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:52:13,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-01-09 04:52:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 172. [2025-01-09 04:52:13,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 1.2294117647058824) internal successors, (209), 171 states have internal predecessors, (209), 0 states have call successors, (0), 0 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:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2025-01-09 04:52:13,176 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 87 [2025-01-09 04:52:13,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:13,176 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2025-01-09 04:52:13,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 11 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:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2025-01-09 04:52:13,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 04:52:13,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:13,176 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] [2025-01-09 04:52:13,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 04:52:13,177 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:13,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:13,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1473532652, now seen corresponding path program 1 times [2025-01-09 04:52:13,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:13,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206810341] [2025-01-09 04:52:13,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:13,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:13,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 04:52:13,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 04:52:13,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:13,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:13,463 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:13,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:13,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206810341] [2025-01-09 04:52:13,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206810341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:13,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:13,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:52:13,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820699076] [2025-01-09 04:52:13,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:13,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:52:13,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:13,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:52:13,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:52:13,468 INFO L87 Difference]: Start difference. First operand 172 states and 209 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 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:13,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:13,849 INFO L93 Difference]: Finished difference Result 347 states and 449 transitions. [2025-01-09 04:52:13,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:52:13,849 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-01-09 04:52:13,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:13,850 INFO L225 Difference]: With dead ends: 347 [2025-01-09 04:52:13,853 INFO L226 Difference]: Without dead ends: 262 [2025-01-09 04:52:13,854 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:13,854 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 610 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:13,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 792 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:52:13,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-01-09 04:52:13,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 167. [2025-01-09 04:52:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 165 states have (on average 1.2303030303030302) internal successors, (203), 166 states have internal predecessors, (203), 0 states have call successors, (0), 0 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:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 203 transitions. [2025-01-09 04:52:13,858 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 203 transitions. Word has length 88 [2025-01-09 04:52:13,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:13,858 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 203 transitions. [2025-01-09 04:52:13,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 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:13,858 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 203 transitions. [2025-01-09 04:52:13,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:52:13,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:13,858 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:13,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 04:52:13,858 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:13,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:13,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1594060367, now seen corresponding path program 1 times [2025-01-09 04:52:13,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:13,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227924548] [2025-01-09 04:52:13,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:13,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:13,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:52:13,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:52:13,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:13,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:15,049 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:15,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:15,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227924548] [2025-01-09 04:52:15,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227924548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:15,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:15,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-01-09 04:52:15,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42678760] [2025-01-09 04:52:15,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:15,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 04:52:15,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:15,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 04:52:15,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:52:15,053 INFO L87 Difference]: Start difference. First operand 167 states and 203 transitions. Second operand has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 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:17,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:17,577 INFO L93 Difference]: Finished difference Result 653 states and 857 transitions. [2025-01-09 04:52:17,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 04:52:17,577 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 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:17,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:17,579 INFO L225 Difference]: With dead ends: 653 [2025-01-09 04:52:17,580 INFO L226 Difference]: Without dead ends: 647 [2025-01-09 04:52:17,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=393, Invalid=2157, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 04:52:17,582 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 1621 mSDsluCounter, 8848 mSDsCounter, 0 mSdLazyCounter, 4587 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1621 SdHoareTripleChecker+Valid, 9418 SdHoareTripleChecker+Invalid, 4600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:17,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1621 Valid, 9418 Invalid, 4600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4587 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 04:52:17,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-01-09 04:52:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 192. [2025-01-09 04:52:17,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 1.2263157894736842) internal successors, (233), 191 states have internal predecessors, (233), 0 states have call successors, (0), 0 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:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 233 transitions. [2025-01-09 04:52:17,586 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 233 transitions. Word has length 89 [2025-01-09 04:52:17,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:17,586 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 233 transitions. [2025-01-09 04:52:17,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 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:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 233 transitions. [2025-01-09 04:52:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 04:52:17,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:17,587 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] [2025-01-09 04:52:17,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 04:52:17,587 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:17,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:17,588 INFO L85 PathProgramCache]: Analyzing trace with hash 916649711, now seen corresponding path program 1 times [2025-01-09 04:52:17,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:17,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246393011] [2025-01-09 04:52:17,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:17,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:17,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 04:52:17,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 04:52:17,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:17,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:18,084 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:18,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:18,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246393011] [2025-01-09 04:52:18,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246393011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:18,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:18,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:52:18,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875378831] [2025-01-09 04:52:18,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:18,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:52:18,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:18,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:52:18,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:52:18,086 INFO L87 Difference]: Start difference. First operand 192 states and 233 transitions. Second operand has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 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:18,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:18,516 INFO L93 Difference]: Finished difference Result 418 states and 552 transitions. [2025-01-09 04:52:18,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 04:52:18,516 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-01-09 04:52:18,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:18,517 INFO L225 Difference]: With dead ends: 418 [2025-01-09 04:52:18,517 INFO L226 Difference]: Without dead ends: 412 [2025-01-09 04:52:18,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:52:18,518 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 970 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:18,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 1790 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:52:18,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-01-09 04:52:18,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 161. [2025-01-09 04:52:18,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.23125) internal successors, (197), 160 states have internal predecessors, (197), 0 states have call successors, (0), 0 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:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 197 transitions. [2025-01-09 04:52:18,520 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 197 transitions. Word has length 90 [2025-01-09 04:52:18,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:18,521 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 197 transitions. [2025-01-09 04:52:18,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 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:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 197 transitions. [2025-01-09 04:52:18,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 04:52:18,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:18,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:52:18,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 04:52:18,522 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:18,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:18,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1829574929, now seen corresponding path program 1 times [2025-01-09 04:52:18,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:18,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149351960] [2025-01-09 04:52:18,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:18,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:18,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 04:52:18,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 04:52:18,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:18,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:18,631 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:18,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:18,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149351960] [2025-01-09 04:52:18,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149351960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:18,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:18,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:52:18,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533356248] [2025-01-09 04:52:18,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:18,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:52:18,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:18,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:52:18,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:52:18,632 INFO L87 Difference]: Start difference. First operand 161 states and 197 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:18,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:18,744 INFO L93 Difference]: Finished difference Result 811 states and 1147 transitions. [2025-01-09 04:52:18,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:52:18,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-01-09 04:52:18,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:18,746 INFO L225 Difference]: With dead ends: 811 [2025-01-09 04:52:18,746 INFO L226 Difference]: Without dead ends: 746 [2025-01-09 04:52:18,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:52:18,747 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 1494 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:18,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1375 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:52:18,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-01-09 04:52:18,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 224. [2025-01-09 04:52:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.295964125560538) internal successors, (289), 223 states have internal predecessors, (289), 0 states have call successors, (0), 0 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:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 289 transitions. [2025-01-09 04:52:18,751 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 289 transitions. Word has length 118 [2025-01-09 04:52:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:18,751 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 289 transitions. [2025-01-09 04:52:18,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:18,751 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 289 transitions. [2025-01-09 04:52:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 04:52:18,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:18,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:52:18,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 04:52:18,752 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:18,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:18,752 INFO L85 PathProgramCache]: Analyzing trace with hash -58815912, now seen corresponding path program 1 times [2025-01-09 04:52:18,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:18,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150442830] [2025-01-09 04:52:18,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:18,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:18,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 04:52:18,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 04:52:18,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:18,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:18,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:18,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:18,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150442830] [2025-01-09 04:52:18,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150442830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:18,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:18,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:52:18,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018655696] [2025-01-09 04:52:18,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:18,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:52:18,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:18,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:52:18,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:52:18,853 INFO L87 Difference]: Start difference. First operand 224 states and 289 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:18,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:18,935 INFO L93 Difference]: Finished difference Result 929 states and 1317 transitions. [2025-01-09 04:52:18,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:52:18,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-01-09 04:52:18,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:18,937 INFO L225 Difference]: With dead ends: 929 [2025-01-09 04:52:18,937 INFO L226 Difference]: Without dead ends: 801 [2025-01-09 04:52:18,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:52:18,938 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 1174 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:18,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 931 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:52:18,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-01-09 04:52:18,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 350. [2025-01-09 04:52:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.3581661891117478) internal successors, (474), 349 states have internal predecessors, (474), 0 states have call successors, (0), 0 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:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 474 transitions. [2025-01-09 04:52:18,943 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 474 transitions. Word has length 120 [2025-01-09 04:52:18,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:18,943 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 474 transitions. [2025-01-09 04:52:18,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 474 transitions. [2025-01-09 04:52:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 04:52:18,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:18,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:52:18,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 04:52:18,944 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:18,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash 209861823, now seen corresponding path program 1 times [2025-01-09 04:52:18,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:18,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802715967] [2025-01-09 04:52:18,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:18,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:18,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 04:52:18,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 04:52:18,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:18,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:18,987 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:18,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:18,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802715967] [2025-01-09 04:52:18,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802715967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:18,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:18,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:52:18,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169654138] [2025-01-09 04:52:18,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:18,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:52:18,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:18,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:52:18,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:52:18,988 INFO L87 Difference]: Start difference. First operand 350 states and 474 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:19,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:19,003 INFO L93 Difference]: Finished difference Result 832 states and 1172 transitions. [2025-01-09 04:52:19,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:52:19,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-01-09 04:52:19,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:19,004 INFO L225 Difference]: With dead ends: 832 [2025-01-09 04:52:19,004 INFO L226 Difference]: Without dead ends: 578 [2025-01-09 04:52:19,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:52:19,005 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 82 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:19,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 457 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:52:19,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-01-09 04:52:19,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 576. [2025-01-09 04:52:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 1.3756521739130434) internal successors, (791), 575 states have internal predecessors, (791), 0 states have call successors, (0), 0 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:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 791 transitions. [2025-01-09 04:52:19,010 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 791 transitions. Word has length 120 [2025-01-09 04:52:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:19,011 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 791 transitions. [2025-01-09 04:52:19,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 791 transitions. [2025-01-09 04:52:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 04:52:19,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:19,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:52:19,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 04:52:19,012 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:19,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:19,012 INFO L85 PathProgramCache]: Analyzing trace with hash 276355335, now seen corresponding path program 1 times [2025-01-09 04:52:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:19,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912042048] [2025-01-09 04:52:19,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:19,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:19,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 04:52:19,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 04:52:19,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:19,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:19,191 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:19,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:19,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912042048] [2025-01-09 04:52:19,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912042048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:19,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:19,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:52:19,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084649953] [2025-01-09 04:52:19,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:19,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:52:19,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:19,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:52:19,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:52:19,192 INFO L87 Difference]: Start difference. First operand 576 states and 791 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:19,295 INFO L93 Difference]: Finished difference Result 1058 states and 1481 transitions. [2025-01-09 04:52:19,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:52:19,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-01-09 04:52:19,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:19,297 INFO L225 Difference]: With dead ends: 1058 [2025-01-09 04:52:19,297 INFO L226 Difference]: Without dead ends: 578 [2025-01-09 04:52:19,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:52:19,298 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 172 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:19,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 562 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:52:19,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-01-09 04:52:19,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 576. [2025-01-09 04:52:19,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 1.3721739130434782) internal successors, (789), 575 states have internal predecessors, (789), 0 states have call successors, (0), 0 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:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 789 transitions. [2025-01-09 04:52:19,303 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 789 transitions. Word has length 120 [2025-01-09 04:52:19,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:19,303 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 789 transitions. [2025-01-09 04:52:19,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 789 transitions. [2025-01-09 04:52:19,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 04:52:19,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:19,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:52:19,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-01-09 04:52:19,304 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:19,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:19,304 INFO L85 PathProgramCache]: Analyzing trace with hash -755626408, now seen corresponding path program 1 times [2025-01-09 04:52:19,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:19,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012370739] [2025-01-09 04:52:19,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:19,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:19,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 04:52:19,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 04:52:19,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:19,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:19,407 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:19,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:19,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012370739] [2025-01-09 04:52:19,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012370739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:19,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:19,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:52:19,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465220509] [2025-01-09 04:52:19,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:19,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:52:19,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:19,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:52:19,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:52:19,408 INFO L87 Difference]: Start difference. First operand 576 states and 789 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:19,486 INFO L93 Difference]: Finished difference Result 1903 states and 2686 transitions. [2025-01-09 04:52:19,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:52:19,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-01-09 04:52:19,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:19,489 INFO L225 Difference]: With dead ends: 1903 [2025-01-09 04:52:19,489 INFO L226 Difference]: Without dead ends: 1662 [2025-01-09 04:52:19,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:52:19,490 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 1098 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:19,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 959 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:52:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2025-01-09 04:52:19,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 935. [2025-01-09 04:52:19,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 934 states have (on average 1.3940042826552463) internal successors, (1302), 934 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:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1302 transitions. [2025-01-09 04:52:19,502 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1302 transitions. Word has length 120 [2025-01-09 04:52:19,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:19,502 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1302 transitions. [2025-01-09 04:52:19,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:19,502 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1302 transitions. [2025-01-09 04:52:19,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 04:52:19,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:19,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:52:19,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-01-09 04:52:19,503 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:19,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:19,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1539427416, now seen corresponding path program 1 times [2025-01-09 04:52:19,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:19,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726841737] [2025-01-09 04:52:19,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:19,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:19,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 04:52:19,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 04:52:19,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:19,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:19,617 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:19,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:19,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726841737] [2025-01-09 04:52:19,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726841737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:19,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:19,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:52:19,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402610147] [2025-01-09 04:52:19,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:19,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:52:19,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:19,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:52:19,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:52:19,619 INFO L87 Difference]: Start difference. First operand 935 states and 1302 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:19,696 INFO L93 Difference]: Finished difference Result 2142 states and 3028 transitions. [2025-01-09 04:52:19,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:52:19,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-01-09 04:52:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:19,700 INFO L225 Difference]: With dead ends: 2142 [2025-01-09 04:52:19,700 INFO L226 Difference]: Without dead ends: 1901 [2025-01-09 04:52:19,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:52:19,701 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 1018 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:19,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 1042 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:52:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2025-01-09 04:52:19,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1174. [2025-01-09 04:52:19,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1173 states have (on average 1.4015345268542199) internal successors, (1644), 1173 states have internal predecessors, (1644), 0 states have call successors, (0), 0 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:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1644 transitions. [2025-01-09 04:52:19,723 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1644 transitions. Word has length 120 [2025-01-09 04:52:19,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:19,723 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1644 transitions. [2025-01-09 04:52:19,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1644 transitions. [2025-01-09 04:52:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 04:52:19,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:19,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:52:19,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-01-09 04:52:19,724 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:19,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:19,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1420576856, now seen corresponding path program 1 times [2025-01-09 04:52:19,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:19,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459249188] [2025-01-09 04:52:19,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:19,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:19,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 04:52:19,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 04:52:19,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:19,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:19,856 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:19,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:19,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459249188] [2025-01-09 04:52:19,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459249188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:19,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:19,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:52:19,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713964321] [2025-01-09 04:52:19,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:19,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:52:19,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:19,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:52:19,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:52:19,858 INFO L87 Difference]: Start difference. First operand 1174 states and 1644 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:19,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:19,949 INFO L93 Difference]: Finished difference Result 2381 states and 3370 transitions. [2025-01-09 04:52:19,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:52:19,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-01-09 04:52:19,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:19,952 INFO L225 Difference]: With dead ends: 2381 [2025-01-09 04:52:19,953 INFO L226 Difference]: Without dead ends: 2140 [2025-01-09 04:52:19,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:52:19,954 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 1048 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:19,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1180 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:52:19,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-01-09 04:52:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1413. [2025-01-09 04:52:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1412 states have (on average 1.406515580736544) internal successors, (1986), 1412 states have internal predecessors, (1986), 0 states have call successors, (0), 0 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:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1986 transitions. [2025-01-09 04:52:19,970 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1986 transitions. Word has length 120 [2025-01-09 04:52:19,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:19,970 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 1986 transitions. [2025-01-09 04:52:19,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:19,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1986 transitions. [2025-01-09 04:52:19,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 04:52:19,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:19,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:52:19,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-01-09 04:52:19,971 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:19,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:19,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1137378904, now seen corresponding path program 1 times [2025-01-09 04:52:19,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:19,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977685011] [2025-01-09 04:52:19,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:19,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:19,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 04:52:19,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 04:52:19,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:19,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:20,073 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:20,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:20,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977685011] [2025-01-09 04:52:20,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977685011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:20,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:20,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:52:20,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922362914] [2025-01-09 04:52:20,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:20,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:52:20,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:20,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:52:20,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:52:20,075 INFO L87 Difference]: Start difference. First operand 1413 states and 1986 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:20,163 INFO L93 Difference]: Finished difference Result 2620 states and 3712 transitions. [2025-01-09 04:52:20,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:52:20,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-01-09 04:52:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:20,167 INFO L225 Difference]: With dead ends: 2620 [2025-01-09 04:52:20,167 INFO L226 Difference]: Without dead ends: 2379 [2025-01-09 04:52:20,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:52:20,168 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 1048 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:20,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1066 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:52:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2025-01-09 04:52:20,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 1652. [2025-01-09 04:52:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1651 states have (on average 1.4100545124167172) internal successors, (2328), 1651 states have internal predecessors, (2328), 0 states have call successors, (0), 0 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,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2328 transitions. [2025-01-09 04:52:20,184 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2328 transitions. Word has length 120 [2025-01-09 04:52:20,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:20,184 INFO L471 AbstractCegarLoop]: Abstraction has 1652 states and 2328 transitions. [2025-01-09 04:52:20,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:20,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2328 transitions. [2025-01-09 04:52:20,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 04:52:20,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:20,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:52:20,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-01-09 04:52:20,185 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:20,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:20,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2068457782, now seen corresponding path program 1 times [2025-01-09 04:52:20,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:20,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35575822] [2025-01-09 04:52:20,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:20,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:20,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 04:52:20,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 04:52:20,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:20,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:20,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:20,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:20,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35575822] [2025-01-09 04:52:20,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35575822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:20,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:20,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:52:20,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361563814] [2025-01-09 04:52:20,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:20,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:52:20,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:20,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:52:20,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:52:20,275 INFO L87 Difference]: Start difference. First operand 1652 states and 2328 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:20,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:20,293 INFO L93 Difference]: Finished difference Result 4127 states and 5843 transitions. [2025-01-09 04:52:20,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:52:20,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-01-09 04:52:20,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:20,297 INFO L225 Difference]: With dead ends: 4127 [2025-01-09 04:52:20,297 INFO L226 Difference]: Without dead ends: 2571 [2025-01-09 04:52:20,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:52:20,299 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 95 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:20,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 421 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:52:20,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2025-01-09 04:52:20,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2465. [2025-01-09 04:52:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2465 states, 2464 states have (on average 1.4042207792207793) internal successors, (3460), 2464 states have internal predecessors, (3460), 0 states have call successors, (0), 0 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,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3460 transitions. [2025-01-09 04:52:20,317 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3460 transitions. Word has length 121 [2025-01-09 04:52:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:20,317 INFO L471 AbstractCegarLoop]: Abstraction has 2465 states and 3460 transitions. [2025-01-09 04:52:20,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3460 transitions. [2025-01-09 04:52:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 04:52:20,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:20,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:52:20,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-01-09 04:52:20,318 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:20,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:20,319 INFO L85 PathProgramCache]: Analyzing trace with hash -969611133, now seen corresponding path program 1 times [2025-01-09 04:52:20,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:20,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370792482] [2025-01-09 04:52:20,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:20,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:20,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 04:52:20,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 04:52:20,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:20,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:20,364 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:20,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:20,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370792482] [2025-01-09 04:52:20,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370792482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:20,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:20,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:52:20,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518039586] [2025-01-09 04:52:20,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:20,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:52:20,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:20,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:52:20,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:52:20,365 INFO L87 Difference]: Start difference. First operand 2465 states and 3460 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:20,386 INFO L93 Difference]: Finished difference Result 4899 states and 6908 transitions. [2025-01-09 04:52:20,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:52:20,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-01-09 04:52:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:20,390 INFO L225 Difference]: With dead ends: 4899 [2025-01-09 04:52:20,390 INFO L226 Difference]: Without dead ends: 2530 [2025-01-09 04:52:20,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:52:20,392 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 110 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:20,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 319 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:52:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2025-01-09 04:52:20,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2528. [2025-01-09 04:52:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2528 states, 2527 states have (on average 1.3937475267115156) internal successors, (3522), 2527 states have internal predecessors, (3522), 0 states have call successors, (0), 0 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,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 3522 transitions. [2025-01-09 04:52:20,413 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 3522 transitions. Word has length 122 [2025-01-09 04:52:20,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:20,414 INFO L471 AbstractCegarLoop]: Abstraction has 2528 states and 3522 transitions. [2025-01-09 04:52:20,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:20,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 3522 transitions. [2025-01-09 04:52:20,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 04:52:20,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:20,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:52:20,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-01-09 04:52:20,414 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:20,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:20,415 INFO L85 PathProgramCache]: Analyzing trace with hash 627156676, now seen corresponding path program 1 times [2025-01-09 04:52:20,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:20,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448365610] [2025-01-09 04:52:20,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:20,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:20,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 04:52:20,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 04:52:20,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:20,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:20,493 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:20,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:20,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448365610] [2025-01-09 04:52:20,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448365610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:20,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:20,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:52:20,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087402044] [2025-01-09 04:52:20,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:20,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:52:20,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:20,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:52:20,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:52:20,495 INFO L87 Difference]: Start difference. First operand 2528 states and 3522 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:20,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:20,518 INFO L93 Difference]: Finished difference Result 7232 states and 10082 transitions. [2025-01-09 04:52:20,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:52:20,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-01-09 04:52:20,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:20,525 INFO L225 Difference]: With dead ends: 7232 [2025-01-09 04:52:20,525 INFO L226 Difference]: Without dead ends: 4800 [2025-01-09 04:52:20,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:52:20,528 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 88 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:20,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 418 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:52:20,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4800 states. [2025-01-09 04:52:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4800 to 4638. [2025-01-09 04:52:20,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4638 states, 4637 states have (on average 1.3847315074401552) internal successors, (6421), 4637 states have internal predecessors, (6421), 0 states have call successors, (0), 0 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,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4638 states to 4638 states and 6421 transitions. [2025-01-09 04:52:20,566 INFO L78 Accepts]: Start accepts. Automaton has 4638 states and 6421 transitions. Word has length 122 [2025-01-09 04:52:20,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:20,566 INFO L471 AbstractCegarLoop]: Abstraction has 4638 states and 6421 transitions. [2025-01-09 04:52:20,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 4638 states and 6421 transitions. [2025-01-09 04:52:20,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 04:52:20,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:20,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:52:20,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-01-09 04:52:20,567 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:20,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:20,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1032814975, now seen corresponding path program 1 times [2025-01-09 04:52:20,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:20,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058852068] [2025-01-09 04:52:20,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:20,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:20,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 04:52:20,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 04:52:20,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:20,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:20,665 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:20,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:20,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058852068] [2025-01-09 04:52:20,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058852068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:20,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:20,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:52:20,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937577620] [2025-01-09 04:52:20,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:20,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:52:20,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:20,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:52:20,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:52:20,667 INFO L87 Difference]: Start difference. First operand 4638 states and 6421 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:20,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:20,700 INFO L93 Difference]: Finished difference Result 13402 states and 18499 transitions. [2025-01-09 04:52:20,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:52:20,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2025-01-09 04:52:20,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:20,713 INFO L225 Difference]: With dead ends: 13402 [2025-01-09 04:52:20,714 INFO L226 Difference]: Without dead ends: 8860 [2025-01-09 04:52:20,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:52:20,720 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 81 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:20,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 419 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:52:20,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8860 states. [2025-01-09 04:52:20,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8860 to 8538. [2025-01-09 04:52:20,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8538 states, 8537 states have (on average 1.370387724024833) internal successors, (11699), 8537 states have internal predecessors, (11699), 0 states have call successors, (0), 0 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,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8538 states to 8538 states and 11699 transitions. [2025-01-09 04:52:20,800 INFO L78 Accepts]: Start accepts. Automaton has 8538 states and 11699 transitions. Word has length 123 [2025-01-09 04:52:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:20,800 INFO L471 AbstractCegarLoop]: Abstraction has 8538 states and 11699 transitions. [2025-01-09 04:52:20,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 8538 states and 11699 transitions. [2025-01-09 04:52:20,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 04:52:20,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:20,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, 1, 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,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-01-09 04:52:20,801 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:20,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:20,801 INFO L85 PathProgramCache]: Analyzing trace with hash -144687752, now seen corresponding path program 1 times [2025-01-09 04:52:20,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:20,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369553453] [2025-01-09 04:52:20,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:20,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:20,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 04:52:20,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 04:52:20,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:20,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:20,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:20,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:20,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369553453] [2025-01-09 04:52:20,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369553453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:20,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:20,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:52:20,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377529648] [2025-01-09 04:52:20,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:20,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:52:20,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:20,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:52:20,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:52:20,884 INFO L87 Difference]: Start difference. First operand 8538 states and 11699 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:20,934 INFO L93 Difference]: Finished difference Result 24782 states and 33773 transitions. [2025-01-09 04:52:20,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:52:20,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-01-09 04:52:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:20,956 INFO L225 Difference]: With dead ends: 24782 [2025-01-09 04:52:20,956 INFO L226 Difference]: Without dead ends: 16340 [2025-01-09 04:52:20,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:52:20,967 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 74 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:20,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 419 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:52:20,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16340 states. [2025-01-09 04:52:21,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16340 to 15698. [2025-01-09 04:52:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15698 states, 15697 states have (on average 1.3515321398993438) internal successors, (21215), 15697 states have internal predecessors, (21215), 0 states have call successors, (0), 0 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:21,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15698 states to 15698 states and 21215 transitions. [2025-01-09 04:52:21,196 INFO L78 Accepts]: Start accepts. Automaton has 15698 states and 21215 transitions. Word has length 124 [2025-01-09 04:52:21,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:21,196 INFO L471 AbstractCegarLoop]: Abstraction has 15698 states and 21215 transitions. [2025-01-09 04:52:21,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:52:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 15698 states and 21215 transitions. [2025-01-09 04:52:21,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 04:52:21,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:21,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:52:21,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-01-09 04:52:21,197 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:21,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:21,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1164457485, now seen corresponding path program 1 times [2025-01-09 04:52:21,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:21,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422763106] [2025-01-09 04:52:21,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:21,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:21,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 04:52:21,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 04:52:21,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:21,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:21,279 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,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:21,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422763106] [2025-01-09 04:52:21,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422763106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:21,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:21,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:52:21,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528138214] [2025-01-09 04:52:21,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:21,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:52:21,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:21,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:52:21,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:52:21,281 INFO L87 Difference]: Start difference. First operand 15698 states and 21215 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:21,357 INFO L93 Difference]: Finished difference Result 45622 states and 61201 transitions. [2025-01-09 04:52:21,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:52:21,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-01-09 04:52:21,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:21,394 INFO L225 Difference]: With dead ends: 45622 [2025-01-09 04:52:21,395 INFO L226 Difference]: Without dead ends: 30020 [2025-01-09 04:52:21,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:52:21,412 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 64 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:21,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 419 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:52:21,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30020 states. [2025-01-09 04:52:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30020 to 28738. [2025-01-09 04:52:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28738 states, 28737 states have (on average 1.3281483801371055) internal successors, (38167), 28737 states have internal predecessors, (38167), 0 states have call successors, (0), 0 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:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28738 states to 28738 states and 38167 transitions. [2025-01-09 04:52:21,797 INFO L78 Accepts]: Start accepts. Automaton has 28738 states and 38167 transitions. Word has length 125 [2025-01-09 04:52:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:21,797 INFO L471 AbstractCegarLoop]: Abstraction has 28738 states and 38167 transitions. [2025-01-09 04:52:21,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 28738 states and 38167 transitions. [2025-01-09 04:52:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 04:52:21,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:21,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-01-09 04:52:21,798 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:21,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:21,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2124750892, now seen corresponding path program 1 times [2025-01-09 04:52:21,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:21,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933784048] [2025-01-09 04:52:21,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:21,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:21,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 04:52:21,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 04:52:21,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:21,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:22,053 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:22,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:22,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933784048] [2025-01-09 04:52:22,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933784048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:52:22,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:52:22,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:52:22,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119208298] [2025-01-09 04:52:22,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:52:22,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:52:22,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:22,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:52:22,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:52:22,055 INFO L87 Difference]: Start difference. First operand 28738 states and 38167 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:22,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:22,133 INFO L93 Difference]: Finished difference Result 29316 states and 38936 transitions. [2025-01-09 04:52:22,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:52:22,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-01-09 04:52:22,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:22,175 INFO L225 Difference]: With dead ends: 29316 [2025-01-09 04:52:22,175 INFO L226 Difference]: Without dead ends: 29314 [2025-01-09 04:52:22,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:52:22,185 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 0 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:22,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 948 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:52:22,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29314 states. [2025-01-09 04:52:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29314 to 29314. [2025-01-09 04:52:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29314 states, 29313 states have (on average 1.3140586088083785) internal successors, (38519), 29313 states have internal predecessors, (38519), 0 states have call successors, (0), 0 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:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29314 states to 29314 states and 38519 transitions. [2025-01-09 04:52:22,544 INFO L78 Accepts]: Start accepts. Automaton has 29314 states and 38519 transitions. Word has length 126 [2025-01-09 04:52:22,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:22,544 INFO L471 AbstractCegarLoop]: Abstraction has 29314 states and 38519 transitions. [2025-01-09 04:52:22,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 29314 states and 38519 transitions. [2025-01-09 04:52:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 04:52:22,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:22,548 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-01-09 04:52:22,549 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:22,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:22,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1407701576, now seen corresponding path program 1 times [2025-01-09 04:52:22,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:22,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983299320] [2025-01-09 04:52:22,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:22,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:22,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 04:52:22,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 04:52:22,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:22,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:22,907 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:22,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:22,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983299320] [2025-01-09 04:52:22,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983299320] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:52:22,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435009916] [2025-01-09 04:52:22,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:22,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:52:22,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:52:22,912 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:52:22,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:52:23,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 04:52:23,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 04:52:23,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:23,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:23,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 1003 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 04:52:23,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:52:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:24,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:52:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:25,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435009916] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:52:25,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:52:25,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2025-01-09 04:52:25,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994532182] [2025-01-09 04:52:25,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:52:25,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 04:52:25,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:25,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 04:52:25,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:52:25,503 INFO L87 Difference]: Start difference. First operand 29314 states and 38519 transitions. Second operand has 28 states, 28 states have (on average 13.321428571428571) internal successors, (373), 27 states have internal predecessors, (373), 0 states have call successors, (0), 0 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,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:30,352 INFO L93 Difference]: Finished difference Result 280627 states and 367576 transitions. [2025-01-09 04:52:30,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2025-01-09 04:52:30,352 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 13.321428571428571) internal successors, (373), 27 states have internal predecessors, (373), 0 states have call successors, (0), 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 158 [2025-01-09 04:52:30,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:30,698 INFO L225 Difference]: With dead ends: 280627 [2025-01-09 04:52:30,699 INFO L226 Difference]: Without dead ends: 251409 [2025-01-09 04:52:30,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7069 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3023, Invalid=18147, Unknown=0, NotChecked=0, Total=21170 [2025-01-09 04:52:30,793 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 3945 mSDsluCounter, 3297 mSDsCounter, 0 mSdLazyCounter, 3027 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3945 SdHoareTripleChecker+Valid, 3508 SdHoareTripleChecker+Invalid, 3068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:30,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3945 Valid, 3508 Invalid, 3068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3027 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 04:52:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251409 states. [2025-01-09 04:52:32,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251409 to 150738. [2025-01-09 04:52:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150738 states, 150737 states have (on average 1.3037011483577357) internal successors, (196516), 150737 states have internal predecessors, (196516), 0 states have call successors, (0), 0 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,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150738 states to 150738 states and 196516 transitions. [2025-01-09 04:52:33,080 INFO L78 Accepts]: Start accepts. Automaton has 150738 states and 196516 transitions. Word has length 158 [2025-01-09 04:52:33,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:33,080 INFO L471 AbstractCegarLoop]: Abstraction has 150738 states and 196516 transitions. [2025-01-09 04:52:33,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 13.321428571428571) internal successors, (373), 27 states have internal predecessors, (373), 0 states have call successors, (0), 0 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,080 INFO L276 IsEmpty]: Start isEmpty. Operand 150738 states and 196516 transitions. [2025-01-09 04:52:33,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 04:52:33,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:33,092 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:52:33,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-01-09 04:52:33,293 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 04:52:33,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:33,294 INFO L85 PathProgramCache]: Analyzing trace with hash -186468269, now seen corresponding path program 1 times [2025-01-09 04:52:33,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:33,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400358683] [2025-01-09 04:52:33,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:33,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:33,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 04:52:33,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 04:52:33,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:33,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:34,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:34,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400358683] [2025-01-09 04:52:34,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400358683] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:52:34,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768796990] [2025-01-09 04:52:34,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:34,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:52:34,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:52:34,177 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:52:34,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:52:34,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 04:52:34,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 04:52:34,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:34,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:34,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 04:52:34,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:52:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:35,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:52:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:35,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768796990] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:52:35,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:52:35,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 30 [2025-01-09 04:52:35,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695831738] [2025-01-09 04:52:35,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:52:35,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 04:52:35,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:35,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 04:52:35,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2025-01-09 04:52:35,662 INFO L87 Difference]: Start difference. First operand 150738 states and 196516 transitions. Second operand has 30 states, 30 states have (on average 14.5) internal successors, (435), 30 states have internal predecessors, (435), 0 states have call successors, (0), 0 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,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:50,431 INFO L93 Difference]: Finished difference Result 1219376 states and 1585318 transitions. [2025-01-09 04:52:50,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2025-01-09 04:52:50,431 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 14.5) internal successors, (435), 30 states have internal predecessors, (435), 0 states have call successors, (0), 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 159 [2025-01-09 04:52:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted.