./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 03:51:38,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:51:38,291 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:51:38,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:51:38,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:51:38,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:51:38,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:51:38,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:51:38,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:51:38,334 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:51:38,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:51:38,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:51:38,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:51:38,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:51:38,336 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:51:38,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:51:38,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:51:38,337 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:51:38,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:51:38,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:51:38,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:51:38,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:51:38,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:51:38,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:51:38,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:51:38,343 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:51:38,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:51:38,343 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:51:38,344 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:51:38,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:51:38,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:51:38,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:51:38,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:51:38,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:51:38,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:51:38,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:51:38,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:51:38,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:51:38,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:51:38,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:51:38,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:51:38,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:51:38,348 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-clean/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-clean/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-11 03:51:38,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:51:38,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:51:38,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:51:38,651 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:51:38,651 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:51:38,653 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-11 03:51:40,213 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:51:40,917 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:51:40,918 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-11 03:51:40,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f46428cb8/1f706dbc696040a5baee9ad636dcbfe0/FLAGbe831e5ec [2024-10-11 03:51:41,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f46428cb8/1f706dbc696040a5baee9ad636dcbfe0 [2024-10-11 03:51:41,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:51:41,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:51:41,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:51:41,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:51:41,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:51:41,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:51:41" (1/1) ... [2024-10-11 03:51:41,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e7bc247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:41, skipping insertion in model container [2024-10-11 03:51:41,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:51:41" (1/1) ... [2024-10-11 03:51:41,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:51:42,497 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-11 03:51:42,696 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-11 03:51:42,789 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-11 03:51:42,834 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-11 03:51:42,857 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-11 03:51:42,870 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-11 03:51:42,882 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-11 03:51:43,094 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-11 03:51:43,173 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-11 03:51:43,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[463065,463078] [2024-10-11 03:51:43,237 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-11 03:51:43,253 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-11 03:51:43,266 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-11 03:51:43,346 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-11 03:51:43,387 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-11 03:51:43,410 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-11 03:51:43,422 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-11 03:51:43,434 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-11 03:51:43,478 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-11 03:51:43,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[591188,591201] [2024-10-11 03:51:43,511 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-11 03:51:43,523 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-11 03:51:43,577 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-11 03:51:43,591 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-11 03:51:43,604 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-11 03:51:43,618 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-11 03:51:43,631 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-11 03:51:43,644 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-11 03:51:43,657 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-11 03:51:43,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:51:43,776 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:51:44,150 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-11 03:51:44,308 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-11 03:51:44,388 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-11 03:51:44,430 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-11 03:51:44,451 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-11 03:51:44,463 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-11 03:51:44,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[328750,328763] [2024-10-11 03:51:44,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[405185,405198] [2024-10-11 03:51:44,741 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-11 03:51:44,778 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-11 03:51:44,798 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-11 03:51:44,808 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-11 03:51:44,818 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-11 03:51:44,890 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-11 03:51:44,925 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-11 03:51:44,945 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-11 03:51:44,955 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-11 03:51:44,965 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-11 03:51:45,004 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-11 03:51:45,023 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-11 03:51:45,033 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-11 03:51:45,043 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-11 03:51:45,054 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-11 03:51:45,064 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-11 03:51:45,074 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-11 03:51:45,084 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-11 03:51:45,098 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-11 03:51:45,109 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-11 03:51:45,119 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-11 03:51:45,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:51:45,208 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:51:45,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:45 WrapperNode [2024-10-11 03:51:45,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:51:45,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:51:45,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:51:45,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:51:45,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:45" (1/1) ... [2024-10-11 03:51:45,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:45" (1/1) ... [2024-10-11 03:51:45,747 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28257 [2024-10-11 03:51:45,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:51:45,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:51:45,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:51:45,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:51:45,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:45" (1/1) ... [2024-10-11 03:51:45,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:45" (1/1) ... [2024-10-11 03:51:45,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:45" (1/1) ... [2024-10-11 03:51:46,049 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-11 03:51:46,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:45" (1/1) ... [2024-10-11 03:51:46,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:45" (1/1) ... [2024-10-11 03:51:46,198 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:45" (1/1) ... [2024-10-11 03:51:46,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:45" (1/1) ... [2024-10-11 03:51:46,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:45" (1/1) ... [2024-10-11 03:51:46,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:45" (1/1) ... [2024-10-11 03:51:46,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:51:46,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:51:46,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:51:46,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:51:46,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:45" (1/1) ... [2024-10-11 03:51:46,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:51:46,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:51:46,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:51:46,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:51:46,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:51:46,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:51:46,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:51:46,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:51:47,149 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:51:47,150 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:51:57,810 INFO L? ?]: Removed 5967 outVars from TransFormulas that were not future-live. [2024-10-11 03:51:57,810 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:51:58,013 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:51:58,014 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:51:58,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:51:58 BoogieIcfgContainer [2024-10-11 03:51:58,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:51:58,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:51:58,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:51:58,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:51:58,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:51:41" (1/3) ... [2024-10-11 03:51:58,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704d457c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:51:58, skipping insertion in model container [2024-10-11 03:51:58,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:45" (2/3) ... [2024-10-11 03:51:58,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704d457c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:51:58, skipping insertion in model container [2024-10-11 03:51:58,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:51:58" (3/3) ... [2024-10-11 03:51:58,025 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c [2024-10-11 03:51:58,044 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:51:58,044 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-10-11 03:51:58,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:51:58,235 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;@43f0d87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:51:58,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-10-11 03:51:58,260 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-11 03:51:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 03:51:58,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:58,320 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-11 03:51:58,321 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-11 03:51:58,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:58,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1843961460, now seen corresponding path program 1 times [2024-10-11 03:51:58,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:58,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471971587] [2024-10-11 03:51:58,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:58,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:59,488 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-11 03:51:59,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:59,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471971587] [2024-10-11 03:51:59,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471971587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:59,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:59,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:59,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675160276] [2024-10-11 03:51:59,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:59,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:59,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:59,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:59,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:59,538 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-11 03:52:03,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:03,740 INFO L93 Difference]: Finished difference Result 7467 states and 12787 transitions. [2024-10-11 03:52:03,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:52:03,742 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-11 03:52:03,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:03,781 INFO L225 Difference]: With dead ends: 7467 [2024-10-11 03:52:03,781 INFO L226 Difference]: Without dead ends: 4951 [2024-10-11 03:52:03,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:52:03,804 INFO L432 NwaCegarLoop]: 4240 mSDtfsCounter, 24929 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4159 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24929 SdHoareTripleChecker+Valid, 4344 SdHoareTripleChecker+Invalid, 4288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 4159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:03,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24929 Valid, 4344 Invalid, 4288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 4159 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 03:52:03,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2024-10-11 03:52:03,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 4951. [2024-10-11 03:52:03,976 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-11 03:52:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4951 states to 4951 states and 6391 transitions. [2024-10-11 03:52:03,997 INFO L78 Accepts]: Start accepts. Automaton has 4951 states and 6391 transitions. Word has length 101 [2024-10-11 03:52:03,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:03,998 INFO L471 AbstractCegarLoop]: Abstraction has 4951 states and 6391 transitions. [2024-10-11 03:52:03,998 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-11 03:52:03,998 INFO L276 IsEmpty]: Start isEmpty. Operand 4951 states and 6391 transitions. [2024-10-11 03:52:04,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 03:52:04,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:04,011 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-11 03:52:04,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:52:04,012 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-11 03:52:04,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:04,013 INFO L85 PathProgramCache]: Analyzing trace with hash -564189146, now seen corresponding path program 1 times [2024-10-11 03:52:04,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:04,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662825991] [2024-10-11 03:52:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:04,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:04,413 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-11 03:52:04,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:04,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662825991] [2024-10-11 03:52:04,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662825991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:04,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:04,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:52:04,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590642154] [2024-10-11 03:52:04,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:04,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:52:04,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:04,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:52:04,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:52:04,420 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-11 03:52:07,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:07,073 INFO L93 Difference]: Finished difference Result 6083 states and 7846 transitions. [2024-10-11 03:52:07,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:52:07,074 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-11 03:52:07,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:07,089 INFO L225 Difference]: With dead ends: 6083 [2024-10-11 03:52:07,089 INFO L226 Difference]: Without dead ends: 3651 [2024-10-11 03:52:07,094 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-11 03:52:07,095 INFO L432 NwaCegarLoop]: 2186 mSDtfsCounter, 14196 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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-11 03:52:07,095 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-11 03:52:07,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2024-10-11 03:52:07,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 3651. [2024-10-11 03:52:07,177 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-11 03:52:07,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 4770 transitions. [2024-10-11 03:52:07,186 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 4770 transitions. Word has length 101 [2024-10-11 03:52:07,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:07,186 INFO L471 AbstractCegarLoop]: Abstraction has 3651 states and 4770 transitions. [2024-10-11 03:52:07,187 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-11 03:52:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 4770 transitions. [2024-10-11 03:52:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 03:52:07,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:07,202 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-11 03:52:07,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:52:07,203 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-11 03:52:07,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:07,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1247482897, now seen corresponding path program 1 times [2024-10-11 03:52:07,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:07,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992075944] [2024-10-11 03:52:07,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:07,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:07,599 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-11 03:52:07,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:07,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992075944] [2024-10-11 03:52:07,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992075944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:07,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:07,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:52:07,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593518022] [2024-10-11 03:52:07,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:07,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:52:07,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:07,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:52:07,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:52:07,605 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-11 03:52:09,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:09,182 INFO L93 Difference]: Finished difference Result 4495 states and 5840 transitions. [2024-10-11 03:52:09,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:52:09,183 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-11 03:52:09,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:09,192 INFO L225 Difference]: With dead ends: 4495 [2024-10-11 03:52:09,193 INFO L226 Difference]: Without dead ends: 2719 [2024-10-11 03:52:09,197 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-11 03:52:09,198 INFO L432 NwaCegarLoop]: 1678 mSDtfsCounter, 10619 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:09,198 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.5s Time] [2024-10-11 03:52:09,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2024-10-11 03:52:09,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2719. [2024-10-11 03:52:09,257 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-11 03:52:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 3581 transitions. [2024-10-11 03:52:09,264 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 3581 transitions. Word has length 101 [2024-10-11 03:52:09,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:09,265 INFO L471 AbstractCegarLoop]: Abstraction has 2719 states and 3581 transitions. [2024-10-11 03:52:09,265 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-11 03:52:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 3581 transitions. [2024-10-11 03:52:09,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 03:52:09,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:09,276 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-11 03:52:09,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:52:09,276 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-11 03:52:09,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:09,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1413940705, now seen corresponding path program 1 times [2024-10-11 03:52:09,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:09,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687044010] [2024-10-11 03:52:09,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:09,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:09,652 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-11 03:52:09,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:09,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687044010] [2024-10-11 03:52:09,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687044010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:09,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:09,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:52:09,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924970240] [2024-10-11 03:52:09,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:09,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:52:09,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:09,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:52:09,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:52:09,656 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-11 03:52:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:11,986 INFO L93 Difference]: Finished difference Result 5190 states and 6870 transitions. [2024-10-11 03:52:11,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:52:11,986 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-11 03:52:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:11,995 INFO L225 Difference]: With dead ends: 5190 [2024-10-11 03:52:11,995 INFO L226 Difference]: Without dead ends: 3794 [2024-10-11 03:52:11,998 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-11 03:52:11,998 INFO L432 NwaCegarLoop]: 1651 mSDtfsCounter, 13357 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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-11 03:52:11,999 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-11 03:52:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2024-10-11 03:52:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3595. [2024-10-11 03:52:12,087 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-11 03:52:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 4854 transitions. [2024-10-11 03:52:12,093 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 4854 transitions. Word has length 103 [2024-10-11 03:52:12,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:12,093 INFO L471 AbstractCegarLoop]: Abstraction has 3595 states and 4854 transitions. [2024-10-11 03:52:12,093 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-11 03:52:12,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 4854 transitions. [2024-10-11 03:52:12,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:52:12,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:12,101 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-11 03:52:12,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:52:12,102 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-11 03:52:12,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:12,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2001631897, now seen corresponding path program 1 times [2024-10-11 03:52:12,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:12,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441164538] [2024-10-11 03:52:12,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:12,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:12,366 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-11 03:52:12,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:12,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441164538] [2024-10-11 03:52:12,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441164538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:12,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:12,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:52:12,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980372537] [2024-10-11 03:52:12,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:12,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:52:12,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:12,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:52:12,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:52:12,369 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-11 03:52:13,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:13,707 INFO L93 Difference]: Finished difference Result 5207 states and 7044 transitions. [2024-10-11 03:52:13,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:52:13,708 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-11 03:52:13,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:13,716 INFO L225 Difference]: With dead ends: 5207 [2024-10-11 03:52:13,717 INFO L226 Difference]: Without dead ends: 3372 [2024-10-11 03:52:13,719 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-11 03:52:13,720 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:13,720 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.3s Time] [2024-10-11 03:52:13,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2024-10-11 03:52:13,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 3372. [2024-10-11 03:52:13,784 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-11 03:52:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 4577 transitions. [2024-10-11 03:52:13,793 INFO L78 Accepts]: Start accepts. Automaton has 3372 states and 4577 transitions. Word has length 105 [2024-10-11 03:52:13,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:13,793 INFO L471 AbstractCegarLoop]: Abstraction has 3372 states and 4577 transitions. [2024-10-11 03:52:13,794 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-11 03:52:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3372 states and 4577 transitions. [2024-10-11 03:52:13,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 03:52:13,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:13,802 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-11 03:52:13,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:52:13,802 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-11 03:52:13,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:13,803 INFO L85 PathProgramCache]: Analyzing trace with hash -807434659, now seen corresponding path program 1 times [2024-10-11 03:52:13,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:13,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489291850] [2024-10-11 03:52:13,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:13,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:14,056 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-11 03:52:14,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:14,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489291850] [2024-10-11 03:52:14,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489291850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:14,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:14,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:52:14,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593893198] [2024-10-11 03:52:14,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:14,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:52:14,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:14,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:52:14,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:52:14,059 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-11 03:52:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:14,893 INFO L93 Difference]: Finished difference Result 3763 states and 5049 transitions. [2024-10-11 03:52:14,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:52:14,894 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-11 03:52:14,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:14,899 INFO L225 Difference]: With dead ends: 3763 [2024-10-11 03:52:14,899 INFO L226 Difference]: Without dead ends: 2161 [2024-10-11 03:52:14,901 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-11 03:52:14,901 INFO L432 NwaCegarLoop]: 1001 mSDtfsCounter, 5826 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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-11 03:52:14,902 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-11 03:52:14,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2024-10-11 03:52:14,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2161. [2024-10-11 03:52:14,934 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-11 03:52:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 2945 transitions. [2024-10-11 03:52:14,939 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 2945 transitions. Word has length 107 [2024-10-11 03:52:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:14,939 INFO L471 AbstractCegarLoop]: Abstraction has 2161 states and 2945 transitions. [2024-10-11 03:52:14,939 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-11 03:52:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2945 transitions. [2024-10-11 03:52:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 03:52:14,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:14,946 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-11 03:52:14,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:52:14,948 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-11 03:52:14,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:14,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1740881091, now seen corresponding path program 1 times [2024-10-11 03:52:14,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:14,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38180571] [2024-10-11 03:52:14,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:14,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:15,257 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-11 03:52:15,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:15,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38180571] [2024-10-11 03:52:15,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38180571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:15,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:15,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:52:15,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264272572] [2024-10-11 03:52:15,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:15,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:52:15,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:15,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:52:15,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:52:15,261 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-11 03:52:16,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:16,100 INFO L93 Difference]: Finished difference Result 2834 states and 3838 transitions. [2024-10-11 03:52:16,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:52:16,101 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-11 03:52:16,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:16,106 INFO L225 Difference]: With dead ends: 2834 [2024-10-11 03:52:16,106 INFO L226 Difference]: Without dead ends: 1733 [2024-10-11 03:52:16,108 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-11 03:52:16,108 INFO L432 NwaCegarLoop]: 888 mSDtfsCounter, 4688 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:16,109 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.8s Time] [2024-10-11 03:52:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2024-10-11 03:52:16,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1733. [2024-10-11 03:52:16,132 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-11 03:52:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2376 transitions. [2024-10-11 03:52:16,135 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2376 transitions. Word has length 109 [2024-10-11 03:52:16,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:16,136 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2376 transitions. [2024-10-11 03:52:16,136 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-11 03:52:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2376 transitions. [2024-10-11 03:52:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 03:52:16,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:16,140 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-11 03:52:16,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:52:16,141 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-11 03:52:16,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:16,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1649960662, now seen corresponding path program 1 times [2024-10-11 03:52:16,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:16,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801192766] [2024-10-11 03:52:16,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:16,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:16,962 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-11 03:52:16,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:16,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801192766] [2024-10-11 03:52:16,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801192766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:16,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:16,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:52:16,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298514391] [2024-10-11 03:52:16,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:16,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:52:16,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:16,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:52:16,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:52:16,965 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-11 03:52:19,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:19,513 INFO L93 Difference]: Finished difference Result 3017 states and 4152 transitions. [2024-10-11 03:52:19,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:52:19,514 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-11 03:52:19,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:19,520 INFO L225 Difference]: With dead ends: 3017 [2024-10-11 03:52:19,521 INFO L226 Difference]: Without dead ends: 2713 [2024-10-11 03:52:19,522 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-11 03:52:19,522 INFO L432 NwaCegarLoop]: 928 mSDtfsCounter, 4120 mSDsluCounter, 5497 mSDsCounter, 0 mSdLazyCounter, 4735 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:19,523 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.3s Time] [2024-10-11 03:52:19,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2024-10-11 03:52:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 1737. [2024-10-11 03:52:19,553 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-11 03:52:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2380 transitions. [2024-10-11 03:52:19,557 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2380 transitions. Word has length 111 [2024-10-11 03:52:19,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:19,557 INFO L471 AbstractCegarLoop]: Abstraction has 1737 states and 2380 transitions. [2024-10-11 03:52:19,557 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-11 03:52:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2380 transitions. [2024-10-11 03:52:19,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 03:52:19,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:19,561 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-11 03:52:19,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:52:19,561 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-11 03:52:19,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:19,562 INFO L85 PathProgramCache]: Analyzing trace with hash -447488662, now seen corresponding path program 1 times [2024-10-11 03:52:19,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:19,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975611099] [2024-10-11 03:52:19,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:19,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:20,074 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-11 03:52:20,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:20,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975611099] [2024-10-11 03:52:20,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975611099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:20,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:20,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:20,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325656524] [2024-10-11 03:52:20,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:20,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:20,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:20,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:20,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:20,077 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-11 03:52:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:21,717 INFO L93 Difference]: Finished difference Result 2803 states and 3837 transitions. [2024-10-11 03:52:21,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:21,717 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-11 03:52:21,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:21,724 INFO L225 Difference]: With dead ends: 2803 [2024-10-11 03:52:21,724 INFO L226 Difference]: Without dead ends: 2384 [2024-10-11 03:52:21,725 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-11 03:52:21,726 INFO L432 NwaCegarLoop]: 929 mSDtfsCounter, 6581 mSDsluCounter, 3199 mSDsCounter, 0 mSdLazyCounter, 3019 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:21,726 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.5s Time] [2024-10-11 03:52:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2024-10-11 03:52:21,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 1733. [2024-10-11 03:52:21,761 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-11 03:52:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2375 transitions. [2024-10-11 03:52:21,764 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2375 transitions. Word has length 111 [2024-10-11 03:52:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:21,765 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2375 transitions. [2024-10-11 03:52:21,765 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-11 03:52:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2375 transitions. [2024-10-11 03:52:21,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 03:52:21,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:21,769 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-11 03:52:21,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:52:21,770 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-11 03:52:21,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:21,774 INFO L85 PathProgramCache]: Analyzing trace with hash 258839018, now seen corresponding path program 1 times [2024-10-11 03:52:21,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:21,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802203335] [2024-10-11 03:52:21,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:21,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:22,395 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-11 03:52:22,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:22,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802203335] [2024-10-11 03:52:22,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802203335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:22,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:22,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:22,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622636139] [2024-10-11 03:52:22,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:22,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:22,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:22,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:22,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:22,399 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-11 03:52:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:24,025 INFO L93 Difference]: Finished difference Result 2986 states and 4119 transitions. [2024-10-11 03:52:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:24,026 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-11 03:52:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:24,031 INFO L225 Difference]: With dead ends: 2986 [2024-10-11 03:52:24,031 INFO L226 Difference]: Without dead ends: 2703 [2024-10-11 03:52:24,033 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-11 03:52:24,033 INFO L432 NwaCegarLoop]: 1129 mSDtfsCounter, 5891 mSDsluCounter, 3806 mSDsCounter, 0 mSdLazyCounter, 3561 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:24,034 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.5s Time] [2024-10-11 03:52:24,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2024-10-11 03:52:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 1733. [2024-10-11 03:52:24,060 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-11 03:52:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2374 transitions. [2024-10-11 03:52:24,062 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2374 transitions. Word has length 111 [2024-10-11 03:52:24,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:24,063 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2374 transitions. [2024-10-11 03:52:24,063 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-11 03:52:24,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2374 transitions. [2024-10-11 03:52:24,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 03:52:24,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:24,066 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-11 03:52:24,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:52:24,067 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-11 03:52:24,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:24,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1796391338, now seen corresponding path program 1 times [2024-10-11 03:52:24,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:24,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937985534] [2024-10-11 03:52:24,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:24,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:24,637 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-11 03:52:24,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:24,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937985534] [2024-10-11 03:52:24,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937985534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:24,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:24,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:52:24,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459181957] [2024-10-11 03:52:24,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:24,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:52:24,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:24,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:52:24,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:52:24,639 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-11 03:52:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:26,022 INFO L93 Difference]: Finished difference Result 3006 states and 3984 transitions. [2024-10-11 03:52:26,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:52:26,022 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-11 03:52:26,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:26,026 INFO L225 Difference]: With dead ends: 3006 [2024-10-11 03:52:26,026 INFO L226 Difference]: Without dead ends: 2275 [2024-10-11 03:52:26,027 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-11 03:52:26,027 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-11 03:52:26,028 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-11 03:52:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2024-10-11 03:52:26,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 1733. [2024-10-11 03:52:26,049 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-11 03:52:26,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2373 transitions. [2024-10-11 03:52:26,052 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2373 transitions. Word has length 111 [2024-10-11 03:52:26,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:26,052 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2373 transitions. [2024-10-11 03:52:26,052 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-11 03:52:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2373 transitions. [2024-10-11 03:52:26,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:52:26,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:26,055 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-11 03:52:26,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:52:26,056 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-11 03:52:26,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:26,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1942312309, now seen corresponding path program 1 times [2024-10-11 03:52:26,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:26,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764571635] [2024-10-11 03:52:26,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:26,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:26,627 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-11 03:52:26,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:26,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764571635] [2024-10-11 03:52:26,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764571635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:26,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:26,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:26,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134397383] [2024-10-11 03:52:26,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:26,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:26,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:26,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:26,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:26,631 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-11 03:52:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:28,382 INFO L93 Difference]: Finished difference Result 2892 states and 3979 transitions. [2024-10-11 03:52:28,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:52:28,383 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-11 03:52:28,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:28,387 INFO L225 Difference]: With dead ends: 2892 [2024-10-11 03:52:28,387 INFO L226 Difference]: Without dead ends: 2672 [2024-10-11 03:52:28,388 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-11 03:52:28,388 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-11 03:52:28,388 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-11 03:52:28,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2024-10-11 03:52:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1733. [2024-10-11 03:52:28,406 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-11 03:52:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2372 transitions. [2024-10-11 03:52:28,408 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2372 transitions. Word has length 112 [2024-10-11 03:52:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:28,409 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2372 transitions. [2024-10-11 03:52:28,409 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-11 03:52:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2372 transitions. [2024-10-11 03:52:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 03:52:28,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:28,412 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-11 03:52:28,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:52:28,412 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-11 03:52:28,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:28,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1274182513, now seen corresponding path program 1 times [2024-10-11 03:52:28,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:28,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619716119] [2024-10-11 03:52:28,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:28,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:28,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-11 03:52:28,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:28,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619716119] [2024-10-11 03:52:28,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619716119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:28,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:28,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:28,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959435419] [2024-10-11 03:52:28,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:28,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:28,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:28,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:28,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:28,851 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-11 03:52:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:30,455 INFO L93 Difference]: Finished difference Result 2869 states and 3933 transitions. [2024-10-11 03:52:30,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:30,456 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-11 03:52:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:30,459 INFO L225 Difference]: With dead ends: 2869 [2024-10-11 03:52:30,459 INFO L226 Difference]: Without dead ends: 2648 [2024-10-11 03:52:30,460 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-11 03:52:30,461 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 6411 mSDsluCounter, 3222 mSDsCounter, 0 mSdLazyCounter, 3112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:30,461 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.4s Time] [2024-10-11 03:52:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2024-10-11 03:52:30,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1733. [2024-10-11 03:52:30,483 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-11 03:52:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2370 transitions. [2024-10-11 03:52:30,486 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2370 transitions. Word has length 113 [2024-10-11 03:52:30,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:30,486 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2370 transitions. [2024-10-11 03:52:30,486 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-11 03:52:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2370 transitions. [2024-10-11 03:52:30,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 03:52:30,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:30,489 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-11 03:52:30,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:52:30,490 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-11 03:52:30,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:30,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1550993935, now seen corresponding path program 1 times [2024-10-11 03:52:30,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:30,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645130537] [2024-10-11 03:52:30,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:30,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:31,120 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-11 03:52:31,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:31,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645130537] [2024-10-11 03:52:31,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645130537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:31,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:31,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:31,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870213698] [2024-10-11 03:52:31,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:31,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:31,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:31,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:31,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:31,123 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-11 03:52:32,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:32,782 INFO L93 Difference]: Finished difference Result 3102 states and 4268 transitions. [2024-10-11 03:52:32,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:32,783 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-11 03:52:32,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:32,787 INFO L225 Difference]: With dead ends: 3102 [2024-10-11 03:52:32,787 INFO L226 Difference]: Without dead ends: 2703 [2024-10-11 03:52:32,788 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-11 03:52:32,788 INFO L432 NwaCegarLoop]: 1129 mSDtfsCounter, 5876 mSDsluCounter, 3806 mSDsCounter, 0 mSdLazyCounter, 3546 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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-11 03:52:32,789 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-11 03:52:32,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2024-10-11 03:52:32,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 1733. [2024-10-11 03:52:32,813 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-11 03:52:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2368 transitions. [2024-10-11 03:52:32,815 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2368 transitions. Word has length 113 [2024-10-11 03:52:32,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:32,816 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2368 transitions. [2024-10-11 03:52:32,816 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-11 03:52:32,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2368 transitions. [2024-10-11 03:52:32,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 03:52:32,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:32,819 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-11 03:52:32,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:52:32,819 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-11 03:52:32,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:32,820 INFO L85 PathProgramCache]: Analyzing trace with hash 415339855, now seen corresponding path program 1 times [2024-10-11 03:52:32,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:32,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409184252] [2024-10-11 03:52:32,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:32,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:33,329 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-11 03:52:33,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:33,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409184252] [2024-10-11 03:52:33,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409184252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:33,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:33,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:33,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931439724] [2024-10-11 03:52:33,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:33,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:33,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:33,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:33,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:33,331 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-11 03:52:34,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:34,717 INFO L93 Difference]: Finished difference Result 2537 states and 3485 transitions. [2024-10-11 03:52:34,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:34,718 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-11 03:52:34,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:34,721 INFO L225 Difference]: With dead ends: 2537 [2024-10-11 03:52:34,721 INFO L226 Difference]: Without dead ends: 1823 [2024-10-11 03:52:34,722 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-11 03:52:34,722 INFO L432 NwaCegarLoop]: 929 mSDtfsCounter, 2625 mSDsluCounter, 3196 mSDsCounter, 0 mSdLazyCounter, 2996 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:34,723 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.2s Time] [2024-10-11 03:52:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2024-10-11 03:52:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1733. [2024-10-11 03:52:34,741 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-11 03:52:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2366 transitions. [2024-10-11 03:52:34,743 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2366 transitions. Word has length 113 [2024-10-11 03:52:34,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:34,744 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2366 transitions. [2024-10-11 03:52:34,744 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-11 03:52:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2366 transitions. [2024-10-11 03:52:34,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 03:52:34,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:34,747 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-11 03:52:34,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:52:34,748 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-11 03:52:34,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:34,748 INFO L85 PathProgramCache]: Analyzing trace with hash 137094735, now seen corresponding path program 1 times [2024-10-11 03:52:34,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:34,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364536704] [2024-10-11 03:52:34,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:34,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:35,490 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-11 03:52:35,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:35,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364536704] [2024-10-11 03:52:35,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364536704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:35,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:35,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:52:35,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172043762] [2024-10-11 03:52:35,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:35,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:52:35,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:35,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:52:35,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:52:35,493 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-11 03:52:38,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:38,297 INFO L93 Difference]: Finished difference Result 3751 states and 5223 transitions. [2024-10-11 03:52:38,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:52:38,297 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-11 03:52:38,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:38,303 INFO L225 Difference]: With dead ends: 3751 [2024-10-11 03:52:38,303 INFO L226 Difference]: Without dead ends: 3447 [2024-10-11 03:52:38,305 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-11 03:52:38,305 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-11 03:52:38,306 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-11 03:52:38,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2024-10-11 03:52:38,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 1738. [2024-10-11 03:52:38,330 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-11 03:52:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2371 transitions. [2024-10-11 03:52:38,333 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2371 transitions. Word has length 113 [2024-10-11 03:52:38,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:38,333 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2371 transitions. [2024-10-11 03:52:38,333 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-11 03:52:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2371 transitions. [2024-10-11 03:52:38,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 03:52:38,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:38,336 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-11 03:52:38,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:52:38,337 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-11 03:52:38,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:38,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1339566735, now seen corresponding path program 1 times [2024-10-11 03:52:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:38,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121764763] [2024-10-11 03:52:38,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:38,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:38,829 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-11 03:52:38,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:38,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121764763] [2024-10-11 03:52:38,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121764763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:38,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:38,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:38,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617796892] [2024-10-11 03:52:38,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:38,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:38,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:38,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:38,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:38,832 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-11 03:52:40,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:40,317 INFO L93 Difference]: Finished difference Result 2852 states and 3900 transitions. [2024-10-11 03:52:40,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:40,317 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-11 03:52:40,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:40,322 INFO L225 Difference]: With dead ends: 2852 [2024-10-11 03:52:40,323 INFO L226 Difference]: Without dead ends: 2653 [2024-10-11 03:52:40,324 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-11 03:52:40,324 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 6398 mSDsluCounter, 3222 mSDsCounter, 0 mSdLazyCounter, 3101 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:40,325 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.3s Time] [2024-10-11 03:52:40,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2024-10-11 03:52:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 1738. [2024-10-11 03:52:40,347 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-11 03:52:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2370 transitions. [2024-10-11 03:52:40,350 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2370 transitions. Word has length 113 [2024-10-11 03:52:40,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:40,350 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2370 transitions. [2024-10-11 03:52:40,350 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-11 03:52:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2370 transitions. [2024-10-11 03:52:40,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 03:52:40,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:40,353 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-11 03:52:40,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:52:40,353 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-11 03:52:40,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:40,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1336243889, now seen corresponding path program 1 times [2024-10-11 03:52:40,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:40,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596044803] [2024-10-11 03:52:40,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:40,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:40,811 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-11 03:52:40,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:40,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596044803] [2024-10-11 03:52:40,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596044803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:40,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:40,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:40,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120577972] [2024-10-11 03:52:40,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:40,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:40,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:40,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:40,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:40,813 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-11 03:52:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:42,420 INFO L93 Difference]: Finished difference Result 2905 states and 3983 transitions. [2024-10-11 03:52:42,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:42,420 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-11 03:52:42,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:42,425 INFO L225 Difference]: With dead ends: 2905 [2024-10-11 03:52:42,426 INFO L226 Difference]: Without dead ends: 2677 [2024-10-11 03:52:42,427 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-11 03:52:42,427 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-11 03:52:42,428 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-11 03:52:42,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2024-10-11 03:52:42,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 1738. [2024-10-11 03:52:42,449 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-11 03:52:42,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2369 transitions. [2024-10-11 03:52:42,451 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2369 transitions. Word has length 113 [2024-10-11 03:52:42,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:42,451 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2369 transitions. [2024-10-11 03:52:42,451 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-11 03:52:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2369 transitions. [2024-10-11 03:52:42,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 03:52:42,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:42,454 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-11 03:52:42,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:52:42,454 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-11 03:52:42,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:42,455 INFO L85 PathProgramCache]: Analyzing trace with hash -254149035, now seen corresponding path program 1 times [2024-10-11 03:52:42,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:42,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027745586] [2024-10-11 03:52:42,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:42,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:42,955 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-11 03:52:42,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:42,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027745586] [2024-10-11 03:52:42,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027745586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:42,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:42,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:42,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966594343] [2024-10-11 03:52:42,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:42,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:42,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:42,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:42,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:42,959 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-11 03:52:44,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:44,652 INFO L93 Difference]: Finished difference Result 2844 states and 3889 transitions. [2024-10-11 03:52:44,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:52:44,652 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-11 03:52:44,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:44,656 INFO L225 Difference]: With dead ends: 2844 [2024-10-11 03:52:44,656 INFO L226 Difference]: Without dead ends: 2653 [2024-10-11 03:52:44,657 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-11 03:52:44,658 INFO L432 NwaCegarLoop]: 1061 mSDtfsCounter, 4901 mSDsluCounter, 4330 mSDsCounter, 0 mSdLazyCounter, 3840 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:44,658 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.6s Time] [2024-10-11 03:52:44,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2024-10-11 03:52:44,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 1738. [2024-10-11 03:52:44,683 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-11 03:52:44,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2368 transitions. [2024-10-11 03:52:44,686 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2368 transitions. Word has length 113 [2024-10-11 03:52:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:44,686 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2368 transitions. [2024-10-11 03:52:44,686 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-11 03:52:44,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2368 transitions. [2024-10-11 03:52:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:52:44,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:44,689 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-11 03:52:44,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:52:44,690 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-11 03:52:44,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:44,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1228824528, now seen corresponding path program 1 times [2024-10-11 03:52:44,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:44,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739394959] [2024-10-11 03:52:44,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:44,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:45,172 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-11 03:52:45,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:45,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739394959] [2024-10-11 03:52:45,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739394959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:45,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:45,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:45,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629696462] [2024-10-11 03:52:45,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:45,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:45,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:45,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:45,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:45,175 INFO L87 Difference]: Start difference. First operand 1738 states and 2368 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:47,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:47,018 INFO L93 Difference]: Finished difference Result 2956 states and 4050 transitions. [2024-10-11 03:52:47,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:52:47,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-10-11 03:52:47,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:47,023 INFO L225 Difference]: With dead ends: 2956 [2024-10-11 03:52:47,023 INFO L226 Difference]: Without dead ends: 2677 [2024-10-11 03:52:47,024 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-11 03:52:47,025 INFO L432 NwaCegarLoop]: 1251 mSDtfsCounter, 4837 mSDsluCounter, 4725 mSDsCounter, 0 mSdLazyCounter, 4109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4837 SdHoareTripleChecker+Valid, 5976 SdHoareTripleChecker+Invalid, 4113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:47,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4837 Valid, 5976 Invalid, 4113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4109 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 03:52:47,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2024-10-11 03:52:47,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 1738. [2024-10-11 03:52:47,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1709 states have (on average 1.3844353423054419) internal successors, (2366), 1737 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-11 03:52:47,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2366 transitions. [2024-10-11 03:52:47,049 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2366 transitions. Word has length 114 [2024-10-11 03:52:47,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:47,050 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2366 transitions. [2024-10-11 03:52:47,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2366 transitions. [2024-10-11 03:52:47,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:52:47,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:47,053 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-11 03:52:47,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:52:47,054 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:47,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:47,054 INFO L85 PathProgramCache]: Analyzing trace with hash 880027216, now seen corresponding path program 1 times [2024-10-11 03:52:47,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:47,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334282806] [2024-10-11 03:52:47,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:47,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:47,460 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-11 03:52:47,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:47,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334282806] [2024-10-11 03:52:47,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334282806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:47,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:47,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:47,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998724792] [2024-10-11 03:52:47,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:47,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:47,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:47,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:47,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:47,463 INFO L87 Difference]: Start difference. First operand 1738 states and 2366 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:48,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:48,864 INFO L93 Difference]: Finished difference Result 2693 states and 3623 transitions. [2024-10-11 03:52:48,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:48,865 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-10-11 03:52:48,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:48,868 INFO L225 Difference]: With dead ends: 2693 [2024-10-11 03:52:48,868 INFO L226 Difference]: Without dead ends: 2517 [2024-10-11 03:52:48,868 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-11 03:52:48,869 INFO L432 NwaCegarLoop]: 868 mSDtfsCounter, 6649 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6649 SdHoareTripleChecker+Valid, 3583 SdHoareTripleChecker+Invalid, 2884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:48,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6649 Valid, 3583 Invalid, 2884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:52:48,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2517 states. [2024-10-11 03:52:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2517 to 1738. [2024-10-11 03:52:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1709 states have (on average 1.3832650672908133) internal successors, (2364), 1737 states have internal predecessors, (2364), 0 states have call successors, (0), 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-11 03:52:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2364 transitions. [2024-10-11 03:52:48,888 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2364 transitions. Word has length 114 [2024-10-11 03:52:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:48,889 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2364 transitions. [2024-10-11 03:52:48,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2364 transitions. [2024-10-11 03:52:48,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:52:48,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:48,892 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-11 03:52:48,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:52:48,892 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:48,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:48,893 INFO L85 PathProgramCache]: Analyzing trace with hash -728516560, now seen corresponding path program 1 times [2024-10-11 03:52:48,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:48,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740169210] [2024-10-11 03:52:48,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:48,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:49,280 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-11 03:52:49,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:49,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740169210] [2024-10-11 03:52:49,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740169210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:49,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:49,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:49,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107846561] [2024-10-11 03:52:49,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:49,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:49,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:49,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:49,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:49,283 INFO L87 Difference]: Start difference. First operand 1738 states and 2364 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)