./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52cbb0c1391c9e840599beece58e1ecbc8d18028ef540ea98f759da7158f4609 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:28:07,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:28:07,872 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:28:07,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:28:07,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:28:07,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:28:07,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:28:07,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:28:07,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:28:07,906 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:28:07,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:28:07,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:28:07,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:28:07,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:28:07,907 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:28:07,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:28:07,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:28:07,908 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:28:07,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:28:07,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:28:07,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:28:07,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:28:07,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:28:07,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:28:07,909 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:28:07,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:28:07,909 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:28:07,909 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:28:07,909 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:28:07,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:28:07,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:28:07,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:28:07,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:28:07,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:28:07,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:28:07,910 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:28:07,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:28:07,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:28:07,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:28:07,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:28:07,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:28:07,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:28:07,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:28:07,910 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52cbb0c1391c9e840599beece58e1ecbc8d18028ef540ea98f759da7158f4609 [2025-03-08 06:28:08,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:28:08,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:28:08,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:28:08,161 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:28:08,162 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:28:08,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-08 06:28:09,375 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/229208323/fdf36aad2a574cb1a5603f67b4158828/FLAG4b47e5682 [2025-03-08 06:28:09,851 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:28:09,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-08 06:28:09,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/229208323/fdf36aad2a574cb1a5603f67b4158828/FLAG4b47e5682 [2025-03-08 06:28:09,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/229208323/fdf36aad2a574cb1a5603f67b4158828 [2025-03-08 06:28:09,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:28:09,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:28:09,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:28:09,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:28:09,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:28:09,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:28:09" (1/1) ... [2025-03-08 06:28:09,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ba4f8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:09, skipping insertion in model container [2025-03-08 06:28:09,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:28:09" (1/1) ... [2025-03-08 06:28:10,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:28:10,353 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13531,13544] [2025-03-08 06:28:10,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18011,18024] [2025-03-08 06:28:10,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19303,19316] [2025-03-08 06:28:10,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20061,20074] [2025-03-08 06:28:10,418 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21681,21694] [2025-03-08 06:28:10,421 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22439,22452] [2025-03-08 06:28:10,428 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23525,23538] [2025-03-08 06:28:10,443 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26064,26077] [2025-03-08 06:28:10,446 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26825,26838] [2025-03-08 06:28:10,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27914,27927] [2025-03-08 06:28:10,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29919,29932] [2025-03-08 06:28:10,479 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33842,33855] [2025-03-08 06:28:10,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34603,34616] [2025-03-08 06:28:10,489 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35696,35709] [2025-03-08 06:28:10,500 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37705,37718] [2025-03-08 06:28:10,516 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41308,41321] [2025-03-08 06:28:10,539 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48185,48198] [2025-03-08 06:28:10,542 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48946,48959] [2025-03-08 06:28:10,545 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[50035,50048] [2025-03-08 06:28:10,553 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[52040,52053] [2025-03-08 06:28:10,565 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[55429,55442] [2025-03-08 06:28:10,580 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61126,61139] [2025-03-08 06:28:10,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:28:10,838 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:28:10,910 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13531,13544] [2025-03-08 06:28:10,918 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18011,18024] [2025-03-08 06:28:10,925 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19303,19316] [2025-03-08 06:28:10,927 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20061,20074] [2025-03-08 06:28:10,931 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21681,21694] [2025-03-08 06:28:10,934 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22439,22452] [2025-03-08 06:28:10,938 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23525,23538] [2025-03-08 06:28:10,943 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26064,26077] [2025-03-08 06:28:10,945 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26825,26838] [2025-03-08 06:28:10,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27914,27927] [2025-03-08 06:28:10,952 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29919,29932] [2025-03-08 06:28:10,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33842,33855] [2025-03-08 06:28:10,963 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34603,34616] [2025-03-08 06:28:10,965 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35696,35709] [2025-03-08 06:28:10,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37705,37718] [2025-03-08 06:28:10,979 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41308,41321] [2025-03-08 06:28:10,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48185,48198] [2025-03-08 06:28:10,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48946,48959] [2025-03-08 06:28:11,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[50035,50048] [2025-03-08 06:28:11,010 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[52040,52053] [2025-03-08 06:28:11,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[55429,55442] [2025-03-08 06:28:11,044 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61126,61139] [2025-03-08 06:28:11,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:28:11,211 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:28:11,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:11 WrapperNode [2025-03-08 06:28:11,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:28:11,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:28:11,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:28:11,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:28:11,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:11" (1/1) ... [2025-03-08 06:28:11,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:11" (1/1) ... [2025-03-08 06:28:11,408 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6748 [2025-03-08 06:28:11,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:28:11,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:28:11,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:28:11,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:28:11,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:11" (1/1) ... [2025-03-08 06:28:11,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:11" (1/1) ... [2025-03-08 06:28:11,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:11" (1/1) ... [2025-03-08 06:28:11,481 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:28:11,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:11" (1/1) ... [2025-03-08 06:28:11,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:11" (1/1) ... [2025-03-08 06:28:11,534 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:11" (1/1) ... [2025-03-08 06:28:11,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:11" (1/1) ... [2025-03-08 06:28:11,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:11" (1/1) ... [2025-03-08 06:28:11,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:11" (1/1) ... [2025-03-08 06:28:11,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:28:11,588 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:28:11,588 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:28:11,588 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:28:11,589 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:11" (1/1) ... [2025-03-08 06:28:11,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:28:11,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:28:11,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:28:11,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:28:11,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:28:11,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:28:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:28:11,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:28:11,902 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:28:11,904 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:28:14,543 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L498: havoc main_~node3__m3~1#1; [2025-03-08 06:28:14,543 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6576: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~60#1; [2025-03-08 06:28:14,543 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6973: havoc main_~node6____CPAchecker_TMP_0~12#1;havoc main_~node6__m6~44#1; [2025-03-08 06:28:14,543 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7502: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~24#1; [2025-03-08 06:28:14,543 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8032: havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~76#1; [2025-03-08 06:28:14,543 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8429: havoc main_~node6____CPAchecker_TMP_0~20#1;havoc main_~node6__m6~52#1; [2025-03-08 06:28:14,543 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10411: havoc main_~node6____CPAchecker_TMP_0~31#1;havoc main_~node6__m6~63#1; [2025-03-08 06:28:14,544 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L634: havoc main_~node3__m3~2#1; [2025-03-08 06:28:14,544 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8958: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~28#1; [2025-03-08 06:28:14,544 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1427: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-08 06:28:14,544 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2221: havoc main_~node6__m6~10#1; [2025-03-08 06:28:14,544 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4071: havoc main_~check__tmp~38#1;havoc main_~node6__m6~24#1; [2025-03-08 06:28:14,544 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6450: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~21#1; [2025-03-08 06:28:14,544 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7375: havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~69#1; [2025-03-08 06:28:14,544 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1694: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-03-08 06:28:14,544 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-03-08 06:28:14,544 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3809: havoc main_~node5__m5~12#1; [2025-03-08 06:28:14,544 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9359: havoc main_~node6____CPAchecker_TMP_0~25#1;havoc main_~node6__m6~57#1; [2025-03-08 06:28:14,544 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7906: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~25#1; [2025-03-08 06:28:14,544 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6849: havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~63#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8831: havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~85#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4339: havoc main_~check__tmp~40#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10682: havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~106#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4737: havoc main_~check__tmp~43#1;havoc main_~node6__m6~30#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L377: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3284: havoc main_~node6__m6~18#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8305: havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~79#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6192: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~56#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2493: havoc main_~node5__m5~7#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2758: havoc main_~node5__m5~8#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2362: havoc main_~node6__m6~11#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L513: havoc main_~node4__m4~1#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9630: havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~94#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4875: havoc main_~node5__m5~17#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5140: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~44#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7519: havoc main_~node6____CPAchecker_TMP_0~15#1;havoc main_~node6__m6~47#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5537: havoc main_~node6____CPAchecker_TMP_0~4#1;havoc main_~node6__m6~36#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6066: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L649: havoc main_~node4__m4~2#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3556: havoc main_~node5__m5~11#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4482: havoc main_~node5__m5~15#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3425: havoc main_~node6__m6~19#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8975: havoc main_~node6____CPAchecker_TMP_0~23#1;havoc main_~node6__m6~55#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1973: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10033: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-03-08 06:28:14,545 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1313: havoc main_~node5__m5~3#1; [2025-03-08 06:28:14,546 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4220: havoc main_~node3__m3~5#1; [2025-03-08 06:28:14,546 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3824: havoc main_~node6__m6~22#1; [2025-03-08 06:28:14,546 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6467: havoc main_~node6____CPAchecker_TMP_0~9#1;havoc main_~node6__m6~41#1; [2025-03-08 06:28:14,546 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3032: havoc main_~check__tmp~27#1;havoc main_~node6__m6~16#1; [2025-03-08 06:28:14,546 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5939: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~53#1; [2025-03-08 06:28:14,546 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9903: havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~97#1; [2025-03-08 06:28:14,546 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7790: havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~74#1; [2025-03-08 06:28:14,546 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7923: havoc main_~node6____CPAchecker_TMP_0~17#1;havoc main_~node6__m6~49#1; [2025-03-08 06:28:14,546 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5413: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~47#1; [2025-03-08 06:28:14,546 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9246: havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~90#1; [2025-03-08 06:28:14,546 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2508: havoc main_~node6__m6~12#1; [2025-03-08 06:28:14,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L394: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-08 06:28:14,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: havoc main_~node6__m6~14#1; [2025-03-08 06:28:14,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6738: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~62#1; [2025-03-08 06:28:14,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L528: havoc main_~node5__m5~1#1; [2025-03-08 06:28:14,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3964: havoc main_~check__tmp~37#1;havoc main_~node6__m6~23#1; [2025-03-08 06:28:14,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4890: havoc main_~node6__m6~32#1; [2025-03-08 06:28:14,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L794: havoc main_~node6____CPAchecker_TMP_0~1#1; [2025-03-08 06:28:14,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8194: havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~78#1; [2025-03-08 06:28:14,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10176: havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~100#1; [2025-03-08 06:28:14,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10573: havoc main_~node6____CPAchecker_TMP_0~32#1;havoc main_~node6__m6~64#1; [2025-03-08 06:28:14,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L664: havoc main_~node5__m5~2#1; [2025-03-08 06:28:14,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3571: havoc main_~node6__m6~20#1; [2025-03-08 06:28:14,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L929: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:28:14,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6083: havoc main_~node6____CPAchecker_TMP_0~7#1;havoc main_~node6__m6~39#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2648: havoc main_~check__tmp~23#1;havoc main_~node6__m6~13#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7141: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2913: havoc main_~check__tmp~26#1;havoc main_~node6__m6~15#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1328: havoc main_~node6__m6~4#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4235: havoc main_~node4__m4~8#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9521: havoc main_~node6____CPAchecker_TMP_0~26#1;havoc main_~node6__m6~58#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10050: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~31#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7011: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~65#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8597: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8467: havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~81#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1200: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10449: havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~103#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3711: havoc main_~check__tmp~34#1;havoc main_~node6__m6~21#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6354: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~58#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863: havoc main_~check__tmp~13#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L543: havoc main_~node6__m6~1#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L411: havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1469: havoc main_~node6__m6~5#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9397: havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~91#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5302: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~46#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7284: havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~68#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7681: havoc main_~node6____CPAchecker_TMP_0~16#1;havoc main_~node6__m6~48#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L679: havoc main_~node6__m6~2#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8740: havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~84#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9137: havoc main_~node6____CPAchecker_TMP_0~24#1;havoc main_~node6__m6~56#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2267: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-03-08 06:28:14,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2400: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4250: havoc main_~node5__m5~14#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4118: havoc main_~node6__m6~25#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6629: havoc main_~node6____CPAchecker_TMP_0~10#1;havoc main_~node6__m6~42#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7158: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~23#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5705: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10067: havoc main_~node6____CPAchecker_TMP_0~29#1;havoc main_~node6__m6~61#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8085: havoc main_~node6____CPAchecker_TMP_0~18#1;havoc main_~node6__m6~50#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5575: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~49#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7557: havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~71#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8614: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~27#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3330: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~28#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2009: havoc main_~check__tmp~15#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3463: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~30#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9013: havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~87#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1747: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3862: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~35#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6505: havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~59#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4524: havoc main_~check__tmp~42#1;havoc main_~node6__m6~28#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10338: havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~102#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1618: havoc main_~node4__m4~3#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7961: havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~75#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9812: havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~96#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5848: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~52#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6245: havoc main_~node6____CPAchecker_TMP_0~8#1;havoc main_~node6__m6~40#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~21#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2811: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~24#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4265: havoc main_~node6__m6~26#1; [2025-03-08 06:28:14,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4796: havoc main_~node6__m6~31#1; [2025-03-08 06:28:14,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7175: havoc main_~node6____CPAchecker_TMP_0~13#1;havoc main_~node6__m6~45#1; [2025-03-08 06:28:14,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5193: havoc main_~node6____CPAchecker_TMP_0~2#1;havoc main_~node6__m6~34#1; [2025-03-08 06:28:14,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5722: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~19#1; [2025-03-08 06:28:14,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10611: havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~105#1; [2025-03-08 06:28:14,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9686: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~30#1; [2025-03-08 06:28:14,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3609: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~32#1; [2025-03-08 06:28:14,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8631: havoc main_~node6____CPAchecker_TMP_0~21#1;havoc main_~node6__m6~53#1; [2025-03-08 06:28:14,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6121: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~55#1; [2025-03-08 06:28:14,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4405: havoc main_~check__tmp~41#1;havoc main_~node6__m6~27#1; [2025-03-08 06:28:14,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9559: havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~93#1; [2025-03-08 06:28:14,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L839: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-08 06:28:14,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7446: havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~70#1; [2025-03-08 06:28:14,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1633: havoc main_~node5__m5~4#1; [2025-03-08 06:28:14,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1106: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-08 06:28:14,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L974: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:28:14,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6920: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~64#1; [2025-03-08 06:28:14,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8902: havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~86#1; [2025-03-08 06:28:14,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8376: havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~80#1; [2025-03-08 06:28:14,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3091: havoc main_~node6__m6~17#1; [2025-03-08 06:28:14,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1374: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-08 06:28:14,552 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3224: havoc main_~node2__m2~3#1; [2025-03-08 06:28:14,552 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1507: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-08 06:28:14,552 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10229: havoc main_~node6____CPAchecker_TMP_0~30#1;havoc main_~node6__m6~62#1; [2025-03-08 06:28:14,552 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6794: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~22#1; [2025-03-08 06:28:14,552 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7719: havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~73#1; [2025-03-08 06:28:14,552 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4680: havoc main_~node4__m4~9#1; [2025-03-08 06:28:14,552 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5739: havoc main_~node6____CPAchecker_TMP_0~5#1;havoc main_~node6__m6~37#1; [2025-03-08 06:28:14,552 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2436: havoc main_~check__tmp~20#1; [2025-03-08 06:28:14,552 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9703: havoc main_~node6____CPAchecker_TMP_0~27#1;havoc main_~node6__m6~59#1; [2025-03-08 06:28:14,552 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8250: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~26#1; [2025-03-08 06:28:14,552 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9175: havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~89#1; [2025-03-08 06:28:14,552 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9308: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-03-08 06:28:14,552 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7855: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-03-08 06:28:14,552 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6667: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~61#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L326: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2176: havoc main_~node3__m3~3#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4951: havoc main_~node6__m6~33#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1648: havoc main_~node6__m6~6#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8123: havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~77#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10105: havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~99#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L724: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3499: havoc main_~check__tmp~31#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1253: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6010: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~54#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9974: havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~98#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L461: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4029: havoc main_~node5__m5~13#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3898: havoc main_~check__tmp~36#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5484: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~48#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3239: havoc main_~node3__m3~4#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7337: havoc main_~node6____CPAchecker_TMP_0~14#1;havoc main_~node6__m6~46#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc main_~node5__m5~5#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4695: havoc main_~node5__m5~16#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L599: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1789: havoc main_~node6__m6~7#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2582: havoc main_~check__tmp~22#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2847: havoc main_~check__tmp~25#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6811: havoc main_~node6____CPAchecker_TMP_0~11#1;havoc main_~node6__m6~43#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8793: havoc main_~node6____CPAchecker_TMP_0~22#1;havoc main_~node6__m6~54#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5358: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6283: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~57#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2320: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6416: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4303: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~39#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8267: havoc main_~node6____CPAchecker_TMP_0~19#1;havoc main_~node6__m6~51#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9325: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7872: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-03-08 06:28:14,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2191: havoc main_~node4__m4~4#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3645: havoc main_~check__tmp~33#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5231: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~45#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7213: havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~67#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L343: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7082: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~66#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3383: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~29#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8669: havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~83#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8538: havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~82#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10520: havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~104#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3254: havoc main_~node4__m4~6#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2990: havoc main_~node5__m5~9#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1935: havoc main_~node6__m6~8#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L483: havoc main_~node2__m2~1#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9468: havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~92#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5901: havoc main_~node6____CPAchecker_TMP_0~6#1;havoc main_~node6__m6~38#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9865: havoc main_~node6____CPAchecker_TMP_0~28#1;havoc main_~node6__m6~60#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10394: havoc main_~node5____CPAchecker_TMP_0~16#1;havoc main_~node5__m5~32#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc main_~check__tmp~9#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5375: havoc main_~node6____CPAchecker_TMP_0~3#1;havoc main_~node6__m6~35#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L619: havoc main_~node2__m2~2#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4583: havoc main_~node6__m6~29#1; [2025-03-08 06:28:14,554 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6433: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-03-08 06:28:14,555 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L884: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-08 06:28:14,555 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2206: havoc main_~node5__m5~6#1; [2025-03-08 06:28:14,555 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10267: havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~101#1; [2025-03-08 06:28:14,555 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2075: havoc main_~check__tmp~16#1;havoc main_~node6__m6~9#1; [2025-03-08 06:28:14,555 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9342: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~29#1; [2025-03-08 06:28:14,555 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7889: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-03-08 06:28:14,555 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3794: havoc main_~node4__m4~7#1; [2025-03-08 06:28:14,555 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9741: havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~95#1; [2025-03-08 06:28:14,555 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5777: havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~51#1; [2025-03-08 06:28:14,556 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L360: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-08 06:28:14,556 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5646: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~50#1; [2025-03-08 06:28:14,556 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7628: havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~72#1; [2025-03-08 06:28:14,556 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1154: havoc main_~node6__m6~3#1; [2025-03-08 06:28:14,556 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3269: havoc main_~node5__m5~10#1; [2025-03-08 06:28:14,556 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1024: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:28:14,556 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9084: havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~88#1; [2025-03-08 06:28:14,556 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2743: havoc main_~node4__m4~5#1; [2025-03-08 06:28:14,779 INFO L? ?]: Removed 1001 outVars from TransFormulas that were not future-live. [2025-03-08 06:28:14,780 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:28:14,807 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:28:14,807 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:28:14,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:28:14 BoogieIcfgContainer [2025-03-08 06:28:14,808 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:28:14,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:28:14,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:28:14,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:28:14,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:28:09" (1/3) ... [2025-03-08 06:28:14,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6249f36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:28:14, skipping insertion in model container [2025-03-08 06:28:14,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:11" (2/3) ... [2025-03-08 06:28:14,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6249f36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:28:14, skipping insertion in model container [2025-03-08 06:28:14,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:28:14" (3/3) ... [2025-03-08 06:28:14,814 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-08 06:28:14,824 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:28:14,827 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 1124 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-03-08 06:28:14,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:28:14,891 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;@701aaa06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:28:14,892 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-08 06:28:14,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 1124 states, 1101 states have (on average 1.8601271571298819) internal successors, (2048), 1123 states have internal predecessors, (2048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:14,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 06:28:14,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:14,912 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-03-08 06:28:14,912 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:14,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:14,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1724596686, now seen corresponding path program 1 times [2025-03-08 06:28:14,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:14,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517708866] [2025-03-08 06:28:14,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:14,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:15,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 06:28:15,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 06:28:15,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:15,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:15,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:15,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517708866] [2025-03-08 06:28:15,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517708866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:15,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:15,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:28:15,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118306856] [2025-03-08 06:28:15,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:15,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:28:15,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:15,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:28:15,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:28:15,476 INFO L87 Difference]: Start difference. First operand has 1124 states, 1101 states have (on average 1.8601271571298819) internal successors, (2048), 1123 states have internal predecessors, (2048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 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-03-08 06:28:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:16,106 INFO L93 Difference]: Finished difference Result 1702 states and 2998 transitions. [2025-03-08 06:28:16,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:28:16,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 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-03-08 06:28:16,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:16,123 INFO L225 Difference]: With dead ends: 1702 [2025-03-08 06:28:16,126 INFO L226 Difference]: Without dead ends: 868 [2025-03-08 06:28:16,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:28:16,133 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 4494 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4494 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:16,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4494 Valid, 1041 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:28:16,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-03-08 06:28:16,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2025-03-08 06:28:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 846 states have (on average 1.3215130023640662) internal successors, (1118), 867 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1118 transitions. [2025-03-08 06:28:16,214 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1118 transitions. Word has length 85 [2025-03-08 06:28:16,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:16,214 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1118 transitions. [2025-03-08 06:28:16,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 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-03-08 06:28:16,214 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1118 transitions. [2025-03-08 06:28:16,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 06:28:16,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:16,218 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] [2025-03-08 06:28:16,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:28:16,218 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:16,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:16,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1501353251, now seen corresponding path program 1 times [2025-03-08 06:28:16,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:16,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918104853] [2025-03-08 06:28:16,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:16,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:16,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 06:28:16,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 06:28:16,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:16,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:16,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:16,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918104853] [2025-03-08 06:28:16,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918104853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:16,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:16,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:28:16,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835812836] [2025-03-08 06:28:16,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:16,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:28:16,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:16,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:28:16,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:28:16,517 INFO L87 Difference]: Start difference. First operand 868 states and 1118 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:16,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:16,932 INFO L93 Difference]: Finished difference Result 1437 states and 1906 transitions. [2025-03-08 06:28:16,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:28:16,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-08 06:28:16,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:16,935 INFO L225 Difference]: With dead ends: 1437 [2025-03-08 06:28:16,935 INFO L226 Difference]: Without dead ends: 752 [2025-03-08 06:28:16,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:28:16,936 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 2863 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2863 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:16,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2863 Valid, 576 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:28:16,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-03-08 06:28:17,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2025-03-08 06:28:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 730 states have (on average 1.3493150684931507) internal successors, (985), 751 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 985 transitions. [2025-03-08 06:28:17,007 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 985 transitions. Word has length 86 [2025-03-08 06:28:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:17,008 INFO L471 AbstractCegarLoop]: Abstraction has 752 states and 985 transitions. [2025-03-08 06:28:17,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:17,008 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 985 transitions. [2025-03-08 06:28:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 06:28:17,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:17,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] [2025-03-08 06:28:17,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:28:17,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:17,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:17,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1440213798, now seen corresponding path program 1 times [2025-03-08 06:28:17,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:17,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067804274] [2025-03-08 06:28:17,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:17,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:17,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 06:28:17,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 06:28:17,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:17,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:17,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:17,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067804274] [2025-03-08 06:28:17,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067804274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:17,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:17,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:28:17,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588496499] [2025-03-08 06:28:17,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:17,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:28:17,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:17,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:28:17,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:28:17,210 INFO L87 Difference]: Start difference. First operand 752 states and 985 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:17,563 INFO L93 Difference]: Finished difference Result 1321 states and 1772 transitions. [2025-03-08 06:28:17,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:28:17,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-08 06:28:17,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:17,566 INFO L225 Difference]: With dead ends: 1321 [2025-03-08 06:28:17,566 INFO L226 Difference]: Without dead ends: 685 [2025-03-08 06:28:17,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:28:17,569 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 2661 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2661 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:17,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2661 Valid, 529 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:28:17,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-08 06:28:17,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2025-03-08 06:28:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 663 states have (on average 1.3710407239819005) internal successors, (909), 684 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:17,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 909 transitions. [2025-03-08 06:28:17,581 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 909 transitions. Word has length 87 [2025-03-08 06:28:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:17,581 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 909 transitions. [2025-03-08 06:28:17,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:17,582 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 909 transitions. [2025-03-08 06:28:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:28:17,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:17,586 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-03-08 06:28:17,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:28:17,587 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:17,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:17,588 INFO L85 PathProgramCache]: Analyzing trace with hash -57834149, now seen corresponding path program 1 times [2025-03-08 06:28:17,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:17,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441119184] [2025-03-08 06:28:17,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:17,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:17,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:28:17,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:28:17,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:17,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:17,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-03-08 06:28:17,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:17,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441119184] [2025-03-08 06:28:17,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441119184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:17,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:17,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:28:17,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182470652] [2025-03-08 06:28:17,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:17,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:28:17,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:17,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:28:17,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:28:17,731 INFO L87 Difference]: Start difference. First operand 685 states and 909 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 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-03-08 06:28:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:18,159 INFO L93 Difference]: Finished difference Result 1254 states and 1695 transitions. [2025-03-08 06:28:18,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:28:18,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 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-03-08 06:28:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:18,162 INFO L225 Difference]: With dead ends: 1254 [2025-03-08 06:28:18,162 INFO L226 Difference]: Without dead ends: 665 [2025-03-08 06:28:18,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:28:18,163 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 2514 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2514 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:18,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2514 Valid, 441 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:28:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-08 06:28:18,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2025-03-08 06:28:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 643 states have (on average 1.374805598755832) internal successors, (884), 664 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 884 transitions. [2025-03-08 06:28:18,173 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 884 transitions. Word has length 88 [2025-03-08 06:28:18,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:18,174 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 884 transitions. [2025-03-08 06:28:18,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 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-03-08 06:28:18,174 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 884 transitions. [2025-03-08 06:28:18,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:28:18,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:18,175 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-03-08 06:28:18,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:28:18,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:18,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:18,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1874569866, now seen corresponding path program 1 times [2025-03-08 06:28:18,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:18,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102385386] [2025-03-08 06:28:18,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:18,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:18,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:28:18,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:28:18,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:18,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:18,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:18,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102385386] [2025-03-08 06:28:18,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102385386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:18,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:18,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:28:18,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116288463] [2025-03-08 06:28:18,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:18,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:28:18,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:18,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:28:18,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:28:18,282 INFO L87 Difference]: Start difference. First operand 665 states and 884 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:18,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:18,600 INFO L93 Difference]: Finished difference Result 1234 states and 1669 transitions. [2025-03-08 06:28:18,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:28:18,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-08 06:28:18,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:18,602 INFO L225 Difference]: With dead ends: 1234 [2025-03-08 06:28:18,603 INFO L226 Difference]: Without dead ends: 643 [2025-03-08 06:28:18,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:28:18,604 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 2498 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2498 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:18,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2498 Valid, 497 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:28:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-03-08 06:28:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2025-03-08 06:28:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 621 states have (on average 1.3832528180354267) internal successors, (859), 642 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 859 transitions. [2025-03-08 06:28:18,613 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 859 transitions. Word has length 89 [2025-03-08 06:28:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:18,613 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 859 transitions. [2025-03-08 06:28:18,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 859 transitions. [2025-03-08 06:28:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 06:28:18,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:18,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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:18,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:28:18,614 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:18,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:18,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1656285291, now seen corresponding path program 1 times [2025-03-08 06:28:18,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:18,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843704190] [2025-03-08 06:28:18,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:18,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:18,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:28:18,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:28:18,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:18,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:18,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:18,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843704190] [2025-03-08 06:28:18,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843704190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:18,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:18,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:28:18,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879313688] [2025-03-08 06:28:18,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:18,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:28:18,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:18,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:28:18,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:28:18,712 INFO L87 Difference]: Start difference. First operand 643 states and 859 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 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-03-08 06:28:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:19,093 INFO L93 Difference]: Finished difference Result 1212 states and 1643 transitions. [2025-03-08 06:28:19,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:28:19,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 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-03-08 06:28:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:19,096 INFO L225 Difference]: With dead ends: 1212 [2025-03-08 06:28:19,096 INFO L226 Difference]: Without dead ends: 635 [2025-03-08 06:28:19,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:28:19,097 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 2434 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2434 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:19,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2434 Valid, 471 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:28:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-03-08 06:28:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2025-03-08 06:28:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3849918433931485) internal successors, (849), 634 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 849 transitions. [2025-03-08 06:28:19,107 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 849 transitions. Word has length 90 [2025-03-08 06:28:19,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:19,107 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 849 transitions. [2025-03-08 06:28:19,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 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-03-08 06:28:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 849 transitions. [2025-03-08 06:28:19,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 06:28:19,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:19,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:19,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:28:19,109 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:19,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:19,109 INFO L85 PathProgramCache]: Analyzing trace with hash 12000547, now seen corresponding path program 1 times [2025-03-08 06:28:19,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:19,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939583953] [2025-03-08 06:28:19,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:19,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:19,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 06:28:19,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 06:28:19,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:19,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:19,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:19,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939583953] [2025-03-08 06:28:19,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939583953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:19,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:19,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:28:19,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371989455] [2025-03-08 06:28:19,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:19,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:28:19,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:19,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:28:19,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:28:19,451 INFO L87 Difference]: Start difference. First operand 635 states and 849 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:20,306 INFO L93 Difference]: Finished difference Result 1197 states and 1558 transitions. [2025-03-08 06:28:20,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:28:20,306 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-08 06:28:20,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:20,309 INFO L225 Difference]: With dead ends: 1197 [2025-03-08 06:28:20,309 INFO L226 Difference]: Without dead ends: 852 [2025-03-08 06:28:20,310 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-03-08 06:28:20,310 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 3440 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 1730 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3440 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:20,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3440 Valid, 1728 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1730 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:28:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-03-08 06:28:20,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 635. [2025-03-08 06:28:20,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3833605220228384) internal successors, (848), 634 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 848 transitions. [2025-03-08 06:28:20,322 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 848 transitions. Word has length 91 [2025-03-08 06:28:20,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:20,322 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 848 transitions. [2025-03-08 06:28:20,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 848 transitions. [2025-03-08 06:28:20,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 06:28:20,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:20,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:20,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:28:20,324 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:20,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:20,324 INFO L85 PathProgramCache]: Analyzing trace with hash -341180013, now seen corresponding path program 1 times [2025-03-08 06:28:20,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:20,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071783566] [2025-03-08 06:28:20,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:20,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:20,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 06:28:20,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 06:28:20,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:20,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:20,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:20,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071783566] [2025-03-08 06:28:20,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071783566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:20,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:20,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:28:20,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750381571] [2025-03-08 06:28:20,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:20,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:28:20,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:20,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:28:20,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:28:20,745 INFO L87 Difference]: Start difference. First operand 635 states and 848 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:21,874 INFO L93 Difference]: Finished difference Result 1068 states and 1414 transitions. [2025-03-08 06:28:21,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:28:21,875 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-08 06:28:21,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:21,878 INFO L225 Difference]: With dead ends: 1068 [2025-03-08 06:28:21,878 INFO L226 Difference]: Without dead ends: 989 [2025-03-08 06:28:21,878 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-03-08 06:28:21,878 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 3295 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3295 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:21,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3295 Valid, 2352 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:28:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-03-08 06:28:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 654. [2025-03-08 06:28:21,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 632 states have (on average 1.3860759493670887) internal successors, (876), 653 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 876 transitions. [2025-03-08 06:28:21,888 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 876 transitions. Word has length 91 [2025-03-08 06:28:21,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:21,888 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 876 transitions. [2025-03-08 06:28:21,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 876 transitions. [2025-03-08 06:28:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 06:28:21,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:21,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:21,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:28:21,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:21,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:21,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1892836241, now seen corresponding path program 1 times [2025-03-08 06:28:21,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:21,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032834013] [2025-03-08 06:28:21,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:21,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:21,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 06:28:21,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 06:28:21,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:21,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:22,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:22,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:22,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032834013] [2025-03-08 06:28:22,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032834013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:22,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:22,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:22,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525969167] [2025-03-08 06:28:22,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:22,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:22,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:22,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:22,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:22,195 INFO L87 Difference]: Start difference. First operand 654 states and 876 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:23,416 INFO L93 Difference]: Finished difference Result 1175 states and 1587 transitions. [2025-03-08 06:28:23,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:23,417 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-08 06:28:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:23,419 INFO L225 Difference]: With dead ends: 1175 [2025-03-08 06:28:23,419 INFO L226 Difference]: Without dead ends: 983 [2025-03-08 06:28:23,420 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-03-08 06:28:23,420 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 3434 mSDsluCounter, 2905 mSDsCounter, 0 mSdLazyCounter, 2846 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3434 SdHoareTripleChecker+Valid, 3635 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:23,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3434 Valid, 3635 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2846 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:28:23,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2025-03-08 06:28:23,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 635. [2025-03-08 06:28:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3817292006525286) internal successors, (847), 634 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 847 transitions. [2025-03-08 06:28:23,429 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 847 transitions. Word has length 91 [2025-03-08 06:28:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:23,429 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 847 transitions. [2025-03-08 06:28:23,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 847 transitions. [2025-03-08 06:28:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 06:28:23,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:23,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:23,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:28:23,431 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:23,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:23,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1964456371, now seen corresponding path program 1 times [2025-03-08 06:28:23,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:23,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038327250] [2025-03-08 06:28:23,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:23,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:23,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 06:28:23,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 06:28:23,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:23,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:23,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-03-08 06:28:23,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:23,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038327250] [2025-03-08 06:28:23,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038327250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:23,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:23,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:23,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618010736] [2025-03-08 06:28:23,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:23,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:23,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:23,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:23,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:23,645 INFO L87 Difference]: Start difference. First operand 635 states and 847 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:24,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:24,417 INFO L93 Difference]: Finished difference Result 928 states and 1214 transitions. [2025-03-08 06:28:24,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:24,417 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-08 06:28:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:24,419 INFO L225 Difference]: With dead ends: 928 [2025-03-08 06:28:24,419 INFO L226 Difference]: Without dead ends: 923 [2025-03-08 06:28:24,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:28:24,420 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 2304 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2304 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:24,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2304 Valid, 1868 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-03-08 06:28:24,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 635. [2025-03-08 06:28:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3800978792822185) internal successors, (846), 634 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 846 transitions. [2025-03-08 06:28:24,428 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 846 transitions. Word has length 91 [2025-03-08 06:28:24,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:24,428 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 846 transitions. [2025-03-08 06:28:24,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:24,429 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 846 transitions. [2025-03-08 06:28:24,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 06:28:24,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:24,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:24,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:28:24,430 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:24,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:24,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1718490883, now seen corresponding path program 1 times [2025-03-08 06:28:24,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:24,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092440491] [2025-03-08 06:28:24,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:24,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:24,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 06:28:24,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 06:28:24,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:24,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:24,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:24,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092440491] [2025-03-08 06:28:24,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092440491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:24,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:24,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:24,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677539651] [2025-03-08 06:28:24,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:24,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:24,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:24,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:24,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:24,672 INFO L87 Difference]: Start difference. First operand 635 states and 846 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:25,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:25,679 INFO L93 Difference]: Finished difference Result 1205 states and 1613 transitions. [2025-03-08 06:28:25,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:25,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-08 06:28:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:25,682 INFO L225 Difference]: With dead ends: 1205 [2025-03-08 06:28:25,682 INFO L226 Difference]: Without dead ends: 983 [2025-03-08 06:28:25,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:28:25,683 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 2679 mSDsluCounter, 2475 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2679 SdHoareTripleChecker+Valid, 3152 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:25,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2679 Valid, 3152 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:28:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2025-03-08 06:28:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 635. [2025-03-08 06:28:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3784665579119086) internal successors, (845), 634 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:25,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 845 transitions. [2025-03-08 06:28:25,694 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 845 transitions. Word has length 93 [2025-03-08 06:28:25,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:25,695 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 845 transitions. [2025-03-08 06:28:25,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:25,695 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 845 transitions. [2025-03-08 06:28:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 06:28:25,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:25,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:25,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:28:25,697 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:25,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:25,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1476890763, now seen corresponding path program 1 times [2025-03-08 06:28:25,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:25,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680663075] [2025-03-08 06:28:25,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:25,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:25,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 06:28:25,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 06:28:25,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:25,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:25,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:25,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680663075] [2025-03-08 06:28:25,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680663075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:25,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:25,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:25,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465917619] [2025-03-08 06:28:25,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:25,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:25,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:25,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:25,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:25,982 INFO L87 Difference]: Start difference. First operand 635 states and 845 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:27,022 INFO L93 Difference]: Finished difference Result 1117 states and 1501 transitions. [2025-03-08 06:28:27,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:27,023 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-08 06:28:27,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:27,025 INFO L225 Difference]: With dead ends: 1117 [2025-03-08 06:28:27,025 INFO L226 Difference]: Without dead ends: 979 [2025-03-08 06:28:27,025 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-03-08 06:28:27,026 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 2584 mSDsluCounter, 2928 mSDsCounter, 0 mSdLazyCounter, 2788 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2584 SdHoareTripleChecker+Valid, 3660 SdHoareTripleChecker+Invalid, 2793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:27,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2584 Valid, 3660 Invalid, 2793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2788 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:28:27,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-03-08 06:28:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 635. [2025-03-08 06:28:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3768352365415988) internal successors, (844), 634 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 844 transitions. [2025-03-08 06:28:27,032 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 844 transitions. Word has length 93 [2025-03-08 06:28:27,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:27,033 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 844 transitions. [2025-03-08 06:28:27,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:27,033 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 844 transitions. [2025-03-08 06:28:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 06:28:27,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:27,034 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:27,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:28:27,034 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:27,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:27,034 INFO L85 PathProgramCache]: Analyzing trace with hash 907967258, now seen corresponding path program 1 times [2025-03-08 06:28:27,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:27,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387181600] [2025-03-08 06:28:27,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:27,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:27,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 06:28:27,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 06:28:27,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:27,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:27,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:27,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387181600] [2025-03-08 06:28:27,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387181600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:27,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:27,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:27,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188036834] [2025-03-08 06:28:27,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:27,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:27,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:27,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:27,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:27,245 INFO L87 Difference]: Start difference. First operand 635 states and 844 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:27,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:27,992 INFO L93 Difference]: Finished difference Result 1070 states and 1433 transitions. [2025-03-08 06:28:27,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:27,992 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-08 06:28:27,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:27,994 INFO L225 Difference]: With dead ends: 1070 [2025-03-08 06:28:27,994 INFO L226 Difference]: Without dead ends: 971 [2025-03-08 06:28:27,995 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-03-08 06:28:27,995 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 4503 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4503 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 1787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:27,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4503 Valid, 2237 Invalid, 1787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:27,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-03-08 06:28:28,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 635. [2025-03-08 06:28:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3752039151712887) internal successors, (843), 634 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 843 transitions. [2025-03-08 06:28:28,002 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 843 transitions. Word has length 93 [2025-03-08 06:28:28,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:28,002 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 843 transitions. [2025-03-08 06:28:28,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:28,003 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 843 transitions. [2025-03-08 06:28:28,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 06:28:28,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:28,004 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:28,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:28:28,004 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:28,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1687135955, now seen corresponding path program 1 times [2025-03-08 06:28:28,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:28,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865737215] [2025-03-08 06:28:28,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:28,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:28,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 06:28:28,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 06:28:28,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:28,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:28,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:28,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865737215] [2025-03-08 06:28:28,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865737215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:28,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:28,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:28:28,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834356248] [2025-03-08 06:28:28,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:28,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:28:28,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:28,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:28:28,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:28:28,378 INFO L87 Difference]: Start difference. First operand 635 states and 843 transitions. Second operand has 12 states, 12 states have (on average 7.75) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:29,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:29,949 INFO L93 Difference]: Finished difference Result 1419 states and 1948 transitions. [2025-03-08 06:28:29,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:28:29,949 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-08 06:28:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:29,952 INFO L225 Difference]: With dead ends: 1419 [2025-03-08 06:28:29,952 INFO L226 Difference]: Without dead ends: 1281 [2025-03-08 06:28:29,952 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-03-08 06:28:29,953 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 5792 mSDsluCounter, 3848 mSDsCounter, 0 mSdLazyCounter, 3954 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5792 SdHoareTripleChecker+Valid, 4685 SdHoareTripleChecker+Invalid, 4150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 3954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:29,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5792 Valid, 4685 Invalid, 4150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 3954 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 06:28:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2025-03-08 06:28:29,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 639. [2025-03-08 06:28:29,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.372771474878444) internal successors, (847), 638 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 847 transitions. [2025-03-08 06:28:29,960 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 847 transitions. Word has length 93 [2025-03-08 06:28:29,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:29,960 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 847 transitions. [2025-03-08 06:28:29,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 847 transitions. [2025-03-08 06:28:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 06:28:29,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:29,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:29,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:28:29,961 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:29,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:29,962 INFO L85 PathProgramCache]: Analyzing trace with hash -942738592, now seen corresponding path program 1 times [2025-03-08 06:28:29,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:29,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707260413] [2025-03-08 06:28:29,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:29,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:29,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 06:28:30,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 06:28:30,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:30,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:30,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:30,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707260413] [2025-03-08 06:28:30,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707260413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:30,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:30,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:30,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222777485] [2025-03-08 06:28:30,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:30,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:30,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:30,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:30,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:30,146 INFO L87 Difference]: Start difference. First operand 639 states and 847 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:30,904 INFO L93 Difference]: Finished difference Result 1006 states and 1324 transitions. [2025-03-08 06:28:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:30,905 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-08 06:28:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:30,907 INFO L225 Difference]: With dead ends: 1006 [2025-03-08 06:28:30,907 INFO L226 Difference]: Without dead ends: 927 [2025-03-08 06:28:30,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:28:30,908 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 3454 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3454 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:30,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3454 Valid, 1868 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:30,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-08 06:28:30,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 639. [2025-03-08 06:28:30,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.3711507293354943) internal successors, (846), 638 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 846 transitions. [2025-03-08 06:28:30,914 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 846 transitions. Word has length 93 [2025-03-08 06:28:30,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:30,914 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 846 transitions. [2025-03-08 06:28:30,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 846 transitions. [2025-03-08 06:28:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 06:28:30,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:30,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:30,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:28:30,915 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:30,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:30,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1141126354, now seen corresponding path program 1 times [2025-03-08 06:28:30,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:30,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895875613] [2025-03-08 06:28:30,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:30,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:30,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 06:28:30,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 06:28:30,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:30,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:31,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:31,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895875613] [2025-03-08 06:28:31,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895875613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:31,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:31,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:31,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704940769] [2025-03-08 06:28:31,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:31,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:31,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:31,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:31,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:31,109 INFO L87 Difference]: Start difference. First operand 639 states and 846 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:31,981 INFO L93 Difference]: Finished difference Result 1102 states and 1483 transitions. [2025-03-08 06:28:31,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:31,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-08 06:28:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:31,984 INFO L225 Difference]: With dead ends: 1102 [2025-03-08 06:28:31,984 INFO L226 Difference]: Without dead ends: 979 [2025-03-08 06:28:31,984 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-03-08 06:28:31,985 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 3544 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 2062 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3544 SdHoareTripleChecker+Valid, 2719 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:31,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3544 Valid, 2719 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2062 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:28:31,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-03-08 06:28:31,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 639. [2025-03-08 06:28:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.3695299837925445) internal successors, (845), 638 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 845 transitions. [2025-03-08 06:28:31,991 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 845 transitions. Word has length 93 [2025-03-08 06:28:31,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:31,991 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 845 transitions. [2025-03-08 06:28:31,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:31,991 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 845 transitions. [2025-03-08 06:28:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 06:28:31,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:31,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:31,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:28:31,993 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:31,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:31,993 INFO L85 PathProgramCache]: Analyzing trace with hash -532582359, now seen corresponding path program 1 times [2025-03-08 06:28:31,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:31,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339770598] [2025-03-08 06:28:31,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:31,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:32,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 06:28:32,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 06:28:32,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:32,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:32,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:32,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339770598] [2025-03-08 06:28:32,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339770598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:32,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:32,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:32,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700252058] [2025-03-08 06:28:32,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:32,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:32,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:32,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:32,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:32,185 INFO L87 Difference]: Start difference. First operand 639 states and 845 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:32,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:32,855 INFO L93 Difference]: Finished difference Result 1003 states and 1318 transitions. [2025-03-08 06:28:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:32,856 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-08 06:28:32,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:32,858 INFO L225 Difference]: With dead ends: 1003 [2025-03-08 06:28:32,858 INFO L226 Difference]: Without dead ends: 927 [2025-03-08 06:28:32,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:28:32,859 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 3446 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3446 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:32,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3446 Valid, 1868 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:28:32,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-08 06:28:32,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 639. [2025-03-08 06:28:32,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.3679092382495948) internal successors, (844), 638 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 844 transitions. [2025-03-08 06:28:32,866 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 844 transitions. Word has length 93 [2025-03-08 06:28:32,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:32,866 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 844 transitions. [2025-03-08 06:28:32,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 844 transitions. [2025-03-08 06:28:32,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:28:32,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:32,868 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] [2025-03-08 06:28:32,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:28:32,868 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:32,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:32,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1775103932, now seen corresponding path program 1 times [2025-03-08 06:28:32,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:32,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171805913] [2025-03-08 06:28:32,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:32,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:32,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:28:32,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:28:32,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:32,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:33,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:33,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171805913] [2025-03-08 06:28:33,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171805913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:33,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:33,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:33,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203377456] [2025-03-08 06:28:33,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:33,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:33,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:33,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:33,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:33,034 INFO L87 Difference]: Start difference. First operand 639 states and 844 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:33,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:33,640 INFO L93 Difference]: Finished difference Result 1006 states and 1319 transitions. [2025-03-08 06:28:33,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:33,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:28:33,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:33,643 INFO L225 Difference]: With dead ends: 1006 [2025-03-08 06:28:33,643 INFO L226 Difference]: Without dead ends: 927 [2025-03-08 06:28:33,643 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-03-08 06:28:33,643 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 3440 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3440 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 1584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:33,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3440 Valid, 1871 Invalid, 1584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:28:33,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-08 06:28:33,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 639. [2025-03-08 06:28:33,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.366288492706645) internal successors, (843), 638 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 843 transitions. [2025-03-08 06:28:33,648 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 843 transitions. Word has length 94 [2025-03-08 06:28:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:33,648 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 843 transitions. [2025-03-08 06:28:33,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 843 transitions. [2025-03-08 06:28:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:28:33,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:33,649 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] [2025-03-08 06:28:33,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:28:33,650 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:33,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:33,650 INFO L85 PathProgramCache]: Analyzing trace with hash -285847110, now seen corresponding path program 1 times [2025-03-08 06:28:33,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:33,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067513882] [2025-03-08 06:28:33,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:33,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:33,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:28:33,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:28:33,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:33,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:33,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:33,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067513882] [2025-03-08 06:28:33,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067513882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:33,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:33,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:33,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253220205] [2025-03-08 06:28:33,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:33,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:33,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:33,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:33,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:33,820 INFO L87 Difference]: Start difference. First operand 639 states and 843 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:34,685 INFO L93 Difference]: Finished difference Result 1117 states and 1494 transitions. [2025-03-08 06:28:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:34,685 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:28:34,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:34,687 INFO L225 Difference]: With dead ends: 1117 [2025-03-08 06:28:34,687 INFO L226 Difference]: Without dead ends: 979 [2025-03-08 06:28:34,688 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-03-08 06:28:34,688 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 3038 mSDsluCounter, 2356 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3038 SdHoareTripleChecker+Valid, 3080 SdHoareTripleChecker+Invalid, 2398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:34,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3038 Valid, 3080 Invalid, 2398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:28:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-03-08 06:28:34,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 635. [2025-03-08 06:28:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.367047308319739) internal successors, (838), 634 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:34,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 838 transitions. [2025-03-08 06:28:34,693 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 838 transitions. Word has length 94 [2025-03-08 06:28:34,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:34,693 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 838 transitions. [2025-03-08 06:28:34,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:34,694 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 838 transitions. [2025-03-08 06:28:34,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:28:34,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:34,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:34,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:28:34,694 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:34,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:34,695 INFO L85 PathProgramCache]: Analyzing trace with hash -695822173, now seen corresponding path program 1 times [2025-03-08 06:28:34,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:34,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845544410] [2025-03-08 06:28:34,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:34,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:34,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:28:34,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:28:34,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:34,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:34,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:34,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845544410] [2025-03-08 06:28:34,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845544410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:34,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:34,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:34,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647342549] [2025-03-08 06:28:34,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:34,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:34,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:34,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:34,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:34,878 INFO L87 Difference]: Start difference. First operand 635 states and 838 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:35,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:35,713 INFO L93 Difference]: Finished difference Result 1132 states and 1507 transitions. [2025-03-08 06:28:35,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:35,716 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:28:35,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:35,718 INFO L225 Difference]: With dead ends: 1132 [2025-03-08 06:28:35,718 INFO L226 Difference]: Without dead ends: 979 [2025-03-08 06:28:35,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:28:35,719 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 2562 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2562 SdHoareTripleChecker+Valid, 3372 SdHoareTripleChecker+Invalid, 2559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:35,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2562 Valid, 3372 Invalid, 2559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:35,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-03-08 06:28:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 635. [2025-03-08 06:28:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3654159869494291) internal successors, (837), 634 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 837 transitions. [2025-03-08 06:28:35,725 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 837 transitions. Word has length 95 [2025-03-08 06:28:35,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:35,725 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 837 transitions. [2025-03-08 06:28:35,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 837 transitions. [2025-03-08 06:28:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:28:35,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:35,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:35,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:28:35,726 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:35,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:35,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1115715990, now seen corresponding path program 1 times [2025-03-08 06:28:35,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:35,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581491209] [2025-03-08 06:28:35,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:35,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:35,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:28:35,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:28:35,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:35,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:35,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:35,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581491209] [2025-03-08 06:28:35,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581491209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:35,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:35,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:35,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251721385] [2025-03-08 06:28:35,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:35,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:35,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:35,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:35,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:35,937 INFO L87 Difference]: Start difference. First operand 635 states and 837 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:36,692 INFO L93 Difference]: Finished difference Result 1079 states and 1434 transitions. [2025-03-08 06:28:36,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:36,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:28:36,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:36,695 INFO L225 Difference]: With dead ends: 1079 [2025-03-08 06:28:36,695 INFO L226 Difference]: Without dead ends: 971 [2025-03-08 06:28:36,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:28:36,696 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 3721 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 2163 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3721 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 2170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:36,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3721 Valid, 2817 Invalid, 2170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2163 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:36,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-03-08 06:28:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 635. [2025-03-08 06:28:36,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.363784665579119) internal successors, (836), 634 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:36,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 836 transitions. [2025-03-08 06:28:36,701 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 836 transitions. Word has length 95 [2025-03-08 06:28:36,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:36,701 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 836 transitions. [2025-03-08 06:28:36,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 836 transitions. [2025-03-08 06:28:36,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:28:36,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:36,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:36,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:28:36,703 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:36,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:36,703 INFO L85 PathProgramCache]: Analyzing trace with hash -889294793, now seen corresponding path program 1 times [2025-03-08 06:28:36,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:36,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029686124] [2025-03-08 06:28:36,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:36,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:36,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:28:36,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:28:36,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:36,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:36,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:36,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029686124] [2025-03-08 06:28:36,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029686124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:36,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:36,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:36,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883761615] [2025-03-08 06:28:36,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:36,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:36,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:36,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:36,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:36,882 INFO L87 Difference]: Start difference. First operand 635 states and 836 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:37,637 INFO L93 Difference]: Finished difference Result 1041 states and 1376 transitions. [2025-03-08 06:28:37,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:37,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:28:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:37,640 INFO L225 Difference]: With dead ends: 1041 [2025-03-08 06:28:37,640 INFO L226 Difference]: Without dead ends: 955 [2025-03-08 06:28:37,641 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-03-08 06:28:37,642 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 3756 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2663 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:37,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2663 Invalid, 2077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:37,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-08 06:28:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 635. [2025-03-08 06:28:37,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3621533442088092) internal successors, (835), 634 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 835 transitions. [2025-03-08 06:28:37,648 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 835 transitions. Word has length 95 [2025-03-08 06:28:37,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:37,648 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 835 transitions. [2025-03-08 06:28:37,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 835 transitions. [2025-03-08 06:28:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:28:37,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:37,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:37,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:28:37,649 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:37,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:37,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1387300122, now seen corresponding path program 1 times [2025-03-08 06:28:37,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:37,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584261252] [2025-03-08 06:28:37,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:37,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:37,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:28:37,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:28:37,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:37,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:37,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:37,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584261252] [2025-03-08 06:28:37,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584261252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:37,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:37,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:37,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360427210] [2025-03-08 06:28:37,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:37,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:37,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:37,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:37,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:37,814 INFO L87 Difference]: Start difference. First operand 635 states and 835 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:38,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:38,531 INFO L93 Difference]: Finished difference Result 1041 states and 1374 transitions. [2025-03-08 06:28:38,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:38,531 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:28:38,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:38,534 INFO L225 Difference]: With dead ends: 1041 [2025-03-08 06:28:38,534 INFO L226 Difference]: Without dead ends: 955 [2025-03-08 06:28:38,534 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-03-08 06:28:38,534 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 3265 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3265 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:38,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3265 Valid, 2155 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1722 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:38,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-08 06:28:38,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 635. [2025-03-08 06:28:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.360522022838499) internal successors, (834), 634 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 834 transitions. [2025-03-08 06:28:38,539 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 834 transitions. Word has length 95 [2025-03-08 06:28:38,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:38,539 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 834 transitions. [2025-03-08 06:28:38,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:38,540 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 834 transitions. [2025-03-08 06:28:38,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:28:38,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:38,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:38,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:28:38,540 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:38,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:38,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1556373199, now seen corresponding path program 1 times [2025-03-08 06:28:38,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:38,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063218759] [2025-03-08 06:28:38,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:38,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:38,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:28:38,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:28:38,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:38,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:38,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:38,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063218759] [2025-03-08 06:28:38,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063218759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:38,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:38,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:38,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926103965] [2025-03-08 06:28:38,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:38,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:38,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:38,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:38,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:38,840 INFO L87 Difference]: Start difference. First operand 635 states and 834 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:39,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:39,632 INFO L93 Difference]: Finished difference Result 1037 states and 1369 transitions. [2025-03-08 06:28:39,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:39,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:28:39,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:39,635 INFO L225 Difference]: With dead ends: 1037 [2025-03-08 06:28:39,635 INFO L226 Difference]: Without dead ends: 955 [2025-03-08 06:28:39,635 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-03-08 06:28:39,636 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 3749 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3749 SdHoareTripleChecker+Valid, 2663 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:39,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3749 Valid, 2663 Invalid, 2062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2055 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:39,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-08 06:28:39,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 635. [2025-03-08 06:28:39,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3588907014681892) internal successors, (833), 634 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 833 transitions. [2025-03-08 06:28:39,641 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 833 transitions. Word has length 95 [2025-03-08 06:28:39,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:39,641 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 833 transitions. [2025-03-08 06:28:39,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 833 transitions. [2025-03-08 06:28:39,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:28:39,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:39,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:39,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:28:39,642 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:39,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:39,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1365389515, now seen corresponding path program 1 times [2025-03-08 06:28:39,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:39,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335589665] [2025-03-08 06:28:39,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:39,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:39,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:28:39,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:28:39,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:39,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:39,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:39,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335589665] [2025-03-08 06:28:39,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335589665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:39,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:39,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:39,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066969436] [2025-03-08 06:28:39,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:39,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:39,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:39,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:39,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:39,789 INFO L87 Difference]: Start difference. First operand 635 states and 833 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:40,565 INFO L93 Difference]: Finished difference Result 1079 states and 1428 transitions. [2025-03-08 06:28:40,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:40,565 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:28:40,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:40,567 INFO L225 Difference]: With dead ends: 1079 [2025-03-08 06:28:40,567 INFO L226 Difference]: Without dead ends: 971 [2025-03-08 06:28:40,568 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-03-08 06:28:40,568 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 2185 mSDsluCounter, 2283 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2185 SdHoareTripleChecker+Valid, 2988 SdHoareTripleChecker+Invalid, 2348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:40,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2185 Valid, 2988 Invalid, 2348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2343 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:40,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-03-08 06:28:40,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 635. [2025-03-08 06:28:40,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3572593800978794) internal successors, (832), 634 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 832 transitions. [2025-03-08 06:28:40,573 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 832 transitions. Word has length 95 [2025-03-08 06:28:40,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:40,573 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 832 transitions. [2025-03-08 06:28:40,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:40,573 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 832 transitions. [2025-03-08 06:28:40,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:28:40,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:40,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:40,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:28:40,574 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:40,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:40,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1591810712, now seen corresponding path program 1 times [2025-03-08 06:28:40,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:40,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971521661] [2025-03-08 06:28:40,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:40,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:40,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:28:40,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:28:40,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:40,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:40,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:40,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:40,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971521661] [2025-03-08 06:28:40,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971521661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:40,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:40,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:40,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532562549] [2025-03-08 06:28:40,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:40,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:40,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:40,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:40,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:40,766 INFO L87 Difference]: Start difference. First operand 635 states and 832 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:41,484 INFO L93 Difference]: Finished difference Result 1041 states and 1370 transitions. [2025-03-08 06:28:41,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:41,485 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:28:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:41,487 INFO L225 Difference]: With dead ends: 1041 [2025-03-08 06:28:41,487 INFO L226 Difference]: Without dead ends: 955 [2025-03-08 06:28:41,487 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-03-08 06:28:41,490 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 2891 mSDsluCounter, 1986 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2891 SdHoareTripleChecker+Valid, 2517 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:41,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2891 Valid, 2517 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1932 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:41,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-08 06:28:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 635. [2025-03-08 06:28:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3556280587275693) internal successors, (831), 634 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 831 transitions. [2025-03-08 06:28:41,520 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 831 transitions. Word has length 95 [2025-03-08 06:28:41,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:41,521 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 831 transitions. [2025-03-08 06:28:41,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 831 transitions. [2025-03-08 06:28:41,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:28:41,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:41,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] [2025-03-08 06:28:41,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:28:41,522 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:41,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:41,522 INFO L85 PathProgramCache]: Analyzing trace with hash 953568433, now seen corresponding path program 1 times [2025-03-08 06:28:41,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:41,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114156123] [2025-03-08 06:28:41,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:41,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:41,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:28:41,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:28:41,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:41,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:41,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:41,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114156123] [2025-03-08 06:28:41,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114156123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:41,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:41,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:41,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991438383] [2025-03-08 06:28:41,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:41,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:41,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:41,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:41,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:41,690 INFO L87 Difference]: Start difference. First operand 635 states and 831 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:42,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:42,508 INFO L93 Difference]: Finished difference Result 1079 states and 1425 transitions. [2025-03-08 06:28:42,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:42,508 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:28:42,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:42,510 INFO L225 Difference]: With dead ends: 1079 [2025-03-08 06:28:42,510 INFO L226 Difference]: Without dead ends: 971 [2025-03-08 06:28:42,511 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-03-08 06:28:42,511 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 3365 mSDsluCounter, 2283 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3365 SdHoareTripleChecker+Valid, 2988 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:42,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3365 Valid, 2988 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-03-08 06:28:42,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 635. [2025-03-08 06:28:42,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3539967373572595) internal successors, (830), 634 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:42,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 830 transitions. [2025-03-08 06:28:42,516 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 830 transitions. Word has length 95 [2025-03-08 06:28:42,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:42,516 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 830 transitions. [2025-03-08 06:28:42,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:42,516 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 830 transitions. [2025-03-08 06:28:42,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:28:42,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:42,517 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:42,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:28:42,517 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:42,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:42,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1179989630, now seen corresponding path program 1 times [2025-03-08 06:28:42,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:42,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406844813] [2025-03-08 06:28:42,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:42,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:42,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:28:42,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:28:42,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:42,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:42,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406844813] [2025-03-08 06:28:42,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406844813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:42,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:42,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:42,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089169537] [2025-03-08 06:28:42,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:42,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:42,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:42,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:42,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:42,774 INFO L87 Difference]: Start difference. First operand 635 states and 830 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:43,565 INFO L93 Difference]: Finished difference Result 1041 states and 1369 transitions. [2025-03-08 06:28:43,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:43,565 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:28:43,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:43,567 INFO L225 Difference]: With dead ends: 1041 [2025-03-08 06:28:43,567 INFO L226 Difference]: Without dead ends: 955 [2025-03-08 06:28:43,567 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-03-08 06:28:43,568 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 3647 mSDsluCounter, 2307 mSDsCounter, 0 mSdLazyCounter, 2163 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3647 SdHoareTripleChecker+Valid, 2863 SdHoareTripleChecker+Invalid, 2170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:43,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3647 Valid, 2863 Invalid, 2170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2163 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:43,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-08 06:28:43,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 635. [2025-03-08 06:28:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3523654159869494) internal successors, (829), 634 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 829 transitions. [2025-03-08 06:28:43,574 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 829 transitions. Word has length 95 [2025-03-08 06:28:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:43,574 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 829 transitions. [2025-03-08 06:28:43,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 829 transitions. [2025-03-08 06:28:43,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:28:43,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:43,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:43,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:28:43,576 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:43,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1477283952, now seen corresponding path program 1 times [2025-03-08 06:28:43,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:43,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393278671] [2025-03-08 06:28:43,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:43,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:43,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:28:43,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:28:43,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:43,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:43,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:43,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393278671] [2025-03-08 06:28:43,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393278671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:43,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:43,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:43,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430027009] [2025-03-08 06:28:43,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:43,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:43,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:43,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:43,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:43,767 INFO L87 Difference]: Start difference. First operand 635 states and 829 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:44,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:44,494 INFO L93 Difference]: Finished difference Result 1070 states and 1413 transitions. [2025-03-08 06:28:44,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:44,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:28:44,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:44,496 INFO L225 Difference]: With dead ends: 1070 [2025-03-08 06:28:44,496 INFO L226 Difference]: Without dead ends: 971 [2025-03-08 06:28:44,497 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-03-08 06:28:44,497 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 3690 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 2111 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3690 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:44,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3690 Valid, 2817 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2111 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:44,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-03-08 06:28:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 635. [2025-03-08 06:28:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3507340946166395) internal successors, (828), 634 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 828 transitions. [2025-03-08 06:28:44,502 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 828 transitions. Word has length 95 [2025-03-08 06:28:44,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:44,504 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 828 transitions. [2025-03-08 06:28:44,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:44,505 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 828 transitions. [2025-03-08 06:28:44,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:28:44,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:44,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:28:44,505 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:44,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:44,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1144227437, now seen corresponding path program 1 times [2025-03-08 06:28:44,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:44,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795003781] [2025-03-08 06:28:44,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:44,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:44,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:28:44,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:28:44,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:44,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:44,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:44,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795003781] [2025-03-08 06:28:44,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795003781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:44,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:44,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:44,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901043638] [2025-03-08 06:28:44,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:44,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:44,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:44,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:44,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:44,691 INFO L87 Difference]: Start difference. First operand 635 states and 828 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:45,354 INFO L93 Difference]: Finished difference Result 1037 states and 1363 transitions. [2025-03-08 06:28:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:45,355 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:28:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:45,357 INFO L225 Difference]: With dead ends: 1037 [2025-03-08 06:28:45,357 INFO L226 Difference]: Without dead ends: 955 [2025-03-08 06:28:45,357 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-03-08 06:28:45,358 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 3566 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3566 SdHoareTripleChecker+Valid, 2452 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:45,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3566 Valid, 2452 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-08 06:28:45,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 635. [2025-03-08 06:28:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3491027732463294) internal successors, (827), 634 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 827 transitions. [2025-03-08 06:28:45,363 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 827 transitions. Word has length 95 [2025-03-08 06:28:45,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:45,363 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 827 transitions. [2025-03-08 06:28:45,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:45,364 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 827 transitions. [2025-03-08 06:28:45,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:28:45,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:45,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:45,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:28:45,365 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:45,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:45,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1345218222, now seen corresponding path program 1 times [2025-03-08 06:28:45,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:45,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740311424] [2025-03-08 06:28:45,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:45,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:45,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:28:45,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:28:45,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:45,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:45,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:45,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740311424] [2025-03-08 06:28:45,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740311424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:45,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:45,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:45,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211444860] [2025-03-08 06:28:45,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:45,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:45,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:45,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:45,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:45,558 INFO L87 Difference]: Start difference. First operand 635 states and 827 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:46,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:46,378 INFO L93 Difference]: Finished difference Result 1070 states and 1410 transitions. [2025-03-08 06:28:46,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:46,379 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:28:46,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:46,380 INFO L225 Difference]: With dead ends: 1070 [2025-03-08 06:28:46,380 INFO L226 Difference]: Without dead ends: 971 [2025-03-08 06:28:46,381 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-03-08 06:28:46,381 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 1724 mSDsluCounter, 2295 mSDsCounter, 0 mSdLazyCounter, 2299 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 3004 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:46,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 3004 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2299 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:46,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-03-08 06:28:46,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 635. [2025-03-08 06:28:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3474714518760196) internal successors, (826), 634 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 826 transitions. [2025-03-08 06:28:46,389 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 826 transitions. Word has length 95 [2025-03-08 06:28:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:46,390 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 826 transitions. [2025-03-08 06:28:46,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:46,390 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 826 transitions. [2025-03-08 06:28:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:28:46,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:46,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:28:46,391 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:46,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:46,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1012161707, now seen corresponding path program 1 times [2025-03-08 06:28:46,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:46,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168159925] [2025-03-08 06:28:46,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:46,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:46,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:28:46,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:28:46,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:46,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:46,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:46,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168159925] [2025-03-08 06:28:46,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168159925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:46,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:46,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:46,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852599783] [2025-03-08 06:28:46,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:46,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:46,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:46,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:46,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:46,550 INFO L87 Difference]: Start difference. First operand 635 states and 826 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:47,249 INFO L93 Difference]: Finished difference Result 1037 states and 1361 transitions. [2025-03-08 06:28:47,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:47,249 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:28:47,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:47,251 INFO L225 Difference]: With dead ends: 1037 [2025-03-08 06:28:47,251 INFO L226 Difference]: Without dead ends: 955 [2025-03-08 06:28:47,251 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-03-08 06:28:47,252 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 2762 mSDsluCounter, 2172 mSDsCounter, 0 mSdLazyCounter, 2084 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2762 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 2090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:47,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2762 Valid, 2765 Invalid, 2090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2084 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:47,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-08 06:28:47,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 635. [2025-03-08 06:28:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3458401305057097) internal successors, (825), 634 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 825 transitions. [2025-03-08 06:28:47,263 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 825 transitions. Word has length 95 [2025-03-08 06:28:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:47,263 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 825 transitions. [2025-03-08 06:28:47,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 825 transitions. [2025-03-08 06:28:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:28:47,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:47,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:47,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:28:47,264 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:47,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:47,265 INFO L85 PathProgramCache]: Analyzing trace with hash -157723063, now seen corresponding path program 1 times [2025-03-08 06:28:47,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:47,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559413654] [2025-03-08 06:28:47,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:47,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:47,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:28:47,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:28:47,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:47,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:47,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:47,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559413654] [2025-03-08 06:28:47,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559413654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:47,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:47,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:47,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795709842] [2025-03-08 06:28:47,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:47,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:47,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:47,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:47,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:47,446 INFO L87 Difference]: Start difference. First operand 635 states and 825 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:48,156 INFO L93 Difference]: Finished difference Result 1064 states and 1401 transitions. [2025-03-08 06:28:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:48,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:28:48,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:48,158 INFO L225 Difference]: With dead ends: 1064 [2025-03-08 06:28:48,158 INFO L226 Difference]: Without dead ends: 971 [2025-03-08 06:28:48,159 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-03-08 06:28:48,159 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 2740 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2740 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 2092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:48,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2740 Valid, 2817 Invalid, 2092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:48,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-03-08 06:28:48,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 635. [2025-03-08 06:28:48,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3442088091353996) internal successors, (824), 634 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 824 transitions. [2025-03-08 06:28:48,165 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 824 transitions. Word has length 95 [2025-03-08 06:28:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:48,166 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 824 transitions. [2025-03-08 06:28:48,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 824 transitions. [2025-03-08 06:28:48,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:28:48,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:48,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:48,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 06:28:48,167 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:48,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:48,167 INFO L85 PathProgramCache]: Analyzing trace with hash -273424513, now seen corresponding path program 1 times [2025-03-08 06:28:48,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:48,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268247255] [2025-03-08 06:28:48,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:48,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:48,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:28:48,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:28:48,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:48,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:48,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:48,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268247255] [2025-03-08 06:28:48,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268247255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:48,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:48,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:48,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683165611] [2025-03-08 06:28:48,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:48,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:48,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:48,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:48,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:48,377 INFO L87 Difference]: Start difference. First operand 635 states and 824 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:49,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:49,173 INFO L93 Difference]: Finished difference Result 1035 states and 1357 transitions. [2025-03-08 06:28:49,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:49,173 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:28:49,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:49,175 INFO L225 Difference]: With dead ends: 1035 [2025-03-08 06:28:49,175 INFO L226 Difference]: Without dead ends: 955 [2025-03-08 06:28:49,176 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-03-08 06:28:49,176 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 3433 mSDsluCounter, 2608 mSDsCounter, 0 mSdLazyCounter, 2482 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3433 SdHoareTripleChecker+Valid, 3265 SdHoareTripleChecker+Invalid, 2488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:49,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3433 Valid, 3265 Invalid, 2488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2482 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:49,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-08 06:28:49,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 635. [2025-03-08 06:28:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3425774877650898) internal successors, (823), 634 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 823 transitions. [2025-03-08 06:28:49,182 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 823 transitions. Word has length 95 [2025-03-08 06:28:49,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:49,182 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 823 transitions. [2025-03-08 06:28:49,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 823 transitions. [2025-03-08 06:28:49,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:28:49,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:49,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:49,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 06:28:49,183 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:49,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash 309990826, now seen corresponding path program 1 times [2025-03-08 06:28:49,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:49,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842712876] [2025-03-08 06:28:49,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:49,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:49,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:28:49,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:28:49,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:49,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:49,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:49,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842712876] [2025-03-08 06:28:49,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842712876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:49,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:49,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:49,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868430652] [2025-03-08 06:28:49,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:49,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:49,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:49,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:49,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:49,390 INFO L87 Difference]: Start difference. First operand 635 states and 823 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:50,145 INFO L93 Difference]: Finished difference Result 1046 states and 1366 transitions. [2025-03-08 06:28:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:50,145 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:28:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:50,147 INFO L225 Difference]: With dead ends: 1046 [2025-03-08 06:28:50,147 INFO L226 Difference]: Without dead ends: 955 [2025-03-08 06:28:50,147 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-03-08 06:28:50,148 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 2685 mSDsluCounter, 2091 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2685 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:50,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2685 Valid, 2741 Invalid, 2156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2150 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-08 06:28:50,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 635. [2025-03-08 06:28:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3409461663947797) internal successors, (822), 634 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 822 transitions. [2025-03-08 06:28:50,153 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 822 transitions. Word has length 97 [2025-03-08 06:28:50,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:50,153 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 822 transitions. [2025-03-08 06:28:50,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:50,153 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 822 transitions. [2025-03-08 06:28:50,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:28:50,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:50,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:50,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 06:28:50,154 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:50,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:50,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1924025428, now seen corresponding path program 1 times [2025-03-08 06:28:50,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:50,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536194678] [2025-03-08 06:28:50,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:50,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:50,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:28:50,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:28:50,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:50,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:50,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:50,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536194678] [2025-03-08 06:28:50,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536194678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:50,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:50,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:50,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906546536] [2025-03-08 06:28:50,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:50,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:50,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:50,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:50,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:50,327 INFO L87 Difference]: Start difference. First operand 635 states and 822 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:51,051 INFO L93 Difference]: Finished difference Result 1002 states and 1297 transitions. [2025-03-08 06:28:51,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:51,051 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:28:51,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:51,052 INFO L225 Difference]: With dead ends: 1002 [2025-03-08 06:28:51,052 INFO L226 Difference]: Without dead ends: 923 [2025-03-08 06:28:51,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:28:51,053 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 4164 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4164 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:51,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4164 Valid, 2143 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-03-08 06:28:51,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 635. [2025-03-08 06:28:51,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3393148450244698) internal successors, (821), 634 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 821 transitions. [2025-03-08 06:28:51,058 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 821 transitions. Word has length 97 [2025-03-08 06:28:51,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:51,058 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 821 transitions. [2025-03-08 06:28:51,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 821 transitions. [2025-03-08 06:28:51,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:28:51,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:51,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:51,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 06:28:51,059 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:51,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:51,059 INFO L85 PathProgramCache]: Analyzing trace with hash -85077165, now seen corresponding path program 1 times [2025-03-08 06:28:51,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:51,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213905102] [2025-03-08 06:28:51,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:51,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:51,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:28:51,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:28:51,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:51,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:51,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:51,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213905102] [2025-03-08 06:28:51,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213905102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:51,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:51,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:51,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534459420] [2025-03-08 06:28:51,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:51,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:51,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:51,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:51,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:51,243 INFO L87 Difference]: Start difference. First operand 635 states and 821 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:52,016 INFO L93 Difference]: Finished difference Result 999 states and 1293 transitions. [2025-03-08 06:28:52,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:52,016 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:28:52,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:52,018 INFO L225 Difference]: With dead ends: 999 [2025-03-08 06:28:52,018 INFO L226 Difference]: Without dead ends: 923 [2025-03-08 06:28:52,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:28:52,019 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 3881 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3881 SdHoareTripleChecker+Valid, 2325 SdHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:52,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3881 Valid, 2325 Invalid, 1912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:28:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-03-08 06:28:52,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 635. [2025-03-08 06:28:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3376835236541598) internal successors, (820), 634 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:52,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 820 transitions. [2025-03-08 06:28:52,024 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 820 transitions. Word has length 97 [2025-03-08 06:28:52,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:52,024 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 820 transitions. [2025-03-08 06:28:52,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:52,024 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 820 transitions. [2025-03-08 06:28:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:28:52,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:52,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:52,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 06:28:52,025 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:52,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:52,025 INFO L85 PathProgramCache]: Analyzing trace with hash -462971369, now seen corresponding path program 1 times [2025-03-08 06:28:52,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:52,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312469745] [2025-03-08 06:28:52,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:52,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:52,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:28:52,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:28:52,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:52,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:52,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:52,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312469745] [2025-03-08 06:28:52,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312469745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:52,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:52,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:52,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217603469] [2025-03-08 06:28:52,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:52,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:52,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:52,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:52,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:52,240 INFO L87 Difference]: Start difference. First operand 635 states and 820 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:52,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:52,970 INFO L93 Difference]: Finished difference Result 1002 states and 1295 transitions. [2025-03-08 06:28:52,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:52,971 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:28:52,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:52,973 INFO L225 Difference]: With dead ends: 1002 [2025-03-08 06:28:52,973 INFO L226 Difference]: Without dead ends: 923 [2025-03-08 06:28:52,974 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-03-08 06:28:52,974 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 4098 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4098 SdHoareTripleChecker+Valid, 2128 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:52,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4098 Valid, 2128 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1716 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:52,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-03-08 06:28:52,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 635. [2025-03-08 06:28:52,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.33605220228385) internal successors, (819), 634 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 819 transitions. [2025-03-08 06:28:52,981 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 819 transitions. Word has length 97 [2025-03-08 06:28:52,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:52,981 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 819 transitions. [2025-03-08 06:28:52,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:52,981 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 819 transitions. [2025-03-08 06:28:52,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:28:52,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:52,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:52,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 06:28:52,982 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:52,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:52,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1543735165, now seen corresponding path program 1 times [2025-03-08 06:28:52,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:52,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153373579] [2025-03-08 06:28:52,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:52,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:53,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:28:53,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:28:53,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:53,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:53,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:53,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153373579] [2025-03-08 06:28:53,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153373579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:53,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:53,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:28:53,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731056672] [2025-03-08 06:28:53,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:53,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:28:53,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:53,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:28:53,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:28:53,379 INFO L87 Difference]: Start difference. First operand 635 states and 819 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:54,649 INFO L93 Difference]: Finished difference Result 1347 states and 1801 transitions. [2025-03-08 06:28:54,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:28:54,650 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:28:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:54,651 INFO L225 Difference]: With dead ends: 1347 [2025-03-08 06:28:54,651 INFO L226 Difference]: Without dead ends: 1233 [2025-03-08 06:28:54,652 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-03-08 06:28:54,652 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 4975 mSDsluCounter, 3187 mSDsCounter, 0 mSdLazyCounter, 3069 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4975 SdHoareTripleChecker+Valid, 3889 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 3069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:54,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4975 Valid, 3889 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 3069 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:28:54,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2025-03-08 06:28:54,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 639. [2025-03-08 06:28:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.33387358184765) internal successors, (823), 638 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:54,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 823 transitions. [2025-03-08 06:28:54,659 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 823 transitions. Word has length 97 [2025-03-08 06:28:54,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:54,659 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 823 transitions. [2025-03-08 06:28:54,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 823 transitions. [2025-03-08 06:28:54,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:28:54,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:54,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:54,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 06:28:54,660 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:54,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:54,660 INFO L85 PathProgramCache]: Analyzing trace with hash -913552763, now seen corresponding path program 1 times [2025-03-08 06:28:54,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:54,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396230051] [2025-03-08 06:28:54,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:54,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:54,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:28:54,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:28:54,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:54,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:54,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:54,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396230051] [2025-03-08 06:28:54,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396230051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:54,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:54,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:54,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671566331] [2025-03-08 06:28:54,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:54,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:54,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:54,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:54,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:54,816 INFO L87 Difference]: Start difference. First operand 639 states and 823 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:55,445 INFO L93 Difference]: Finished difference Result 1050 states and 1364 transitions. [2025-03-08 06:28:55,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:55,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:28:55,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:55,446 INFO L225 Difference]: With dead ends: 1050 [2025-03-08 06:28:55,446 INFO L226 Difference]: Without dead ends: 959 [2025-03-08 06:28:55,447 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-03-08 06:28:55,447 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 3461 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3461 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:55,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3461 Valid, 2592 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:55,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-08 06:28:55,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 639. [2025-03-08 06:28:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.3322528363047001) internal successors, (822), 638 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 822 transitions. [2025-03-08 06:28:55,452 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 822 transitions. Word has length 97 [2025-03-08 06:28:55,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:55,452 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 822 transitions. [2025-03-08 06:28:55,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 822 transitions. [2025-03-08 06:28:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:28:55,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:55,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:55,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 06:28:55,454 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:55,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:55,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1147398279, now seen corresponding path program 1 times [2025-03-08 06:28:55,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:55,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323989473] [2025-03-08 06:28:55,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:55,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:55,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:28:55,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:28:55,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:55,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:55,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:55,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323989473] [2025-03-08 06:28:55,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323989473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:55,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:55,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:55,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945283174] [2025-03-08 06:28:55,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:55,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:55,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:55,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:55,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:55,648 INFO L87 Difference]: Start difference. First operand 639 states and 822 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:56,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:56,273 INFO L93 Difference]: Finished difference Result 1006 states and 1296 transitions. [2025-03-08 06:28:56,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:56,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:28:56,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:56,275 INFO L225 Difference]: With dead ends: 1006 [2025-03-08 06:28:56,275 INFO L226 Difference]: Without dead ends: 927 [2025-03-08 06:28:56,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:28:56,276 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 4089 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4089 SdHoareTripleChecker+Valid, 2195 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:56,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4089 Valid, 2195 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:28:56,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-08 06:28:56,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 639. [2025-03-08 06:28:56,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.3306320907617504) internal successors, (821), 638 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:56,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 821 transitions. [2025-03-08 06:28:56,281 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 821 transitions. Word has length 97 [2025-03-08 06:28:56,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:56,281 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 821 transitions. [2025-03-08 06:28:56,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:56,281 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 821 transitions. [2025-03-08 06:28:56,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:28:56,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:56,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:56,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 06:28:56,282 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:56,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:56,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1206366938, now seen corresponding path program 1 times [2025-03-08 06:28:56,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:56,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499225896] [2025-03-08 06:28:56,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:56,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:56,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:28:56,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:28:56,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:56,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:56,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:56,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499225896] [2025-03-08 06:28:56,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499225896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:56,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:56,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:56,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573118945] [2025-03-08 06:28:56,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:56,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:56,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:56,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:56,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:56,423 INFO L87 Difference]: Start difference. First operand 639 states and 821 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:57,092 INFO L93 Difference]: Finished difference Result 932 states and 1184 transitions. [2025-03-08 06:28:57,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:57,092 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:28:57,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:57,094 INFO L225 Difference]: With dead ends: 932 [2025-03-08 06:28:57,094 INFO L226 Difference]: Without dead ends: 927 [2025-03-08 06:28:57,094 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-03-08 06:28:57,094 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 3064 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3064 SdHoareTripleChecker+Valid, 2180 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:57,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3064 Valid, 2180 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:57,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-08 06:28:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 639. [2025-03-08 06:28:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.3290113452188006) internal successors, (820), 638 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 820 transitions. [2025-03-08 06:28:57,099 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 820 transitions. Word has length 97 [2025-03-08 06:28:57,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:57,099 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 820 transitions. [2025-03-08 06:28:57,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 820 transitions. [2025-03-08 06:28:57,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:28:57,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:57,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:57,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 06:28:57,100 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:57,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:57,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1583999952, now seen corresponding path program 1 times [2025-03-08 06:28:57,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:57,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660179050] [2025-03-08 06:28:57,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:57,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:57,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:28:57,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:28:57,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:57,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:57,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:57,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660179050] [2025-03-08 06:28:57,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660179050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:57,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:57,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:57,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170967306] [2025-03-08 06:28:57,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:57,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:57,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:57,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:57,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:57,268 INFO L87 Difference]: Start difference. First operand 639 states and 820 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:57,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:57,871 INFO L93 Difference]: Finished difference Result 1003 states and 1290 transitions. [2025-03-08 06:28:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:57,871 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:28:57,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:57,873 INFO L225 Difference]: With dead ends: 1003 [2025-03-08 06:28:57,873 INFO L226 Difference]: Without dead ends: 927 [2025-03-08 06:28:57,873 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-03-08 06:28:57,873 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 4024 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 1707 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4024 SdHoareTripleChecker+Valid, 2195 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:57,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4024 Valid, 2195 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:28:57,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-08 06:28:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 639. [2025-03-08 06:28:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.3273905996758508) internal successors, (819), 638 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 819 transitions. [2025-03-08 06:28:57,878 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 819 transitions. Word has length 97 [2025-03-08 06:28:57,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:57,879 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 819 transitions. [2025-03-08 06:28:57,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:57,879 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 819 transitions. [2025-03-08 06:28:57,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:28:57,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:57,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:57,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 06:28:57,880 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:57,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:57,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1263039565, now seen corresponding path program 1 times [2025-03-08 06:28:57,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:57,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857828798] [2025-03-08 06:28:57,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:57,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:57,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:28:57,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:28:57,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:57,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:58,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:58,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857828798] [2025-03-08 06:28:58,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857828798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:58,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:58,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:58,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181096199] [2025-03-08 06:28:58,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:58,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:58,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:58,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:58,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:58,042 INFO L87 Difference]: Start difference. First operand 639 states and 819 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:58,698 INFO L93 Difference]: Finished difference Result 1001 states and 1287 transitions. [2025-03-08 06:28:58,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:58,699 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:28:58,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:58,700 INFO L225 Difference]: With dead ends: 1001 [2025-03-08 06:28:58,700 INFO L226 Difference]: Without dead ends: 927 [2025-03-08 06:28:58,700 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-03-08 06:28:58,701 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 3787 mSDsluCounter, 1815 mSDsCounter, 0 mSdLazyCounter, 1896 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3787 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:58,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3787 Valid, 2393 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1896 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:58,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-08 06:28:58,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 639. [2025-03-08 06:28:58,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.325769854132901) internal successors, (818), 638 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:58,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 818 transitions. [2025-03-08 06:28:58,707 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 818 transitions. Word has length 97 [2025-03-08 06:28:58,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:58,708 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 818 transitions. [2025-03-08 06:28:58,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:58,708 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 818 transitions. [2025-03-08 06:28:58,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:28:58,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:58,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:58,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 06:28:58,709 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:58,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:58,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1817748241, now seen corresponding path program 1 times [2025-03-08 06:28:58,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:58,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930564208] [2025-03-08 06:28:58,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:58,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:58,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:28:58,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:28:58,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:58,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:58,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:58,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:58,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930564208] [2025-03-08 06:28:58,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930564208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:58,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:58,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:58,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785913206] [2025-03-08 06:28:58,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:58,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:58,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:58,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:58,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:58,886 INFO L87 Difference]: Start difference. First operand 639 states and 818 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:59,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:59,573 INFO L93 Difference]: Finished difference Result 1003 states and 1288 transitions. [2025-03-08 06:28:59,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:59,574 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:28:59,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:59,576 INFO L225 Difference]: With dead ends: 1003 [2025-03-08 06:28:59,576 INFO L226 Difference]: Without dead ends: 927 [2025-03-08 06:28:59,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:28:59,577 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 2855 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 1851 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2855 SdHoareTripleChecker+Valid, 2407 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:59,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2855 Valid, 2407 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1851 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:28:59,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-08 06:28:59,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 639. [2025-03-08 06:28:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.3241491085899513) internal successors, (817), 638 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 817 transitions. [2025-03-08 06:28:59,584 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 817 transitions. Word has length 97 [2025-03-08 06:28:59,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:59,585 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 817 transitions. [2025-03-08 06:28:59,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:28:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 817 transitions. [2025-03-08 06:28:59,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:28:59,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:59,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:28:59,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-08 06:28:59,586 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:28:59,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:59,586 INFO L85 PathProgramCache]: Analyzing trace with hash 172545752, now seen corresponding path program 1 times [2025-03-08 06:28:59,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:59,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034642033] [2025-03-08 06:28:59,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:59,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:59,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:28:59,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:28:59,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:59,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:28:59,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:59,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034642033] [2025-03-08 06:28:59,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034642033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:59,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:59,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:28:59,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463388708] [2025-03-08 06:28:59,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:59,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:28:59,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:59,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:28:59,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:28:59,844 INFO L87 Difference]: Start difference. First operand 639 states and 817 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:00,793 INFO L93 Difference]: Finished difference Result 1114 states and 1444 transitions. [2025-03-08 06:29:00,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:29:00,794 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:29:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:00,795 INFO L225 Difference]: With dead ends: 1114 [2025-03-08 06:29:00,795 INFO L226 Difference]: Without dead ends: 1109 [2025-03-08 06:29:00,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:29:00,799 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 7338 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 1813 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7338 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 2048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:00,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7338 Valid, 2299 Invalid, 2048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1813 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:29:00,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2025-03-08 06:29:00,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 643. [2025-03-08 06:29:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 621 states have (on average 1.3220611916264091) internal successors, (821), 642 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:00,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 821 transitions. [2025-03-08 06:29:00,804 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 821 transitions. Word has length 97 [2025-03-08 06:29:00,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:00,804 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 821 transitions. [2025-03-08 06:29:00,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 821 transitions. [2025-03-08 06:29:00,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:00,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:00,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:00,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-08 06:29:00,805 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:00,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:00,805 INFO L85 PathProgramCache]: Analyzing trace with hash 550258206, now seen corresponding path program 1 times [2025-03-08 06:29:00,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:00,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870611662] [2025-03-08 06:29:00,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:00,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:00,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:00,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:00,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:00,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:00,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:00,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:00,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870611662] [2025-03-08 06:29:00,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870611662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:00,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:00,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:00,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125905900] [2025-03-08 06:29:00,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:00,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:00,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:00,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:00,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:00,936 INFO L87 Difference]: Start difference. First operand 643 states and 821 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:01,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:01,521 INFO L93 Difference]: Finished difference Result 1003 states and 1285 transitions. [2025-03-08 06:29:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:01,522 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:29:01,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:01,523 INFO L225 Difference]: With dead ends: 1003 [2025-03-08 06:29:01,523 INFO L226 Difference]: Without dead ends: 927 [2025-03-08 06:29:01,523 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-03-08 06:29:01,524 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 3025 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3025 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 1687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:01,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3025 Valid, 2183 Invalid, 1687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:01,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-08 06:29:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 643. [2025-03-08 06:29:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 621 states have (on average 1.320450885668277) internal successors, (820), 642 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 820 transitions. [2025-03-08 06:29:01,528 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 820 transitions. Word has length 97 [2025-03-08 06:29:01,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:01,528 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 820 transitions. [2025-03-08 06:29:01,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 820 transitions. [2025-03-08 06:29:01,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:01,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:01,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:01,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-08 06:29:01,530 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:01,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:01,530 INFO L85 PathProgramCache]: Analyzing trace with hash 945507947, now seen corresponding path program 1 times [2025-03-08 06:29:01,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:01,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112479069] [2025-03-08 06:29:01,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:01,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:01,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:01,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:01,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:01,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:01,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:01,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112479069] [2025-03-08 06:29:01,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112479069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:01,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:01,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:01,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508637682] [2025-03-08 06:29:01,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:01,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:01,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:01,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:01,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:01,691 INFO L87 Difference]: Start difference. First operand 643 states and 820 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:02,375 INFO L93 Difference]: Finished difference Result 980 states and 1248 transitions. [2025-03-08 06:29:02,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:02,375 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:29:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:02,377 INFO L225 Difference]: With dead ends: 980 [2025-03-08 06:29:02,377 INFO L226 Difference]: Without dead ends: 963 [2025-03-08 06:29:02,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:02,377 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 3343 mSDsluCounter, 2108 mSDsCounter, 0 mSdLazyCounter, 2064 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3343 SdHoareTripleChecker+Valid, 2763 SdHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:02,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3343 Valid, 2763 Invalid, 2070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2064 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:02,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-08 06:29:02,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 643. [2025-03-08 06:29:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 621 states have (on average 1.318840579710145) internal successors, (819), 642 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 819 transitions. [2025-03-08 06:29:02,383 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 819 transitions. Word has length 97 [2025-03-08 06:29:02,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:02,383 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 819 transitions. [2025-03-08 06:29:02,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 819 transitions. [2025-03-08 06:29:02,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:02,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:02,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:02,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-08 06:29:02,384 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:02,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:02,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1288508307, now seen corresponding path program 1 times [2025-03-08 06:29:02,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:02,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470806526] [2025-03-08 06:29:02,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:02,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:02,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:02,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:02,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:02,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:02,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:02,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470806526] [2025-03-08 06:29:02,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470806526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:02,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:02,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:02,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570554941] [2025-03-08 06:29:02,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:02,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:02,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:02,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:02,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:02,544 INFO L87 Difference]: Start difference. First operand 643 states and 819 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:03,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:03,154 INFO L93 Difference]: Finished difference Result 932 states and 1175 transitions. [2025-03-08 06:29:03,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:03,154 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:29:03,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:03,155 INFO L225 Difference]: With dead ends: 932 [2025-03-08 06:29:03,155 INFO L226 Difference]: Without dead ends: 927 [2025-03-08 06:29:03,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:03,156 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 4017 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4017 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:03,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4017 Valid, 2231 Invalid, 1704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:03,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-08 06:29:03,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 643. [2025-03-08 06:29:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 621 states have (on average 1.317230273752013) internal successors, (818), 642 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:03,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 818 transitions. [2025-03-08 06:29:03,160 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 818 transitions. Word has length 97 [2025-03-08 06:29:03,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:03,160 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 818 transitions. [2025-03-08 06:29:03,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 818 transitions. [2025-03-08 06:29:03,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:03,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:03,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:03,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-08 06:29:03,161 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:03,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:03,161 INFO L85 PathProgramCache]: Analyzing trace with hash 322479601, now seen corresponding path program 1 times [2025-03-08 06:29:03,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:03,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478845450] [2025-03-08 06:29:03,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:03,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:03,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:03,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:03,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:03,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:03,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:03,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478845450] [2025-03-08 06:29:03,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478845450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:03,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:03,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:03,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013839096] [2025-03-08 06:29:03,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:03,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:03,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:03,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:03,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:03,403 INFO L87 Difference]: Start difference. First operand 643 states and 818 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:04,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:04,438 INFO L93 Difference]: Finished difference Result 1276 states and 1681 transitions. [2025-03-08 06:29:04,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:29:04,438 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:29:04,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:04,440 INFO L225 Difference]: With dead ends: 1276 [2025-03-08 06:29:04,440 INFO L226 Difference]: Without dead ends: 1185 [2025-03-08 06:29:04,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:29:04,441 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 5849 mSDsluCounter, 2107 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5849 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 2251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:04,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5849 Valid, 2703 Invalid, 2251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:29:04,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2025-03-08 06:29:04,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 647. [2025-03-08 06:29:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 625 states have (on average 1.3152) internal successors, (822), 646 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 822 transitions. [2025-03-08 06:29:04,448 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 822 transitions. Word has length 97 [2025-03-08 06:29:04,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:04,449 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 822 transitions. [2025-03-08 06:29:04,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:04,449 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 822 transitions. [2025-03-08 06:29:04,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:04,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:04,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:04,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-08 06:29:04,450 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:04,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:04,450 INFO L85 PathProgramCache]: Analyzing trace with hash -73094820, now seen corresponding path program 1 times [2025-03-08 06:29:04,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:04,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16317331] [2025-03-08 06:29:04,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:04,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:04,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:04,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:04,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:04,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:04,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:04,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16317331] [2025-03-08 06:29:04,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16317331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:04,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:04,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:04,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602435980] [2025-03-08 06:29:04,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:04,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:04,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:04,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:04,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:04,662 INFO L87 Difference]: Start difference. First operand 647 states and 822 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:05,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:05,304 INFO L93 Difference]: Finished difference Result 1007 states and 1286 transitions. [2025-03-08 06:29:05,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:05,304 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:29:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:05,305 INFO L225 Difference]: With dead ends: 1007 [2025-03-08 06:29:05,305 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 06:29:05,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:05,306 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 3722 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 1886 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3722 SdHoareTripleChecker+Valid, 2429 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:05,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3722 Valid, 2429 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1886 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:05,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 06:29:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 647. [2025-03-08 06:29:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 625 states have (on average 1.3136) internal successors, (821), 646 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 821 transitions. [2025-03-08 06:29:05,310 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 821 transitions. Word has length 97 [2025-03-08 06:29:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:05,311 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 821 transitions. [2025-03-08 06:29:05,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 821 transitions. [2025-03-08 06:29:05,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:05,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:05,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:05,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-08 06:29:05,312 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:05,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:05,312 INFO L85 PathProgramCache]: Analyzing trace with hash -450482594, now seen corresponding path program 1 times [2025-03-08 06:29:05,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:05,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873366473] [2025-03-08 06:29:05,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:05,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:05,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:05,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:05,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:05,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:05,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:05,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:05,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873366473] [2025-03-08 06:29:05,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873366473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:05,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:05,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:05,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144655859] [2025-03-08 06:29:05,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:05,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:05,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:05,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:05,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:05,564 INFO L87 Difference]: Start difference. First operand 647 states and 821 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:06,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:06,657 INFO L93 Difference]: Finished difference Result 1192 states and 1554 transitions. [2025-03-08 06:29:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:29:06,657 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:29:06,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:06,659 INFO L225 Difference]: With dead ends: 1192 [2025-03-08 06:29:06,659 INFO L226 Difference]: Without dead ends: 1113 [2025-03-08 06:29:06,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:29:06,659 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 5177 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 2497 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5177 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 2497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:06,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5177 Valid, 3085 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 2497 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:29:06,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2025-03-08 06:29:06,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 651. [2025-03-08 06:29:06,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 629 states have (on average 1.3116057233704292) internal successors, (825), 650 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:06,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 825 transitions. [2025-03-08 06:29:06,664 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 825 transitions. Word has length 97 [2025-03-08 06:29:06,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:06,664 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 825 transitions. [2025-03-08 06:29:06,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:06,664 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 825 transitions. [2025-03-08 06:29:06,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:06,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:06,665 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:06,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-08 06:29:06,665 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:06,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:06,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1853866029, now seen corresponding path program 1 times [2025-03-08 06:29:06,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:06,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583218340] [2025-03-08 06:29:06,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:06,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:06,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:06,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:06,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:06,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:06,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:06,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:06,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583218340] [2025-03-08 06:29:06,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583218340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:06,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:06,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:06,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583268179] [2025-03-08 06:29:06,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:06,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:06,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:06,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:06,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:06,909 INFO L87 Difference]: Start difference. First operand 651 states and 825 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:07,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:07,877 INFO L93 Difference]: Finished difference Result 1189 states and 1550 transitions. [2025-03-08 06:29:07,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:29:07,877 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:29:07,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:07,879 INFO L225 Difference]: With dead ends: 1189 [2025-03-08 06:29:07,879 INFO L226 Difference]: Without dead ends: 1113 [2025-03-08 06:29:07,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:29:07,879 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 7225 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 1811 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7225 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:07,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7225 Valid, 2314 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1811 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:29:07,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2025-03-08 06:29:07,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 655. [2025-03-08 06:29:07,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 633 states have (on average 1.3096366508688784) internal successors, (829), 654 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 829 transitions. [2025-03-08 06:29:07,884 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 829 transitions. Word has length 97 [2025-03-08 06:29:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:07,884 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 829 transitions. [2025-03-08 06:29:07,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 829 transitions. [2025-03-08 06:29:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:07,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:07,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:07,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-08 06:29:07,885 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:07,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:07,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1951508976, now seen corresponding path program 1 times [2025-03-08 06:29:07,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:07,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552881533] [2025-03-08 06:29:07,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:07,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:07,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:07,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:07,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:07,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:08,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:08,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:08,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552881533] [2025-03-08 06:29:08,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552881533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:08,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:08,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:08,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052233771] [2025-03-08 06:29:08,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:08,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:08,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:08,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:08,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:08,151 INFO L87 Difference]: Start difference. First operand 655 states and 829 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:09,293 INFO L93 Difference]: Finished difference Result 1279 states and 1682 transitions. [2025-03-08 06:29:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:29:09,294 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:29:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:09,295 INFO L225 Difference]: With dead ends: 1279 [2025-03-08 06:29:09,295 INFO L226 Difference]: Without dead ends: 1193 [2025-03-08 06:29:09,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:29:09,296 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 5063 mSDsluCounter, 2893 mSDsCounter, 0 mSdLazyCounter, 2751 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5063 SdHoareTripleChecker+Valid, 3537 SdHoareTripleChecker+Invalid, 2956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 2751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:09,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5063 Valid, 3537 Invalid, 2956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 2751 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:29:09,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-03-08 06:29:09,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 659. [2025-03-08 06:29:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 637 states have (on average 1.3076923076923077) internal successors, (833), 658 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 833 transitions. [2025-03-08 06:29:09,301 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 833 transitions. Word has length 97 [2025-03-08 06:29:09,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:09,301 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 833 transitions. [2025-03-08 06:29:09,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:09,301 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 833 transitions. [2025-03-08 06:29:09,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:09,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:09,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:09,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-08 06:29:09,302 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:09,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:09,302 INFO L85 PathProgramCache]: Analyzing trace with hash 960646926, now seen corresponding path program 1 times [2025-03-08 06:29:09,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:09,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536116247] [2025-03-08 06:29:09,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:09,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:09,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:09,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:09,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:09,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:09,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:09,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:09,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536116247] [2025-03-08 06:29:09,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536116247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:09,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:09,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:09,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055438103] [2025-03-08 06:29:09,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:09,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:09,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:09,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:09,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:09,457 INFO L87 Difference]: Start difference. First operand 659 states and 833 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:10,133 INFO L93 Difference]: Finished difference Result 1011 states and 1287 transitions. [2025-03-08 06:29:10,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:10,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:29:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:10,134 INFO L225 Difference]: With dead ends: 1011 [2025-03-08 06:29:10,134 INFO L226 Difference]: Without dead ends: 935 [2025-03-08 06:29:10,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:10,135 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 3739 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 1864 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3739 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:10,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3739 Valid, 2409 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1864 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:10,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-03-08 06:29:10,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 659. [2025-03-08 06:29:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 637 states have (on average 1.3061224489795917) internal successors, (832), 658 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 832 transitions. [2025-03-08 06:29:10,139 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 832 transitions. Word has length 97 [2025-03-08 06:29:10,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:10,139 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 832 transitions. [2025-03-08 06:29:10,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 832 transitions. [2025-03-08 06:29:10,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:10,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:10,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:10,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-08 06:29:10,140 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:10,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:10,140 INFO L85 PathProgramCache]: Analyzing trace with hash -369971989, now seen corresponding path program 1 times [2025-03-08 06:29:10,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:10,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692903424] [2025-03-08 06:29:10,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:10,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:10,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:10,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:10,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:10,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:10,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:10,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:10,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692903424] [2025-03-08 06:29:10,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692903424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:10,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:10,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:10,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310524064] [2025-03-08 06:29:10,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:10,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:10,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:10,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:10,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:10,285 INFO L87 Difference]: Start difference. First operand 659 states and 832 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:10,894 INFO L93 Difference]: Finished difference Result 1011 states and 1286 transitions. [2025-03-08 06:29:10,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:10,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:29:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:10,895 INFO L225 Difference]: With dead ends: 1011 [2025-03-08 06:29:10,895 INFO L226 Difference]: Without dead ends: 935 [2025-03-08 06:29:10,895 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-03-08 06:29:10,896 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 3022 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3022 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:10,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3022 Valid, 2196 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-03-08 06:29:10,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 659. [2025-03-08 06:29:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 637 states have (on average 1.304552590266876) internal successors, (831), 658 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 831 transitions. [2025-03-08 06:29:10,900 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 831 transitions. Word has length 97 [2025-03-08 06:29:10,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:10,900 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 831 transitions. [2025-03-08 06:29:10,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,900 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 831 transitions. [2025-03-08 06:29:10,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:10,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:10,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:10,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-08 06:29:10,901 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:10,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:10,901 INFO L85 PathProgramCache]: Analyzing trace with hash -863701498, now seen corresponding path program 1 times [2025-03-08 06:29:10,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:10,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145792328] [2025-03-08 06:29:10,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:10,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:10,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:10,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:10,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:10,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:11,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:11,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:11,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145792328] [2025-03-08 06:29:11,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145792328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:11,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:11,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:11,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777533850] [2025-03-08 06:29:11,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:11,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:11,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:11,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:11,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:11,047 INFO L87 Difference]: Start difference. First operand 659 states and 831 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:11,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:11,651 INFO L93 Difference]: Finished difference Result 1009 states and 1282 transitions. [2025-03-08 06:29:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:11,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:29:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:11,652 INFO L225 Difference]: With dead ends: 1009 [2025-03-08 06:29:11,652 INFO L226 Difference]: Without dead ends: 935 [2025-03-08 06:29:11,652 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-03-08 06:29:11,653 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 4024 mSDsluCounter, 1676 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4024 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:11,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4024 Valid, 2207 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-03-08 06:29:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 659. [2025-03-08 06:29:11,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 637 states have (on average 1.3029827315541602) internal successors, (830), 658 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 830 transitions. [2025-03-08 06:29:11,658 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 830 transitions. Word has length 97 [2025-03-08 06:29:11,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:11,658 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 830 transitions. [2025-03-08 06:29:11,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:11,658 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 830 transitions. [2025-03-08 06:29:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:11,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:11,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:11,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-08 06:29:11,659 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:11,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:11,659 INFO L85 PathProgramCache]: Analyzing trace with hash 119620302, now seen corresponding path program 1 times [2025-03-08 06:29:11,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:11,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386333362] [2025-03-08 06:29:11,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:11,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:11,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:11,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:11,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:11,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:11,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:11,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386333362] [2025-03-08 06:29:11,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386333362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:11,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:11,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:11,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986903633] [2025-03-08 06:29:11,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:11,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:11,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:11,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:11,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:11,920 INFO L87 Difference]: Start difference. First operand 659 states and 830 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:12,993 INFO L93 Difference]: Finished difference Result 1279 states and 1676 transitions. [2025-03-08 06:29:12,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:29:12,994 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:29:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:12,995 INFO L225 Difference]: With dead ends: 1279 [2025-03-08 06:29:12,995 INFO L226 Difference]: Without dead ends: 1193 [2025-03-08 06:29:12,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:29:12,996 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 6145 mSDsluCounter, 2289 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6145 SdHoareTripleChecker+Valid, 2937 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:12,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6145 Valid, 2937 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 2215 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:29:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-03-08 06:29:13,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 663. [2025-03-08 06:29:13,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 641 states have (on average 1.3010920436817472) internal successors, (834), 662 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 834 transitions. [2025-03-08 06:29:13,001 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 834 transitions. Word has length 97 [2025-03-08 06:29:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:13,001 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 834 transitions. [2025-03-08 06:29:13,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 834 transitions. [2025-03-08 06:29:13,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:13,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:13,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:13,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-08 06:29:13,002 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:13,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:13,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1263191092, now seen corresponding path program 1 times [2025-03-08 06:29:13,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:13,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270761562] [2025-03-08 06:29:13,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:13,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:13,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:13,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:13,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:13,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:13,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270761562] [2025-03-08 06:29:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270761562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:13,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:13,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:13,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35189876] [2025-03-08 06:29:13,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:13,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:13,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:13,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:13,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:13,153 INFO L87 Difference]: Start difference. First operand 663 states and 834 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:13,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:13,752 INFO L93 Difference]: Finished difference Result 1015 states and 1287 transitions. [2025-03-08 06:29:13,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:13,752 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:29:13,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:13,753 INFO L225 Difference]: With dead ends: 1015 [2025-03-08 06:29:13,753 INFO L226 Difference]: Without dead ends: 939 [2025-03-08 06:29:13,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:13,753 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 4019 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4019 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:13,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4019 Valid, 2211 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-03-08 06:29:13,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 663. [2025-03-08 06:29:13,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 641 states have (on average 1.2995319812792512) internal successors, (833), 662 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 833 transitions. [2025-03-08 06:29:13,758 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 833 transitions. Word has length 97 [2025-03-08 06:29:13,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:13,758 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 833 transitions. [2025-03-08 06:29:13,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:13,758 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 833 transitions. [2025-03-08 06:29:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:13,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:13,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:13,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-08 06:29:13,759 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:13,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:13,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1261941257, now seen corresponding path program 1 times [2025-03-08 06:29:13,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:13,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447049770] [2025-03-08 06:29:13,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:13,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:13,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:13,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:13,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:13,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:13,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:13,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:13,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447049770] [2025-03-08 06:29:13,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447049770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:13,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:13,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:13,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106265520] [2025-03-08 06:29:13,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:13,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:13,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:13,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:13,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:13,997 INFO L87 Difference]: Start difference. First operand 663 states and 833 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:15,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:15,018 INFO L93 Difference]: Finished difference Result 1275 states and 1670 transitions. [2025-03-08 06:29:15,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:29:15,018 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:29:15,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:15,019 INFO L225 Difference]: With dead ends: 1275 [2025-03-08 06:29:15,019 INFO L226 Difference]: Without dead ends: 1193 [2025-03-08 06:29:15,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:29:15,020 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 6179 mSDsluCounter, 2275 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6179 SdHoareTripleChecker+Valid, 2918 SdHoareTripleChecker+Invalid, 2396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:15,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6179 Valid, 2918 Invalid, 2396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 2181 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:29:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-03-08 06:29:15,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 667. [2025-03-08 06:29:15,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 645 states have (on average 1.2976744186046512) internal successors, (837), 666 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 837 transitions. [2025-03-08 06:29:15,024 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 837 transitions. Word has length 97 [2025-03-08 06:29:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:15,024 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 837 transitions. [2025-03-08 06:29:15,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:15,025 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 837 transitions. [2025-03-08 06:29:15,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:15,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:15,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:15,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-08 06:29:15,025 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:15,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:15,026 INFO L85 PathProgramCache]: Analyzing trace with hash 283334148, now seen corresponding path program 1 times [2025-03-08 06:29:15,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:15,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425545210] [2025-03-08 06:29:15,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:15,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:15,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:15,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:15,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:15,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:15,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:15,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425545210] [2025-03-08 06:29:15,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425545210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:15,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:15,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:15,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934661725] [2025-03-08 06:29:15,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:15,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:15,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:15,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:15,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:15,160 INFO L87 Difference]: Start difference. First operand 667 states and 837 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:15,814 INFO L93 Difference]: Finished difference Result 1017 states and 1288 transitions. [2025-03-08 06:29:15,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:15,815 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:29:15,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:15,815 INFO L225 Difference]: With dead ends: 1017 [2025-03-08 06:29:15,816 INFO L226 Difference]: Without dead ends: 943 [2025-03-08 06:29:15,816 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-03-08 06:29:15,816 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 2795 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 1843 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2795 SdHoareTripleChecker+Valid, 2457 SdHoareTripleChecker+Invalid, 1849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:15,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2795 Valid, 2457 Invalid, 1849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1843 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-03-08 06:29:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 667. [2025-03-08 06:29:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 645 states have (on average 1.296124031007752) internal successors, (836), 666 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:15,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 836 transitions. [2025-03-08 06:29:15,820 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 836 transitions. Word has length 97 [2025-03-08 06:29:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:15,820 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 836 transitions. [2025-03-08 06:29:15,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 836 transitions. [2025-03-08 06:29:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:29:15,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:15,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:15,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-08 06:29:15,821 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:15,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:15,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1128393761, now seen corresponding path program 1 times [2025-03-08 06:29:15,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:15,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666447469] [2025-03-08 06:29:15,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:15,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:15,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:29:15,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:29:15,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:15,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:16,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-03-08 06:29:16,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:16,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666447469] [2025-03-08 06:29:16,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666447469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:16,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:16,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:16,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302096552] [2025-03-08 06:29:16,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:16,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:16,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:16,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:16,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:16,051 INFO L87 Difference]: Start difference. First operand 667 states and 836 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:16,956 INFO L93 Difference]: Finished difference Result 1199 states and 1553 transitions. [2025-03-08 06:29:16,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:29:16,957 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:29:16,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:16,958 INFO L225 Difference]: With dead ends: 1199 [2025-03-08 06:29:16,958 INFO L226 Difference]: Without dead ends: 1125 [2025-03-08 06:29:16,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:29:16,959 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 5991 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5991 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 2011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:16,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5991 Valid, 2314 Invalid, 2011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:29:16,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-03-08 06:29:16,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 671. [2025-03-08 06:29:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 649 states have (on average 1.2942989214175655) internal successors, (840), 670 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:16,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 840 transitions. [2025-03-08 06:29:16,963 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 840 transitions. Word has length 97 [2025-03-08 06:29:16,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:16,964 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 840 transitions. [2025-03-08 06:29:16,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:16,964 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 840 transitions. [2025-03-08 06:29:16,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:29:16,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:16,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:16,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-08 06:29:16,965 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:16,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:16,965 INFO L85 PathProgramCache]: Analyzing trace with hash -17867935, now seen corresponding path program 1 times [2025-03-08 06:29:16,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:16,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930917100] [2025-03-08 06:29:16,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:16,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:16,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:29:16,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:29:16,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:16,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:17,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:17,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:17,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930917100] [2025-03-08 06:29:17,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930917100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:17,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:17,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:17,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692791817] [2025-03-08 06:29:17,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:17,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:17,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:17,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:17,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:17,111 INFO L87 Difference]: Start difference. First operand 671 states and 840 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:17,857 INFO L93 Difference]: Finished difference Result 1133 states and 1438 transitions. [2025-03-08 06:29:17,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:17,857 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-08 06:29:17,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:17,858 INFO L225 Difference]: With dead ends: 1133 [2025-03-08 06:29:17,858 INFO L226 Difference]: Without dead ends: 1019 [2025-03-08 06:29:17,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:29:17,859 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 3305 mSDsluCounter, 2283 mSDsCounter, 0 mSdLazyCounter, 2152 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3305 SdHoareTripleChecker+Valid, 2988 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:17,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3305 Valid, 2988 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2152 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:17,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-03-08 06:29:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 667. [2025-03-08 06:29:17,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 645 states have (on average 1.2945736434108528) internal successors, (835), 666 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 835 transitions. [2025-03-08 06:29:17,863 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 835 transitions. Word has length 98 [2025-03-08 06:29:17,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:17,864 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 835 transitions. [2025-03-08 06:29:17,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 835 transitions. [2025-03-08 06:29:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:29:17,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:17,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:17,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-03-08 06:29:17,864 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:17,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1620928423, now seen corresponding path program 1 times [2025-03-08 06:29:17,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:17,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752392640] [2025-03-08 06:29:17,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:17,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:17,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:29:17,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:29:17,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:17,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:18,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:18,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:18,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752392640] [2025-03-08 06:29:18,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752392640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:18,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:18,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:18,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276207699] [2025-03-08 06:29:18,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:18,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:18,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:18,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:18,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:18,038 INFO L87 Difference]: Start difference. First operand 667 states and 835 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:18,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:18,653 INFO L93 Difference]: Finished difference Result 944 states and 1175 transitions. [2025-03-08 06:29:18,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:18,653 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-08 06:29:18,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:18,654 INFO L225 Difference]: With dead ends: 944 [2025-03-08 06:29:18,654 INFO L226 Difference]: Without dead ends: 939 [2025-03-08 06:29:18,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:29:18,655 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 3016 mSDsluCounter, 1676 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3016 SdHoareTripleChecker+Valid, 2208 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:18,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3016 Valid, 2208 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-03-08 06:29:18,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 663. [2025-03-08 06:29:18,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 641 states have (on average 1.2948517940717628) internal successors, (830), 662 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 830 transitions. [2025-03-08 06:29:18,661 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 830 transitions. Word has length 98 [2025-03-08 06:29:18,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:18,661 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 830 transitions. [2025-03-08 06:29:18,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:18,661 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 830 transitions. [2025-03-08 06:29:18,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:29:18,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:18,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:18,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-03-08 06:29:18,662 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:18,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:18,662 INFO L85 PathProgramCache]: Analyzing trace with hash 540030588, now seen corresponding path program 1 times [2025-03-08 06:29:18,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:18,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762269445] [2025-03-08 06:29:18,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:18,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:18,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:29:18,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:29:18,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:18,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:18,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-03-08 06:29:18,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:18,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762269445] [2025-03-08 06:29:18,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762269445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:18,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:18,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:18,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938692382] [2025-03-08 06:29:18,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:18,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:18,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:18,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:18,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:18,826 INFO L87 Difference]: Start difference. First operand 663 states and 830 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:19,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:19,482 INFO L93 Difference]: Finished difference Result 1018 states and 1285 transitions. [2025-03-08 06:29:19,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:19,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-08 06:29:19,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:19,484 INFO L225 Difference]: With dead ends: 1018 [2025-03-08 06:29:19,484 INFO L226 Difference]: Without dead ends: 939 [2025-03-08 06:29:19,484 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-03-08 06:29:19,484 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 2015 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2015 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:19,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2015 Valid, 2224 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:19,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-03-08 06:29:19,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 659. [2025-03-08 06:29:19,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 637 states have (on average 1.2951334379905808) internal successors, (825), 658 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 825 transitions. [2025-03-08 06:29:19,488 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 825 transitions. Word has length 98 [2025-03-08 06:29:19,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:19,489 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 825 transitions. [2025-03-08 06:29:19,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 825 transitions. [2025-03-08 06:29:19,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:29:19,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:19,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:19,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-03-08 06:29:19,489 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:19,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:19,490 INFO L85 PathProgramCache]: Analyzing trace with hash 92803194, now seen corresponding path program 1 times [2025-03-08 06:29:19,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:19,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129679530] [2025-03-08 06:29:19,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:19,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:19,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:29:19,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:29:19,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:19,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:19,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:19,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:19,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129679530] [2025-03-08 06:29:19,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129679530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:19,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:19,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:19,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333231096] [2025-03-08 06:29:19,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:19,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:19,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:19,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:19,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:19,627 INFO L87 Difference]: Start difference. First operand 659 states and 825 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:20,280 INFO L93 Difference]: Finished difference Result 1054 states and 1339 transitions. [2025-03-08 06:29:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:20,281 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-08 06:29:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:20,282 INFO L225 Difference]: With dead ends: 1054 [2025-03-08 06:29:20,282 INFO L226 Difference]: Without dead ends: 963 [2025-03-08 06:29:20,282 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-03-08 06:29:20,282 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 2783 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 1817 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2783 SdHoareTripleChecker+Valid, 2591 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:20,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2783 Valid, 2591 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1817 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:20,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-08 06:29:20,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 655. [2025-03-08 06:29:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 633 states have (on average 1.2954186413902053) internal successors, (820), 654 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 820 transitions. [2025-03-08 06:29:20,287 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 820 transitions. Word has length 98 [2025-03-08 06:29:20,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:20,287 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 820 transitions. [2025-03-08 06:29:20,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 820 transitions. [2025-03-08 06:29:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:29:20,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:20,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:20,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-03-08 06:29:20,288 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:20,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:20,288 INFO L85 PathProgramCache]: Analyzing trace with hash 693480606, now seen corresponding path program 1 times [2025-03-08 06:29:20,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:20,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915960211] [2025-03-08 06:29:20,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:20,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:20,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:29:20,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:29:20,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:20,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:20,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:20,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915960211] [2025-03-08 06:29:20,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915960211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:20,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:20,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:20,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960348216] [2025-03-08 06:29:20,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:20,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:20,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:20,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:20,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:20,462 INFO L87 Difference]: Start difference. First operand 655 states and 820 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:21,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:21,200 INFO L93 Difference]: Finished difference Result 1049 states and 1333 transitions. [2025-03-08 06:29:21,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:21,200 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-08 06:29:21,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:21,201 INFO L225 Difference]: With dead ends: 1049 [2025-03-08 06:29:21,201 INFO L226 Difference]: Without dead ends: 963 [2025-03-08 06:29:21,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:21,202 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 3402 mSDsluCounter, 2493 mSDsCounter, 0 mSdLazyCounter, 2162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3402 SdHoareTripleChecker+Valid, 3114 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:21,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3402 Valid, 3114 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2162 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:21,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-08 06:29:21,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 651. [2025-03-08 06:29:21,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 629 states have (on average 1.2957074721780604) internal successors, (815), 650 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 815 transitions. [2025-03-08 06:29:21,206 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 815 transitions. Word has length 98 [2025-03-08 06:29:21,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:21,206 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 815 transitions. [2025-03-08 06:29:21,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:21,206 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 815 transitions. [2025-03-08 06:29:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:29:21,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:21,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:21,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-03-08 06:29:21,207 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:21,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:21,207 INFO L85 PathProgramCache]: Analyzing trace with hash -886959925, now seen corresponding path program 1 times [2025-03-08 06:29:21,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:21,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813287522] [2025-03-08 06:29:21,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:21,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:21,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:29:21,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:29:21,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:21,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:21,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-03-08 06:29:21,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:21,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813287522] [2025-03-08 06:29:21,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813287522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:21,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:21,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:21,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749733265] [2025-03-08 06:29:21,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:21,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:21,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:21,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:21,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:21,364 INFO L87 Difference]: Start difference. First operand 651 states and 815 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:21,982 INFO L93 Difference]: Finished difference Result 1005 states and 1269 transitions. [2025-03-08 06:29:21,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:21,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-08 06:29:21,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:21,983 INFO L225 Difference]: With dead ends: 1005 [2025-03-08 06:29:21,983 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 06:29:21,983 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-03-08 06:29:21,984 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 3861 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3861 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:21,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3861 Valid, 2323 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1678 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:21,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 06:29:21,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 651. [2025-03-08 06:29:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 629 states have (on average 1.2941176470588236) internal successors, (814), 650 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 814 transitions. [2025-03-08 06:29:21,988 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 814 transitions. Word has length 98 [2025-03-08 06:29:21,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:21,988 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 814 transitions. [2025-03-08 06:29:21,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:21,988 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 814 transitions. [2025-03-08 06:29:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:29:21,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:21,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:21,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-03-08 06:29:21,989 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:21,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:21,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1055137532, now seen corresponding path program 1 times [2025-03-08 06:29:21,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:21,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361937880] [2025-03-08 06:29:21,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:21,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:22,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:29:22,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:29:22,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:22,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:22,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:22,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361937880] [2025-03-08 06:29:22,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361937880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:22,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:22,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:22,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805932381] [2025-03-08 06:29:22,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:22,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:22,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:22,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:22,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:22,127 INFO L87 Difference]: Start difference. First operand 651 states and 814 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:22,780 INFO L93 Difference]: Finished difference Result 1007 states and 1270 transitions. [2025-03-08 06:29:22,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:22,781 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-08 06:29:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:22,781 INFO L225 Difference]: With dead ends: 1007 [2025-03-08 06:29:22,781 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 06:29:22,782 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-03-08 06:29:22,782 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1969 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1969 SdHoareTripleChecker+Valid, 2307 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:22,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1969 Valid, 2307 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 06:29:22,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 647. [2025-03-08 06:29:22,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 625 states have (on average 1.2944) internal successors, (809), 646 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 809 transitions. [2025-03-08 06:29:22,786 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 809 transitions. Word has length 98 [2025-03-08 06:29:22,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:22,787 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 809 transitions. [2025-03-08 06:29:22,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 809 transitions. [2025-03-08 06:29:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:29:22,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:22,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:22,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-03-08 06:29:22,788 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:22,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:22,788 INFO L85 PathProgramCache]: Analyzing trace with hash 478268688, now seen corresponding path program 1 times [2025-03-08 06:29:22,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:22,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649672716] [2025-03-08 06:29:22,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:22,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:22,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:29:22,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:29:22,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:22,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:22,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:22,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649672716] [2025-03-08 06:29:22,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649672716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:22,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:22,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:22,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484291041] [2025-03-08 06:29:22,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:22,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:22,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:22,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:22,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:22,950 INFO L87 Difference]: Start difference. First operand 647 states and 809 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:23,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:23,649 INFO L93 Difference]: Finished difference Result 1045 states and 1325 transitions. [2025-03-08 06:29:23,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:23,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-08 06:29:23,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:23,651 INFO L225 Difference]: With dead ends: 1045 [2025-03-08 06:29:23,651 INFO L226 Difference]: Without dead ends: 959 [2025-03-08 06:29:23,651 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-03-08 06:29:23,651 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 2681 mSDsluCounter, 2030 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2681 SdHoareTripleChecker+Valid, 2659 SdHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:23,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2681 Valid, 2659 Invalid, 1847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:23,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-08 06:29:23,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 643. [2025-03-08 06:29:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 621 states have (on average 1.2946859903381642) internal successors, (804), 642 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 804 transitions. [2025-03-08 06:29:23,656 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 804 transitions. Word has length 98 [2025-03-08 06:29:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:23,656 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 804 transitions. [2025-03-08 06:29:23,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:23,656 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 804 transitions. [2025-03-08 06:29:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:29:23,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:23,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:23,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-03-08 06:29:23,657 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:23,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:23,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1026369542, now seen corresponding path program 1 times [2025-03-08 06:29:23,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:23,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517379227] [2025-03-08 06:29:23,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:23,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:23,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:29:23,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:29:23,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:23,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:23,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:23,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517379227] [2025-03-08 06:29:23,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517379227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:23,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:23,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:23,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935773194] [2025-03-08 06:29:23,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:23,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:23,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:23,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:23,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:23,797 INFO L87 Difference]: Start difference. First operand 643 states and 804 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:24,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:24,391 INFO L93 Difference]: Finished difference Result 1002 states and 1263 transitions. [2025-03-08 06:29:24,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:24,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-08 06:29:24,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:24,393 INFO L225 Difference]: With dead ends: 1002 [2025-03-08 06:29:24,393 INFO L226 Difference]: Without dead ends: 927 [2025-03-08 06:29:24,393 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-03-08 06:29:24,393 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 1953 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1953 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:24,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1953 Valid, 2359 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:24,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-08 06:29:24,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 643. [2025-03-08 06:29:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 621 states have (on average 1.2930756843800322) internal successors, (803), 642 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:24,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 803 transitions. [2025-03-08 06:29:24,397 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 803 transitions. Word has length 98 [2025-03-08 06:29:24,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:24,397 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 803 transitions. [2025-03-08 06:29:24,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:24,397 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 803 transitions. [2025-03-08 06:29:24,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:29:24,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:24,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:24,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-03-08 06:29:24,398 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:24,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:24,398 INFO L85 PathProgramCache]: Analyzing trace with hash -325296031, now seen corresponding path program 1 times [2025-03-08 06:29:24,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:24,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590182665] [2025-03-08 06:29:24,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:24,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:24,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:29:24,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:29:24,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:24,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:24,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:24,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590182665] [2025-03-08 06:29:24,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590182665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:24,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:24,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:24,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471894777] [2025-03-08 06:29:24,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:24,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:24,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:24,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:24,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:24,536 INFO L87 Difference]: Start difference. First operand 643 states and 803 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:25,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:25,132 INFO L93 Difference]: Finished difference Result 1001 states and 1261 transitions. [2025-03-08 06:29:25,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:25,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-08 06:29:25,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:25,134 INFO L225 Difference]: With dead ends: 1001 [2025-03-08 06:29:25,134 INFO L226 Difference]: Without dead ends: 927 [2025-03-08 06:29:25,134 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-03-08 06:29:25,134 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 1949 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 2339 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:25,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1949 Valid, 2339 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1703 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-08 06:29:25,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 639. [2025-03-08 06:29:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.293354943273906) internal successors, (798), 638 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 798 transitions. [2025-03-08 06:29:25,138 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 798 transitions. Word has length 98 [2025-03-08 06:29:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:25,138 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 798 transitions. [2025-03-08 06:29:25,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 798 transitions. [2025-03-08 06:29:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:29:25,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:25,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:25,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-03-08 06:29:25,139 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:25,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:25,140 INFO L85 PathProgramCache]: Analyzing trace with hash 990740774, now seen corresponding path program 1 times [2025-03-08 06:29:25,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:25,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373646446] [2025-03-08 06:29:25,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:25,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:25,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:29:25,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:29:25,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:25,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:25,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:25,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:25,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373646446] [2025-03-08 06:29:25,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373646446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:25,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:25,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:25,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727122623] [2025-03-08 06:29:25,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:25,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:25,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:25,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:25,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:25,320 INFO L87 Difference]: Start difference. First operand 639 states and 798 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:26,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:26,084 INFO L93 Difference]: Finished difference Result 1037 states and 1315 transitions. [2025-03-08 06:29:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:26,084 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-08 06:29:26,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:26,085 INFO L225 Difference]: With dead ends: 1037 [2025-03-08 06:29:26,086 INFO L226 Difference]: Without dead ends: 955 [2025-03-08 06:29:26,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:26,086 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 2489 mSDsluCounter, 2458 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2489 SdHoareTripleChecker+Valid, 3148 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:26,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2489 Valid, 3148 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2180 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:29:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-08 06:29:26,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 635. [2025-03-08 06:29:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.2936378466557912) internal successors, (793), 634 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:26,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 793 transitions. [2025-03-08 06:29:26,092 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 793 transitions. Word has length 98 [2025-03-08 06:29:26,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:26,092 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 793 transitions. [2025-03-08 06:29:26,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 793 transitions. [2025-03-08 06:29:26,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:29:26,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:26,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:26,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-03-08 06:29:26,093 INFO L396 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:26,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:26,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1468536854, now seen corresponding path program 1 times [2025-03-08 06:29:26,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:26,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732126980] [2025-03-08 06:29:26,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:26,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:26,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:29:26,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:29:26,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:26,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:26,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:26,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732126980] [2025-03-08 06:29:26,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732126980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:26,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:26,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:29:26,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621456618] [2025-03-08 06:29:26,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:26,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:26,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:26,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:26,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:26,516 INFO L87 Difference]: Start difference. First operand 635 states and 793 transitions. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:27,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:27,000 INFO L93 Difference]: Finished difference Result 988 states and 1265 transitions. [2025-03-08 06:29:27,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:29:27,001 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-08 06:29:27,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:27,002 INFO L225 Difference]: With dead ends: 988 [2025-03-08 06:29:27,002 INFO L226 Difference]: Without dead ends: 851 [2025-03-08 06:29:27,002 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-03-08 06:29:27,002 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 3486 mSDsluCounter, 5400 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3486 SdHoareTripleChecker+Valid, 6391 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:27,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3486 Valid, 6391 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:29:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-03-08 06:29:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 572. [2025-03-08 06:29:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 554 states have (on average 1.2906137184115523) internal successors, (715), 571 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 715 transitions. [2025-03-08 06:29:27,006 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 715 transitions. Word has length 99 [2025-03-08 06:29:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:27,006 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 715 transitions. [2025-03-08 06:29:27,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:27,006 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 715 transitions. [2025-03-08 06:29:27,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:29:27,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:27,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:27,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-03-08 06:29:27,007 INFO L396 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-08 06:29:27,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:27,007 INFO L85 PathProgramCache]: Analyzing trace with hash -472890075, now seen corresponding path program 1 times [2025-03-08 06:29:27,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:27,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178797375] [2025-03-08 06:29:27,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:27,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:27,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:29:27,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:29:27,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:27,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:27,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:27,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178797375] [2025-03-08 06:29:27,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178797375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:27,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:27,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:29:27,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345648484] [2025-03-08 06:29:27,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:27,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:29:27,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:27,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:29:27,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:29:27,431 INFO L87 Difference]: Start difference. First operand 572 states and 715 transitions. Second operand has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)