./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-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 f8b90978b682a83c8f6f0d2fe75b83e30918fdef6451144e6a40fff2a4b9e706 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:32:21,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:32:21,774 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:32:21,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:32:21,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:32:21,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:32:21,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:32:21,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:32:21,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:32:21,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:32:21,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:32:21,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:32:21,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:32:21,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:32:21,820 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:32:21,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:32:21,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:32:21,821 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:32:21,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:32:21,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:32:21,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:32:21,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:32:21,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:32:21,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:32:21,823 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:32:21,824 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:32:21,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:32:21,824 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:32:21,825 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:32:21,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:32:21,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:32:21,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:32:21,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:32:21,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:32:21,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:32:21,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:32:21,827 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:32:21,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:32:21,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:32:21,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:32:21,828 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:32:21,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:32:21,829 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> f8b90978b682a83c8f6f0d2fe75b83e30918fdef6451144e6a40fff2a4b9e706 [2024-10-12 20:32:22,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:32:22,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:32:22,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:32:22,115 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:32:22,115 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:32:22,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c [2024-10-12 20:32:23,538 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:32:24,146 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:32:24,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c [2024-10-12 20:32:24,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d0637f20/d44c1744c8f24da7ac4615b10957b8b6/FLAG88950d064 [2024-10-12 20:32:24,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d0637f20/d44c1744c8f24da7ac4615b10957b8b6 [2024-10-12 20:32:24,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:32:24,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:32:24,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:32:24,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:32:24,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:32:24,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:32:24" (1/1) ... [2024-10-12 20:32:24,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc271ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:24, skipping insertion in model container [2024-10-12 20:32:24,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:32:24" (1/1) ... [2024-10-12 20:32:24,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:32:26,105 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[172160,172173] [2024-10-12 20:32:26,344 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[250199,250212] [2024-10-12 20:32:26,432 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[289422,289435] [2024-10-12 20:32:26,476 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[309133,309146] [2024-10-12 20:32:26,499 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[319011,319024] [2024-10-12 20:32:26,513 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[323922,323935] [2024-10-12 20:32:26,525 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[328750,328763] [2024-10-12 20:32:26,682 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[405185,405198] [2024-10-12 20:32:26,762 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[443553,443566] [2024-10-12 20:32:26,821 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[463065,463078] [2024-10-12 20:32:26,842 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[472989,473002] [2024-10-12 20:32:26,855 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[477943,477956] [2024-10-12 20:32:26,866 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[482814,482827] [2024-10-12 20:32:26,942 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[521320,521333] [2024-10-12 20:32:26,981 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[540838,540851] [2024-10-12 20:32:27,003 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[550762,550775] [2024-10-12 20:32:27,014 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[555716,555729] [2024-10-12 20:32:27,026 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[560575,560588] [2024-10-12 20:32:27,072 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[581321,581334] [2024-10-12 20:32:27,102 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[591188,591201] [2024-10-12 20:32:27,115 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[596115,596128] [2024-10-12 20:32:27,127 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[600957,600970] [2024-10-12 20:32:27,142 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[606379,606392] [2024-10-12 20:32:27,154 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[611215,611228] [2024-10-12 20:32:27,166 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[616142,616155] [2024-10-12 20:32:27,177 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[620984,620997] [2024-10-12 20:32:27,189 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[626027,626040] [2024-10-12 20:32:27,202 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[631036,631049] [2024-10-12 20:32:27,215 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[635974,635987] [2024-10-12 20:32:27,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:32:27,345 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:32:27,704 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[172160,172173] [2024-10-12 20:32:27,887 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[250199,250212] [2024-10-12 20:32:27,972 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[289422,289435] [2024-10-12 20:32:28,016 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[309133,309146] [2024-10-12 20:32:28,039 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[319011,319024] [2024-10-12 20:32:28,051 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[323922,323935] [2024-10-12 20:32:28,065 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[328750,328763] [2024-10-12 20:32:28,217 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[405185,405198] [2024-10-12 20:32:28,296 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[443553,443566] [2024-10-12 20:32:28,339 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[463065,463078] [2024-10-12 20:32:28,362 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[472989,473002] [2024-10-12 20:32:28,374 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[477943,477956] [2024-10-12 20:32:28,385 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[482814,482827] [2024-10-12 20:32:28,458 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[521320,521333] [2024-10-12 20:32:28,537 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[540838,540851] [2024-10-12 20:32:28,558 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[550762,550775] [2024-10-12 20:32:28,569 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[555716,555729] [2024-10-12 20:32:28,580 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[560575,560588] [2024-10-12 20:32:28,622 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[581321,581334] [2024-10-12 20:32:28,642 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[591188,591201] [2024-10-12 20:32:28,652 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[596115,596128] [2024-10-12 20:32:28,663 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[600957,600970] [2024-10-12 20:32:28,674 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[606379,606392] [2024-10-12 20:32:28,684 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[611215,611228] [2024-10-12 20:32:28,695 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[616142,616155] [2024-10-12 20:32:28,705 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[620984,620997] [2024-10-12 20:32:28,719 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[626027,626040] [2024-10-12 20:32:28,730 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[631036,631049] [2024-10-12 20:32:28,742 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[635974,635987] [2024-10-12 20:32:28,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:32:28,830 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:32:28,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:28 WrapperNode [2024-10-12 20:32:28,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:32:28,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:32:28,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:32:28,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:32:28,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:28" (1/1) ... [2024-10-12 20:32:28,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:28" (1/1) ... [2024-10-12 20:32:29,367 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28257 [2024-10-12 20:32:29,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:32:29,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:32:29,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:32:29,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:32:29,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:28" (1/1) ... [2024-10-12 20:32:29,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:28" (1/1) ... [2024-10-12 20:32:29,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:28" (1/1) ... [2024-10-12 20:32:29,695 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]. [2024-10-12 20:32:29,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:28" (1/1) ... [2024-10-12 20:32:29,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:28" (1/1) ... [2024-10-12 20:32:30,015 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:28" (1/1) ... [2024-10-12 20:32:30,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:28" (1/1) ... [2024-10-12 20:32:30,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:28" (1/1) ... [2024-10-12 20:32:30,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:28" (1/1) ... [2024-10-12 20:32:30,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:32:30,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:32:30,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:32:30,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:32:30,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:28" (1/1) ... [2024-10-12 20:32:30,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:32:30,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:32:30,498 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) [2024-10-12 20:32:30,503 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 [2024-10-12 20:32:30,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:32:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:32:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:32:30,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:32:31,130 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:32:31,133 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:32:42,112 INFO L? ?]: Removed 5967 outVars from TransFormulas that were not future-live. [2024-10-12 20:32:42,112 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:32:42,293 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:32:42,294 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:32:42,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:32:42 BoogieIcfgContainer [2024-10-12 20:32:42,294 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:32:42,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:32:42,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:32:42,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:32:42,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:32:24" (1/3) ... [2024-10-12 20:32:42,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563f3a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:32:42, skipping insertion in model container [2024-10-12 20:32:42,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:28" (2/3) ... [2024-10-12 20:32:42,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563f3a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:32:42, skipping insertion in model container [2024-10-12 20:32:42,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:32:42" (3/3) ... [2024-10-12 20:32:42,306 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c [2024-10-12 20:32:42,324 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:32:42,324 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-10-12 20:32:42,507 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:32:42,516 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;@f28518b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:32:42,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-10-12 20:32:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 5465 states, 5435 states have (on average 1.7494020239190433) internal successors, (9508), 5464 states have internal predecessors, (9508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:42,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:32:42,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:42,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:42,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:42,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:42,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1843961460, now seen corresponding path program 1 times [2024-10-12 20:32:42,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:42,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007515343] [2024-10-12 20:32:42,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:42,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:43,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:43,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007515343] [2024-10-12 20:32:43,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007515343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:43,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:43,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:43,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748544516] [2024-10-12 20:32:43,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:43,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:43,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:43,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:43,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:43,779 INFO L87 Difference]: Start difference. First operand has 5465 states, 5435 states have (on average 1.7494020239190433) internal successors, (9508), 5464 states have internal predecessors, (9508), 0 states have call successors, (0), 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 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:48,352 INFO L93 Difference]: Finished difference Result 7467 states and 12787 transitions. [2024-10-12 20:32:48,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:48,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-12 20:32:48,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:48,404 INFO L225 Difference]: With dead ends: 7467 [2024-10-12 20:32:48,404 INFO L226 Difference]: Without dead ends: 4951 [2024-10-12 20:32:48,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:48,420 INFO L432 NwaCegarLoop]: 4240 mSDtfsCounter, 24929 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4159 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24929 SdHoareTripleChecker+Valid, 4344 SdHoareTripleChecker+Invalid, 4288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 4159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:48,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24929 Valid, 4344 Invalid, 4288 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [129 Valid, 4159 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-12 20:32:48,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2024-10-12 20:32:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 4951. [2024-10-12 20:32:48,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4951 states, 4922 states have (on average 1.2984559122308006) internal successors, (6391), 4950 states have internal predecessors, (6391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:48,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4951 states to 4951 states and 6391 transitions. [2024-10-12 20:32:48,629 INFO L78 Accepts]: Start accepts. Automaton has 4951 states and 6391 transitions. Word has length 101 [2024-10-12 20:32:48,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:48,631 INFO L471 AbstractCegarLoop]: Abstraction has 4951 states and 6391 transitions. [2024-10-12 20:32:48,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 4951 states and 6391 transitions. [2024-10-12 20:32:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:32:48,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:48,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:48,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:32:48,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:48,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:48,648 INFO L85 PathProgramCache]: Analyzing trace with hash -564189146, now seen corresponding path program 1 times [2024-10-12 20:32:48,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:48,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153994889] [2024-10-12 20:32:48,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:48,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:49,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:49,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153994889] [2024-10-12 20:32:49,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153994889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:49,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:49,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:49,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650367857] [2024-10-12 20:32:49,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:49,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:49,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:49,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:49,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:49,079 INFO L87 Difference]: Start difference. First operand 4951 states and 6391 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:51,704 INFO L93 Difference]: Finished difference Result 6083 states and 7846 transitions. [2024-10-12 20:32:51,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:51,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-12 20:32:51,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:51,717 INFO L225 Difference]: With dead ends: 6083 [2024-10-12 20:32:51,717 INFO L226 Difference]: Without dead ends: 3651 [2024-10-12 20:32:51,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:51,723 INFO L432 NwaCegarLoop]: 2186 mSDtfsCounter, 14196 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14196 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:51,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14196 Valid, 2206 Invalid, 2623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 20:32:51,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2024-10-12 20:32:51,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 3651. [2024-10-12 20:32:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3651 states, 3622 states have (on average 1.3169519602429598) internal successors, (4770), 3650 states have internal predecessors, (4770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 4770 transitions. [2024-10-12 20:32:51,805 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 4770 transitions. Word has length 101 [2024-10-12 20:32:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:51,806 INFO L471 AbstractCegarLoop]: Abstraction has 3651 states and 4770 transitions. [2024-10-12 20:32:51,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:51,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 4770 transitions. [2024-10-12 20:32:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:32:51,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:51,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:51,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:32:51,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:51,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:51,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1247482897, now seen corresponding path program 1 times [2024-10-12 20:32:51,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:51,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400601256] [2024-10-12 20:32:51,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:51,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:52,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:52,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400601256] [2024-10-12 20:32:52,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400601256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:52,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:52,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:52,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431127168] [2024-10-12 20:32:52,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:52,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:52,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:52,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:52,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:52,188 INFO L87 Difference]: Start difference. First operand 3651 states and 4770 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:53,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:53,851 INFO L93 Difference]: Finished difference Result 4495 states and 5840 transitions. [2024-10-12 20:32:53,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:53,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-12 20:32:53,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:53,860 INFO L225 Difference]: With dead ends: 4495 [2024-10-12 20:32:53,860 INFO L226 Difference]: Without dead ends: 2719 [2024-10-12 20:32:53,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:53,865 INFO L432 NwaCegarLoop]: 1678 mSDtfsCounter, 10619 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10619 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:53,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10619 Valid, 1706 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 20:32:53,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2024-10-12 20:32:53,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2719. [2024-10-12 20:32:53,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2719 states, 2690 states have (on average 1.3312267657992565) internal successors, (3581), 2718 states have internal predecessors, (3581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 3581 transitions. [2024-10-12 20:32:53,914 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 3581 transitions. Word has length 101 [2024-10-12 20:32:53,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:53,915 INFO L471 AbstractCegarLoop]: Abstraction has 2719 states and 3581 transitions. [2024-10-12 20:32:53,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:53,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 3581 transitions. [2024-10-12 20:32:53,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 20:32:53,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:53,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:53,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:32:53,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:53,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:53,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1413940705, now seen corresponding path program 1 times [2024-10-12 20:32:53,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:53,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644438628] [2024-10-12 20:32:53,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:53,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:54,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:54,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644438628] [2024-10-12 20:32:54,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644438628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:54,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:54,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:54,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462295269] [2024-10-12 20:32:54,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:54,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:54,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:54,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:54,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:54,327 INFO L87 Difference]: Start difference. First operand 2719 states and 3581 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:56,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:56,609 INFO L93 Difference]: Finished difference Result 5190 states and 6870 transitions. [2024-10-12 20:32:56,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:56,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-10-12 20:32:56,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:56,622 INFO L225 Difference]: With dead ends: 5190 [2024-10-12 20:32:56,623 INFO L226 Difference]: Without dead ends: 3794 [2024-10-12 20:32:56,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:56,627 INFO L432 NwaCegarLoop]: 1651 mSDtfsCounter, 13357 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13357 SdHoareTripleChecker+Valid, 2502 SdHoareTripleChecker+Invalid, 2563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:56,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13357 Valid, 2502 Invalid, 2563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2552 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 20:32:56,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2024-10-12 20:32:56,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3595. [2024-10-12 20:32:56,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3595 states, 3566 states have (on average 1.3611890072910824) internal successors, (4854), 3594 states have internal predecessors, (4854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 4854 transitions. [2024-10-12 20:32:56,711 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 4854 transitions. Word has length 103 [2024-10-12 20:32:56,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:56,711 INFO L471 AbstractCegarLoop]: Abstraction has 3595 states and 4854 transitions. [2024-10-12 20:32:56,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:56,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 4854 transitions. [2024-10-12 20:32:56,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 20:32:56,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:56,719 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:56,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:32:56,719 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:56,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:56,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2001631897, now seen corresponding path program 1 times [2024-10-12 20:32:56,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:56,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999965963] [2024-10-12 20:32:56,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:56,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:57,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:57,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:57,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999965963] [2024-10-12 20:32:57,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999965963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:57,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:57,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:57,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4992497] [2024-10-12 20:32:57,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:57,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:57,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:57,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:57,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:57,006 INFO L87 Difference]: Start difference. First operand 3595 states and 4854 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:58,271 INFO L93 Difference]: Finished difference Result 5207 states and 7044 transitions. [2024-10-12 20:32:58,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:58,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-10-12 20:32:58,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:58,280 INFO L225 Difference]: With dead ends: 5207 [2024-10-12 20:32:58,281 INFO L226 Difference]: Without dead ends: 3372 [2024-10-12 20:32:58,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:58,285 INFO L432 NwaCegarLoop]: 1562 mSDtfsCounter, 9364 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9364 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:58,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9364 Valid, 1574 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:32:58,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2024-10-12 20:32:58,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 3372. [2024-10-12 20:32:58,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3372 states, 3343 states have (on average 1.3691295243793) internal successors, (4577), 3371 states have internal predecessors, (4577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:58,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 4577 transitions. [2024-10-12 20:32:58,358 INFO L78 Accepts]: Start accepts. Automaton has 3372 states and 4577 transitions. Word has length 105 [2024-10-12 20:32:58,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:58,359 INFO L471 AbstractCegarLoop]: Abstraction has 3372 states and 4577 transitions. [2024-10-12 20:32:58,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:58,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3372 states and 4577 transitions. [2024-10-12 20:32:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 20:32:58,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:58,366 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:58,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:32:58,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:58,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:58,367 INFO L85 PathProgramCache]: Analyzing trace with hash -807434659, now seen corresponding path program 1 times [2024-10-12 20:32:58,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:58,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846736390] [2024-10-12 20:32:58,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:58,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:58,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:58,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846736390] [2024-10-12 20:32:58,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846736390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:58,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:58,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:58,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177508661] [2024-10-12 20:32:58,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:58,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:58,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:58,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:58,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:58,639 INFO L87 Difference]: Start difference. First operand 3372 states and 4577 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:59,538 INFO L93 Difference]: Finished difference Result 3763 states and 5049 transitions. [2024-10-12 20:32:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:59,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-10-12 20:32:59,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:59,543 INFO L225 Difference]: With dead ends: 3763 [2024-10-12 20:32:59,543 INFO L226 Difference]: Without dead ends: 2161 [2024-10-12 20:32:59,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:59,546 INFO L432 NwaCegarLoop]: 1001 mSDtfsCounter, 5826 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5826 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:59,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5826 Valid, 1045 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:32:59,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2024-10-12 20:32:59,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2161. [2024-10-12 20:32:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2161 states, 2132 states have (on average 1.3813320825515947) internal successors, (2945), 2160 states have internal predecessors, (2945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 2945 transitions. [2024-10-12 20:32:59,587 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 2945 transitions. Word has length 107 [2024-10-12 20:32:59,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:59,588 INFO L471 AbstractCegarLoop]: Abstraction has 2161 states and 2945 transitions. [2024-10-12 20:32:59,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2945 transitions. [2024-10-12 20:32:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-12 20:32:59,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:59,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:59,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:32:59,594 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:59,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1740881091, now seen corresponding path program 1 times [2024-10-12 20:32:59,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:59,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495063451] [2024-10-12 20:32:59,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:59,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:59,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:59,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495063451] [2024-10-12 20:32:59,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495063451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:59,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:59,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:59,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215760664] [2024-10-12 20:32:59,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:59,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:59,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:59,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:59,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:59,851 INFO L87 Difference]: Start difference. First operand 2161 states and 2945 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:00,437 INFO L93 Difference]: Finished difference Result 2834 states and 3838 transitions. [2024-10-12 20:33:00,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:33:00,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-10-12 20:33:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:00,443 INFO L225 Difference]: With dead ends: 2834 [2024-10-12 20:33:00,443 INFO L226 Difference]: Without dead ends: 1733 [2024-10-12 20:33:00,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:33:00,446 INFO L432 NwaCegarLoop]: 888 mSDtfsCounter, 4688 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4688 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:00,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4688 Valid, 924 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:33:00,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2024-10-12 20:33:00,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1733. [2024-10-12 20:33:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3943661971830985) internal successors, (2376), 1732 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2376 transitions. [2024-10-12 20:33:00,474 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2376 transitions. Word has length 109 [2024-10-12 20:33:00,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:00,474 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2376 transitions. [2024-10-12 20:33:00,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2376 transitions. [2024-10-12 20:33:00,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:00,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:00,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:00,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:33:00,478 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:00,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:00,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1649960662, now seen corresponding path program 1 times [2024-10-12 20:33:00,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:00,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359491281] [2024-10-12 20:33:00,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:00,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:01,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:01,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:01,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359491281] [2024-10-12 20:33:01,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359491281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:01,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:01,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:33:01,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922441178] [2024-10-12 20:33:01,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:01,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:33:01,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:01,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:33:01,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:33:01,378 INFO L87 Difference]: Start difference. First operand 1733 states and 2376 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:04,061 INFO L93 Difference]: Finished difference Result 3017 states and 4152 transitions. [2024-10-12 20:33:04,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:33:04,062 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:04,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:04,069 INFO L225 Difference]: With dead ends: 3017 [2024-10-12 20:33:04,069 INFO L226 Difference]: Without dead ends: 2713 [2024-10-12 20:33:04,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2024-10-12 20:33:04,072 INFO L432 NwaCegarLoop]: 928 mSDtfsCounter, 4120 mSDsluCounter, 5497 mSDsCounter, 0 mSdLazyCounter, 4735 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4120 SdHoareTripleChecker+Valid, 6425 SdHoareTripleChecker+Invalid, 4742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:04,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4120 Valid, 6425 Invalid, 4742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4735 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 20:33:04,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2024-10-12 20:33:04,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 1737. [2024-10-12 20:33:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1708 states have (on average 1.3934426229508197) internal successors, (2380), 1736 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2380 transitions. [2024-10-12 20:33:04,121 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2380 transitions. Word has length 111 [2024-10-12 20:33:04,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:04,121 INFO L471 AbstractCegarLoop]: Abstraction has 1737 states and 2380 transitions. [2024-10-12 20:33:04,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:04,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2380 transitions. [2024-10-12 20:33:04,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:04,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:04,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:04,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:33:04,127 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:04,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:04,127 INFO L85 PathProgramCache]: Analyzing trace with hash -447488662, now seen corresponding path program 1 times [2024-10-12 20:33:04,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:04,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644370962] [2024-10-12 20:33:04,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:04,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:04,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:04,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644370962] [2024-10-12 20:33:04,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644370962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:04,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:04,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:04,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100011847] [2024-10-12 20:33:04,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:04,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:04,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:04,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:04,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:04,803 INFO L87 Difference]: Start difference. First operand 1737 states and 2380 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:06,707 INFO L93 Difference]: Finished difference Result 2803 states and 3837 transitions. [2024-10-12 20:33:06,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:33:06,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:06,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:06,715 INFO L225 Difference]: With dead ends: 2803 [2024-10-12 20:33:06,715 INFO L226 Difference]: Without dead ends: 2384 [2024-10-12 20:33:06,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:33:06,718 INFO L432 NwaCegarLoop]: 929 mSDtfsCounter, 6581 mSDsluCounter, 3199 mSDsCounter, 0 mSdLazyCounter, 3019 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6581 SdHoareTripleChecker+Valid, 4128 SdHoareTripleChecker+Invalid, 3023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:06,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6581 Valid, 4128 Invalid, 3023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3019 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 20:33:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2024-10-12 20:33:06,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 1733. [2024-10-12 20:33:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3937793427230047) internal successors, (2375), 1732 states have internal predecessors, (2375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2375 transitions. [2024-10-12 20:33:06,767 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2375 transitions. Word has length 111 [2024-10-12 20:33:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:06,768 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2375 transitions. [2024-10-12 20:33:06,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2375 transitions. [2024-10-12 20:33:06,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:06,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:06,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:06,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:33:06,773 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:06,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:06,774 INFO L85 PathProgramCache]: Analyzing trace with hash 258839018, now seen corresponding path program 1 times [2024-10-12 20:33:06,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:06,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173886481] [2024-10-12 20:33:06,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:06,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:07,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:07,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173886481] [2024-10-12 20:33:07,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173886481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:07,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:07,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:07,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319484812] [2024-10-12 20:33:07,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:07,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:07,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:07,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:07,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:07,556 INFO L87 Difference]: Start difference. First operand 1733 states and 2375 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:09,425 INFO L93 Difference]: Finished difference Result 2986 states and 4119 transitions. [2024-10-12 20:33:09,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:33:09,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:09,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:09,436 INFO L225 Difference]: With dead ends: 2986 [2024-10-12 20:33:09,436 INFO L226 Difference]: Without dead ends: 2703 [2024-10-12 20:33:09,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:33:09,439 INFO L432 NwaCegarLoop]: 1129 mSDtfsCounter, 5891 mSDsluCounter, 3806 mSDsCounter, 0 mSdLazyCounter, 3561 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5891 SdHoareTripleChecker+Valid, 4935 SdHoareTripleChecker+Invalid, 3565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:09,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5891 Valid, 4935 Invalid, 3565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3561 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 20:33:09,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2024-10-12 20:33:09,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 1733. [2024-10-12 20:33:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3931924882629108) internal successors, (2374), 1732 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2374 transitions. [2024-10-12 20:33:09,475 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2374 transitions. Word has length 111 [2024-10-12 20:33:09,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:09,476 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2374 transitions. [2024-10-12 20:33:09,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2374 transitions. [2024-10-12 20:33:09,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:09,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:09,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:09,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:33:09,480 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:09,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:09,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1796391338, now seen corresponding path program 1 times [2024-10-12 20:33:09,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:09,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942829647] [2024-10-12 20:33:09,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:09,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:10,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:10,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942829647] [2024-10-12 20:33:10,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942829647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:10,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:10,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:33:10,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130536646] [2024-10-12 20:33:10,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:10,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:33:10,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:10,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:33:10,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:33:10,107 INFO L87 Difference]: Start difference. First operand 1733 states and 2374 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:11,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:11,474 INFO L93 Difference]: Finished difference Result 3006 states and 3984 transitions. [2024-10-12 20:33:11,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:33:11,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:11,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:11,478 INFO L225 Difference]: With dead ends: 3006 [2024-10-12 20:33:11,478 INFO L226 Difference]: Without dead ends: 2275 [2024-10-12 20:33:11,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:33:11,480 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 4486 mSDsluCounter, 1869 mSDsCounter, 0 mSdLazyCounter, 2807 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4486 SdHoareTripleChecker+Valid, 2649 SdHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:11,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4486 Valid, 2649 Invalid, 2808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2807 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:33:11,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2024-10-12 20:33:11,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 1733. [2024-10-12 20:33:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.392605633802817) internal successors, (2373), 1732 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2373 transitions. [2024-10-12 20:33:11,504 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2373 transitions. Word has length 111 [2024-10-12 20:33:11,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:11,505 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2373 transitions. [2024-10-12 20:33:11,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:11,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2373 transitions. [2024-10-12 20:33:11,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:33:11,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:11,508 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:11,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:33:11,508 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:11,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:11,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1942312309, now seen corresponding path program 1 times [2024-10-12 20:33:11,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:11,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645181841] [2024-10-12 20:33:11,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:11,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:12,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:12,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645181841] [2024-10-12 20:33:12,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645181841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:12,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:12,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:12,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963458979] [2024-10-12 20:33:12,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:12,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:12,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:12,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:12,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:12,047 INFO L87 Difference]: Start difference. First operand 1733 states and 2373 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:13,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:13,804 INFO L93 Difference]: Finished difference Result 2892 states and 3979 transitions. [2024-10-12 20:33:13,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:33:13,804 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-12 20:33:13,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:13,808 INFO L225 Difference]: With dead ends: 2892 [2024-10-12 20:33:13,808 INFO L226 Difference]: Without dead ends: 2672 [2024-10-12 20:33:13,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:33:13,810 INFO L432 NwaCegarLoop]: 1079 mSDtfsCounter, 4864 mSDsluCounter, 4426 mSDsCounter, 0 mSdLazyCounter, 3915 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4864 SdHoareTripleChecker+Valid, 5505 SdHoareTripleChecker+Invalid, 3919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:13,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4864 Valid, 5505 Invalid, 3919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3915 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 20:33:13,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2024-10-12 20:33:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1733. [2024-10-12 20:33:13,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.392018779342723) internal successors, (2372), 1732 states have internal predecessors, (2372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:13,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2372 transitions. [2024-10-12 20:33:13,837 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2372 transitions. Word has length 112 [2024-10-12 20:33:13,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:13,837 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2372 transitions. [2024-10-12 20:33:13,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:13,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2372 transitions. [2024-10-12 20:33:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 20:33:13,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:13,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:13,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:33:13,841 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:13,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1274182513, now seen corresponding path program 1 times [2024-10-12 20:33:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:13,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589609871] [2024-10-12 20:33:13,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:13,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:14,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:14,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:14,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589609871] [2024-10-12 20:33:14,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589609871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:14,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:14,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:14,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866361651] [2024-10-12 20:33:14,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:14,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:14,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:14,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:14,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:14,317 INFO L87 Difference]: Start difference. First operand 1733 states and 2372 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:15,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:15,832 INFO L93 Difference]: Finished difference Result 2869 states and 3933 transitions. [2024-10-12 20:33:15,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:33:15,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-12 20:33:15,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:15,837 INFO L225 Difference]: With dead ends: 2869 [2024-10-12 20:33:15,837 INFO L226 Difference]: Without dead ends: 2648 [2024-10-12 20:33:15,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:33:15,838 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 6411 mSDsluCounter, 3222 mSDsCounter, 0 mSdLazyCounter, 3112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6411 SdHoareTripleChecker+Valid, 4177 SdHoareTripleChecker+Invalid, 3116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:15,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6411 Valid, 4177 Invalid, 3116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3112 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:33:15,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2024-10-12 20:33:15,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1733. [2024-10-12 20:33:15,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3908450704225352) internal successors, (2370), 1732 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2370 transitions. [2024-10-12 20:33:15,863 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2370 transitions. Word has length 113 [2024-10-12 20:33:15,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:15,864 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2370 transitions. [2024-10-12 20:33:15,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:15,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2370 transitions. [2024-10-12 20:33:15,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 20:33:15,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:15,867 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:15,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:33:15,868 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:15,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:15,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1550993935, now seen corresponding path program 1 times [2024-10-12 20:33:15,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:15,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000609533] [2024-10-12 20:33:15,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:15,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:16,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:16,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:16,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000609533] [2024-10-12 20:33:16,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000609533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:16,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:16,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:16,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679216803] [2024-10-12 20:33:16,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:16,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:16,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:16,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:16,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:16,449 INFO L87 Difference]: Start difference. First operand 1733 states and 2370 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:18,180 INFO L93 Difference]: Finished difference Result 3102 states and 4268 transitions. [2024-10-12 20:33:18,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:33:18,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-12 20:33:18,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:18,185 INFO L225 Difference]: With dead ends: 3102 [2024-10-12 20:33:18,185 INFO L226 Difference]: Without dead ends: 2703 [2024-10-12 20:33:18,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:33:18,186 INFO L432 NwaCegarLoop]: 1129 mSDtfsCounter, 5876 mSDsluCounter, 3806 mSDsCounter, 0 mSdLazyCounter, 3546 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5876 SdHoareTripleChecker+Valid, 4935 SdHoareTripleChecker+Invalid, 3550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:18,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5876 Valid, 4935 Invalid, 3550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3546 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 20:33:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2024-10-12 20:33:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 1733. [2024-10-12 20:33:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3896713615023475) internal successors, (2368), 1732 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:18,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2368 transitions. [2024-10-12 20:33:18,213 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2368 transitions. Word has length 113 [2024-10-12 20:33:18,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:18,213 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2368 transitions. [2024-10-12 20:33:18,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2368 transitions. [2024-10-12 20:33:18,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 20:33:18,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:18,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:18,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:33:18,217 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:18,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:18,218 INFO L85 PathProgramCache]: Analyzing trace with hash 415339855, now seen corresponding path program 1 times [2024-10-12 20:33:18,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:18,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104658402] [2024-10-12 20:33:18,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:18,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:18,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:18,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104658402] [2024-10-12 20:33:18,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104658402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:18,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:18,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:18,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505120595] [2024-10-12 20:33:18,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:18,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:18,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:18,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:18,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:18,679 INFO L87 Difference]: Start difference. First operand 1733 states and 2368 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:20,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:20,125 INFO L93 Difference]: Finished difference Result 2537 states and 3485 transitions. [2024-10-12 20:33:20,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:33:20,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-12 20:33:20,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:20,128 INFO L225 Difference]: With dead ends: 2537 [2024-10-12 20:33:20,128 INFO L226 Difference]: Without dead ends: 1823 [2024-10-12 20:33:20,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:33:20,130 INFO L432 NwaCegarLoop]: 929 mSDtfsCounter, 2625 mSDsluCounter, 3196 mSDsCounter, 0 mSdLazyCounter, 2996 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2625 SdHoareTripleChecker+Valid, 4125 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:20,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2625 Valid, 4125 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2996 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:33:20,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2024-10-12 20:33:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1733. [2024-10-12 20:33:20,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3884976525821595) internal successors, (2366), 1732 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2366 transitions. [2024-10-12 20:33:20,149 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2366 transitions. Word has length 113 [2024-10-12 20:33:20,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:20,149 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2366 transitions. [2024-10-12 20:33:20,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2366 transitions. [2024-10-12 20:33:20,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 20:33:20,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:20,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:20,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:33:20,153 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:20,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:20,154 INFO L85 PathProgramCache]: Analyzing trace with hash 137094735, now seen corresponding path program 1 times [2024-10-12 20:33:20,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:20,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794884240] [2024-10-12 20:33:20,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:20,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:20,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:20,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794884240] [2024-10-12 20:33:20,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794884240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:20,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:20,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:33:20,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719723586] [2024-10-12 20:33:20,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:20,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:33:20,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:20,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:33:20,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:33:20,909 INFO L87 Difference]: Start difference. First operand 1733 states and 2366 transitions. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:23,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:23,713 INFO L93 Difference]: Finished difference Result 3751 states and 5223 transitions. [2024-10-12 20:33:23,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 20:33:23,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-12 20:33:23,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:23,720 INFO L225 Difference]: With dead ends: 3751 [2024-10-12 20:33:23,720 INFO L226 Difference]: Without dead ends: 3447 [2024-10-12 20:33:23,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-12 20:33:23,722 INFO L432 NwaCegarLoop]: 1371 mSDtfsCounter, 9418 mSDsluCounter, 6333 mSDsCounter, 0 mSdLazyCounter, 5660 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9418 SdHoareTripleChecker+Valid, 7704 SdHoareTripleChecker+Invalid, 5960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 5660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:23,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9418 Valid, 7704 Invalid, 5960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 5660 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 20:33:23,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2024-10-12 20:33:23,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 1738. [2024-10-12 20:33:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1709 states have (on average 1.387361029842013) internal successors, (2371), 1737 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2371 transitions. [2024-10-12 20:33:23,752 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2371 transitions. Word has length 113 [2024-10-12 20:33:23,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:23,752 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2371 transitions. [2024-10-12 20:33:23,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:23,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2371 transitions. [2024-10-12 20:33:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 20:33:23,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:23,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:23,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:33:23,755 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:23,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:23,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1339566735, now seen corresponding path program 1 times [2024-10-12 20:33:23,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:23,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289016688] [2024-10-12 20:33:23,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:23,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:24,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:24,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289016688] [2024-10-12 20:33:24,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289016688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:24,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:24,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:24,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299610629] [2024-10-12 20:33:24,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:24,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:24,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:24,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:24,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:24,169 INFO L87 Difference]: Start difference. First operand 1738 states and 2371 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:25,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:25,744 INFO L93 Difference]: Finished difference Result 2852 states and 3900 transitions. [2024-10-12 20:33:25,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:33:25,745 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-12 20:33:25,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:25,750 INFO L225 Difference]: With dead ends: 2852 [2024-10-12 20:33:25,750 INFO L226 Difference]: Without dead ends: 2653 [2024-10-12 20:33:25,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:33:25,752 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 6398 mSDsluCounter, 3222 mSDsCounter, 0 mSdLazyCounter, 3101 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6398 SdHoareTripleChecker+Valid, 4177 SdHoareTripleChecker+Invalid, 3105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:25,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6398 Valid, 4177 Invalid, 3105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3101 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 20:33:25,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2024-10-12 20:33:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 1738. [2024-10-12 20:33:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1709 states have (on average 1.3867758923346987) internal successors, (2370), 1737 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2370 transitions. [2024-10-12 20:33:25,779 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2370 transitions. Word has length 113 [2024-10-12 20:33:25,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:25,780 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2370 transitions. [2024-10-12 20:33:25,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:25,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2370 transitions. [2024-10-12 20:33:25,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 20:33:25,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:25,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:25,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:33:25,783 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:25,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:25,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1336243889, now seen corresponding path program 1 times [2024-10-12 20:33:25,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:25,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897917791] [2024-10-12 20:33:25,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:25,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:26,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:26,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897917791] [2024-10-12 20:33:26,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897917791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:26,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:26,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:26,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618924520] [2024-10-12 20:33:26,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:26,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:26,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:26,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:26,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:26,207 INFO L87 Difference]: Start difference. First operand 1738 states and 2370 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:27,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:27,907 INFO L93 Difference]: Finished difference Result 2905 states and 3983 transitions. [2024-10-12 20:33:27,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:33:27,908 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-12 20:33:27,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:27,912 INFO L225 Difference]: With dead ends: 2905 [2024-10-12 20:33:27,912 INFO L226 Difference]: Without dead ends: 2677 [2024-10-12 20:33:27,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:33:27,914 INFO L432 NwaCegarLoop]: 1107 mSDtfsCounter, 3779 mSDsluCounter, 3712 mSDsCounter, 0 mSdLazyCounter, 3571 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3779 SdHoareTripleChecker+Valid, 4819 SdHoareTripleChecker+Invalid, 3575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:27,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3779 Valid, 4819 Invalid, 3575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3571 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 20:33:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2024-10-12 20:33:27,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 1738. [2024-10-12 20:33:27,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1709 states have (on average 1.3861907548273844) internal successors, (2369), 1737 states have internal predecessors, (2369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2369 transitions. [2024-10-12 20:33:27,941 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2369 transitions. Word has length 113 [2024-10-12 20:33:27,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:27,941 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2369 transitions. [2024-10-12 20:33:27,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2369 transitions. [2024-10-12 20:33:27,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 20:33:27,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:27,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:27,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:33:27,944 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:27,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:27,945 INFO L85 PathProgramCache]: Analyzing trace with hash -254149035, now seen corresponding path program 1 times [2024-10-12 20:33:27,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:27,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050901320] [2024-10-12 20:33:27,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:27,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:28,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:28,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050901320] [2024-10-12 20:33:28,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050901320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:28,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:28,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:28,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302265770] [2024-10-12 20:33:28,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:28,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:28,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:28,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:28,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:28,435 INFO L87 Difference]: Start difference. First operand 1738 states and 2369 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:30,277 INFO L93 Difference]: Finished difference Result 2844 states and 3889 transitions. [2024-10-12 20:33:30,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:33:30,277 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-12 20:33:30,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:30,280 INFO L225 Difference]: With dead ends: 2844 [2024-10-12 20:33:30,281 INFO L226 Difference]: Without dead ends: 2653 [2024-10-12 20:33:30,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:33:30,282 INFO L432 NwaCegarLoop]: 1061 mSDtfsCounter, 4901 mSDsluCounter, 4330 mSDsCounter, 0 mSdLazyCounter, 3840 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4901 SdHoareTripleChecker+Valid, 5391 SdHoareTripleChecker+Invalid, 3844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:30,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4901 Valid, 5391 Invalid, 3844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3840 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 20:33:30,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2024-10-12 20:33:30,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 1738. [2024-10-12 20:33:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1709 states have (on average 1.3856056173200701) internal successors, (2368), 1737 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2368 transitions. [2024-10-12 20:33:30,308 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2368 transitions. Word has length 113 [2024-10-12 20:33:30,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:30,308 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2368 transitions. [2024-10-12 20:33:30,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:30,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2368 transitions. [2024-10-12 20:33:30,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-12 20:33:30,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:30,311 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:30,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:33:30,312 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:30,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:30,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1228824528, now seen corresponding path program 1 times [2024-10-12 20:33:30,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:30,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131403293] [2024-10-12 20:33:30,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:30,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms