./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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c082dc45380b26d7d2efa14a2b9a25a882bb361e7db7c29c901ddfabd3b29352 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:50:33,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:50:33,853 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:50:33,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:50:33,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:50:33,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:50:33,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:50:33,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:50:33,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:50:33,904 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:50:33,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:50:33,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:50:33,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:50:33,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:50:33,906 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:50:33,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:50:33,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:50:33,907 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:50:33,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:50:33,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:50:33,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:50:33,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:50:33,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:50:33,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:50:33,910 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:50:33,910 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:50:33,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:50:33,911 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:50:33,911 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:50:33,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:50:33,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:50:33,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:50:33,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:50:33,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:50:33,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:50:33,913 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:50:33,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:50:33,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:50:33,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:50:33,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:50:33,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:50:33,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:50:33,921 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c082dc45380b26d7d2efa14a2b9a25a882bb361e7db7c29c901ddfabd3b29352 [2024-10-24 01:50:34,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:50:34,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:50:34,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:50:34,206 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:50:34,207 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:50:34,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-10-24 01:50:35,643 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:50:36,003 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:50:36,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-10-24 01:50:36,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f80396bc/0707150c93d34e17bb50d8baadafdfd0/FLAG18f492f13 [2024-10-24 01:50:36,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f80396bc/0707150c93d34e17bb50d8baadafdfd0 [2024-10-24 01:50:36,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:50:36,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:50:36,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:50:36,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:50:36,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:50:36,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:50:36" (1/1) ... [2024-10-24 01:50:36,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13374325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:36, skipping insertion in model container [2024-10-24 01:50:36,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:50:36" (1/1) ... [2024-10-24 01:50:36,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:50:36,666 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33110,33123] [2024-10-24 01:50:36,738 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[47435,47448] [2024-10-24 01:50:36,769 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[54586,54599] [2024-10-24 01:50:36,781 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[58145,58158] [2024-10-24 01:50:36,797 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[61485,61498] [2024-10-24 01:50:36,845 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[76732,76745] [2024-10-24 01:50:36,863 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[83878,83891] [2024-10-24 01:50:36,872 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[87432,87445] [2024-10-24 01:50:36,885 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[90767,90780] [2024-10-24 01:50:36,899 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[94900,94913] [2024-10-24 01:50:36,913 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[98301,98314] [2024-10-24 01:50:36,927 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[101855,101868] [2024-10-24 01:50:36,940 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[105190,105203] [2024-10-24 01:50:36,954 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[108944,108957] [2024-10-24 01:50:36,966 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[112294,112307] [2024-10-24 01:50:36,976 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[115829,115842] [2024-10-24 01:50:37,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:50:37,062 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:50:37,218 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33110,33123] [2024-10-24 01:50:37,259 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[47435,47448] [2024-10-24 01:50:37,277 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[54586,54599] [2024-10-24 01:50:37,289 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[58145,58158] [2024-10-24 01:50:37,298 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[61485,61498] [2024-10-24 01:50:37,328 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[76732,76745] [2024-10-24 01:50:37,348 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[83878,83891] [2024-10-24 01:50:37,356 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[87432,87445] [2024-10-24 01:50:37,363 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[90767,90780] [2024-10-24 01:50:37,373 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[94900,94913] [2024-10-24 01:50:37,380 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[98301,98314] [2024-10-24 01:50:37,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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[101855,101868] [2024-10-24 01:50:37,395 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[105190,105203] [2024-10-24 01:50:37,407 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[108944,108957] [2024-10-24 01:50:37,415 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[112294,112307] [2024-10-24 01:50:37,424 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[115829,115842] [2024-10-24 01:50:37,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:50:37,470 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:50:37,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:37 WrapperNode [2024-10-24 01:50:37,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:50:37,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:50:37,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:50:37,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:50:37,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:37" (1/1) ... [2024-10-24 01:50:37,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:37" (1/1) ... [2024-10-24 01:50:37,654 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 5769 [2024-10-24 01:50:37,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:50:37,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:50:37,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:50:37,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:50:37,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:37" (1/1) ... [2024-10-24 01:50:37,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:37" (1/1) ... [2024-10-24 01:50:37,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:37" (1/1) ... [2024-10-24 01:50:37,758 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-24 01:50:37,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:37" (1/1) ... [2024-10-24 01:50:37,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:37" (1/1) ... [2024-10-24 01:50:37,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:37" (1/1) ... [2024-10-24 01:50:37,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:37" (1/1) ... [2024-10-24 01:50:37,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:37" (1/1) ... [2024-10-24 01:50:37,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:37" (1/1) ... [2024-10-24 01:50:37,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:50:37,865 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:50:37,865 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:50:37,865 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:50:37,866 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:37" (1/1) ... [2024-10-24 01:50:37,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:50:37,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:50:37,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 01:50:37,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 01:50:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:50:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:50:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:50:37,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:50:38,187 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:50:38,189 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:50:41,096 INFO L? ?]: Removed 1024 outVars from TransFormulas that were not future-live. [2024-10-24 01:50:41,097 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:50:41,181 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:50:41,182 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 01:50:41,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:50:41 BoogieIcfgContainer [2024-10-24 01:50:41,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:50:41,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:50:41,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:50:41,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:50:41,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:50:36" (1/3) ... [2024-10-24 01:50:41,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578b0304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:50:41, skipping insertion in model container [2024-10-24 01:50:41,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:37" (2/3) ... [2024-10-24 01:50:41,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578b0304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:50:41, skipping insertion in model container [2024-10-24 01:50:41,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:50:41" (3/3) ... [2024-10-24 01:50:41,192 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-10-24 01:50:41,210 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:50:41,211 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-24 01:50:41,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:50:41,338 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;@f99422f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:50:41,339 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-24 01:50:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 1109 states, 1092 states have (on average 1.8287545787545787) internal successors, (1997), 1108 states have internal predecessors, (1997), 0 states have call successors, (0), 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-24 01:50:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-24 01:50:41,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:41,373 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] [2024-10-24 01:50:41,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:41,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:41,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1232435330, now seen corresponding path program 1 times [2024-10-24 01:50:41,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:41,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477366308] [2024-10-24 01:50:41,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:41,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:42,011 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-24 01:50:42,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:42,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477366308] [2024-10-24 01:50:42,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477366308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:42,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:42,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:50:42,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304623504] [2024-10-24 01:50:42,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:42,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:50:42,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:42,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:50:42,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:50:42,060 INFO L87 Difference]: Start difference. First operand has 1109 states, 1092 states have (on average 1.8287545787545787) internal successors, (1997), 1108 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-24 01:50:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:43,123 INFO L93 Difference]: Finished difference Result 1444 states and 2547 transitions. [2024-10-24 01:50:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:50:43,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-24 01:50:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:43,141 INFO L225 Difference]: With dead ends: 1444 [2024-10-24 01:50:43,141 INFO L226 Difference]: Without dead ends: 870 [2024-10-24 01:50:43,147 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-24 01:50:43,150 INFO L432 NwaCegarLoop]: 835 mSDtfsCounter, 4508 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4508 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:43,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4508 Valid, 843 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 01:50:43,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-10-24 01:50:43,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-10-24 01:50:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 854 states have (on average 1.319672131147541) internal successors, (1127), 869 states have internal predecessors, (1127), 0 states have call successors, (0), 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-24 01:50:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1127 transitions. [2024-10-24 01:50:43,227 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1127 transitions. Word has length 71 [2024-10-24 01:50:43,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:43,228 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1127 transitions. [2024-10-24 01:50:43,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-24 01:50:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1127 transitions. [2024-10-24 01:50:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-24 01:50:43,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:43,232 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] [2024-10-24 01:50:43,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:50:43,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:43,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:43,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1527450296, now seen corresponding path program 1 times [2024-10-24 01:50:43,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:43,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664623933] [2024-10-24 01:50:43,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:43,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:43,435 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-24 01:50:43,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:43,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664623933] [2024-10-24 01:50:43,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664623933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:43,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:43,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:50:43,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044380725] [2024-10-24 01:50:43,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:43,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:50:43,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:43,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:50:43,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:50:43,439 INFO L87 Difference]: Start difference. First operand 870 states and 1127 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-24 01:50:43,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:43,933 INFO L93 Difference]: Finished difference Result 1071 states and 1380 transitions. [2024-10-24 01:50:43,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:50:43,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-24 01:50:43,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:43,937 INFO L225 Difference]: With dead ends: 1071 [2024-10-24 01:50:43,937 INFO L226 Difference]: Without dead ends: 628 [2024-10-24 01:50:43,939 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-24 01:50:43,942 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 2378 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2378 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:43,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2378 Valid, 413 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:43,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-10-24 01:50:43,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2024-10-24 01:50:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 612 states have (on average 1.3333333333333333) internal successors, (816), 627 states have internal predecessors, (816), 0 states have call successors, (0), 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-24 01:50:43,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 816 transitions. [2024-10-24 01:50:43,961 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 816 transitions. Word has length 71 [2024-10-24 01:50:43,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:43,961 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 816 transitions. [2024-10-24 01:50:43,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-24 01:50:43,962 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 816 transitions. [2024-10-24 01:50:43,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-24 01:50:43,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:43,964 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] [2024-10-24 01:50:43,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:50:43,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:43,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:43,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2115552032, now seen corresponding path program 1 times [2024-10-24 01:50:43,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:43,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990319839] [2024-10-24 01:50:43,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:43,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:44,177 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-24 01:50:44,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:44,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990319839] [2024-10-24 01:50:44,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990319839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:44,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:44,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:50:44,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309897099] [2024-10-24 01:50:44,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:44,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:50:44,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:44,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:50:44,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:50:44,180 INFO L87 Difference]: Start difference. First operand 628 states and 816 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-24 01:50:44,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:44,497 INFO L93 Difference]: Finished difference Result 765 states and 980 transitions. [2024-10-24 01:50:44,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:50:44,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-24 01:50:44,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:44,500 INFO L225 Difference]: With dead ends: 765 [2024-10-24 01:50:44,500 INFO L226 Difference]: Without dead ends: 446 [2024-10-24 01:50:44,501 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-24 01:50:44,502 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1644 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:44,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1644 Valid, 327 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:50:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-24 01:50:44,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2024-10-24 01:50:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 430 states have (on average 1.3372093023255813) internal successors, (575), 445 states have internal predecessors, (575), 0 states have call successors, (0), 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-24 01:50:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 575 transitions. [2024-10-24 01:50:44,511 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 575 transitions. Word has length 71 [2024-10-24 01:50:44,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:44,512 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 575 transitions. [2024-10-24 01:50:44,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-24 01:50:44,512 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 575 transitions. [2024-10-24 01:50:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 01:50:44,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:44,514 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] [2024-10-24 01:50:44,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:50:44,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:44,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:44,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1156366953, now seen corresponding path program 1 times [2024-10-24 01:50:44,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:44,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73458315] [2024-10-24 01:50:44,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:44,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:44,696 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-24 01:50:44,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:44,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73458315] [2024-10-24 01:50:44,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73458315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:44,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:44,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:50:44,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037453420] [2024-10-24 01:50:44,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:44,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:50:44,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:44,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:50:44,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:50:44,698 INFO L87 Difference]: Start difference. First operand 446 states and 575 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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-24 01:50:44,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:44,948 INFO L93 Difference]: Finished difference Result 643 states and 834 transitions. [2024-10-24 01:50:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:50:44,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2024-10-24 01:50:44,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:44,951 INFO L225 Difference]: With dead ends: 643 [2024-10-24 01:50:44,951 INFO L226 Difference]: Without dead ends: 397 [2024-10-24 01:50:44,951 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-24 01:50:44,952 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 1488 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:44,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 304 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:44,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-24 01:50:44,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-10-24 01:50:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3490813648293962) internal successors, (514), 396 states have internal predecessors, (514), 0 states have call successors, (0), 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-24 01:50:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 514 transitions. [2024-10-24 01:50:44,962 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 514 transitions. Word has length 72 [2024-10-24 01:50:44,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:44,962 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 514 transitions. [2024-10-24 01:50:44,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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-24 01:50:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 514 transitions. [2024-10-24 01:50:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 01:50:44,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:44,964 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] [2024-10-24 01:50:44,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:50:44,964 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:44,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:44,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1186891401, now seen corresponding path program 1 times [2024-10-24 01:50:44,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:44,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294600929] [2024-10-24 01:50:44,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:44,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:45,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:45,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294600929] [2024-10-24 01:50:45,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294600929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:45,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:45,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:50:45,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85478581] [2024-10-24 01:50:45,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:45,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:50:45,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:45,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:50:45,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:50:45,106 INFO L87 Difference]: Start difference. First operand 397 states and 514 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:45,406 INFO L93 Difference]: Finished difference Result 609 states and 796 transitions. [2024-10-24 01:50:45,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:50:45,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-24 01:50:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:45,411 INFO L225 Difference]: With dead ends: 609 [2024-10-24 01:50:45,411 INFO L226 Difference]: Without dead ends: 389 [2024-10-24 01:50:45,411 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-24 01:50:45,412 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 1411 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:45,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1411 Valid, 279 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:50:45,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-24 01:50:45,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-10-24 01:50:45,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.351206434316354) internal successors, (504), 388 states have internal predecessors, (504), 0 states have call successors, (0), 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-24 01:50:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 504 transitions. [2024-10-24 01:50:45,424 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 504 transitions. Word has length 73 [2024-10-24 01:50:45,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:45,424 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 504 transitions. [2024-10-24 01:50:45,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 504 transitions. [2024-10-24 01:50:45,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 01:50:45,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:45,428 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] [2024-10-24 01:50:45,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:50:45,429 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:45,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:45,429 INFO L85 PathProgramCache]: Analyzing trace with hash -117023922, now seen corresponding path program 1 times [2024-10-24 01:50:45,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:45,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414519759] [2024-10-24 01:50:45,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:45,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:45,853 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-24 01:50:45,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:45,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414519759] [2024-10-24 01:50:45,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414519759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:45,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:45,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:50:45,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30620758] [2024-10-24 01:50:45,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:45,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:45,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:45,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:45,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:45,856 INFO L87 Difference]: Start difference. First operand 389 states and 504 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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-24 01:50:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:46,486 INFO L93 Difference]: Finished difference Result 753 states and 961 transitions. [2024-10-24 01:50:46,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:50:46,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-24 01:50:46,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:46,489 INFO L225 Difference]: With dead ends: 753 [2024-10-24 01:50:46,490 INFO L226 Difference]: Without dead ends: 541 [2024-10-24 01:50:46,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:50:46,491 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 1760 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:46,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 891 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:46,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-10-24 01:50:46,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 389. [2024-10-24 01:50:46,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3485254691689008) internal successors, (503), 388 states have internal predecessors, (503), 0 states have call successors, (0), 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-24 01:50:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 503 transitions. [2024-10-24 01:50:46,501 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 503 transitions. Word has length 74 [2024-10-24 01:50:46,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:46,502 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 503 transitions. [2024-10-24 01:50:46,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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-24 01:50:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 503 transitions. [2024-10-24 01:50:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 01:50:46,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:46,503 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] [2024-10-24 01:50:46,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:50:46,504 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:46,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:46,504 INFO L85 PathProgramCache]: Analyzing trace with hash 98797326, now seen corresponding path program 1 times [2024-10-24 01:50:46,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:46,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201560003] [2024-10-24 01:50:46,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:46,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:46,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-24 01:50:46,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:46,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201560003] [2024-10-24 01:50:46,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201560003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:46,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:46,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:46,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893651355] [2024-10-24 01:50:46,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:46,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:46,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:46,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:46,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:46,957 INFO L87 Difference]: Start difference. First operand 389 states and 503 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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-24 01:50:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:47,769 INFO L93 Difference]: Finished difference Result 689 states and 911 transitions. [2024-10-24 01:50:47,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:50:47,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-24 01:50:47,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:47,772 INFO L225 Difference]: With dead ends: 689 [2024-10-24 01:50:47,772 INFO L226 Difference]: Without dead ends: 600 [2024-10-24 01:50:47,773 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-24 01:50:47,774 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 2089 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2089 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:47,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2089 Valid, 1250 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:50:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-24 01:50:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 389. [2024-10-24 01:50:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3458445040214477) internal successors, (502), 388 states have internal predecessors, (502), 0 states have call successors, (0), 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-24 01:50:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 502 transitions. [2024-10-24 01:50:47,785 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 502 transitions. Word has length 74 [2024-10-24 01:50:47,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:47,785 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 502 transitions. [2024-10-24 01:50:47,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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-24 01:50:47,786 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 502 transitions. [2024-10-24 01:50:47,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 01:50:47,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:47,787 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] [2024-10-24 01:50:47,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:50:47,788 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:47,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:47,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2064648218, now seen corresponding path program 1 times [2024-10-24 01:50:47,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:47,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846969945] [2024-10-24 01:50:47,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:47,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:48,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-24 01:50:48,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:48,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846969945] [2024-10-24 01:50:48,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846969945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:48,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:48,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:50:48,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729146497] [2024-10-24 01:50:48,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:48,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:50:48,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:48,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:50:48,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:48,260 INFO L87 Difference]: Start difference. First operand 389 states and 502 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 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-24 01:50:49,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:49,273 INFO L93 Difference]: Finished difference Result 703 states and 925 transitions. [2024-10-24 01:50:49,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:50:49,274 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-24 01:50:49,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:49,277 INFO L225 Difference]: With dead ends: 703 [2024-10-24 01:50:49,278 INFO L226 Difference]: Without dead ends: 605 [2024-10-24 01:50:49,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2024-10-24 01:50:49,280 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 2459 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2459 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:49,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2459 Valid, 1923 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 01:50:49,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-10-24 01:50:49,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 392. [2024-10-24 01:50:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 1.3430851063829787) internal successors, (505), 391 states have internal predecessors, (505), 0 states have call successors, (0), 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-24 01:50:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 505 transitions. [2024-10-24 01:50:49,291 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 505 transitions. Word has length 74 [2024-10-24 01:50:49,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:49,295 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 505 transitions. [2024-10-24 01:50:49,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 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-24 01:50:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 505 transitions. [2024-10-24 01:50:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 01:50:49,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:49,297 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] [2024-10-24 01:50:49,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:50:49,298 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:49,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:49,298 INFO L85 PathProgramCache]: Analyzing trace with hash -878912121, now seen corresponding path program 1 times [2024-10-24 01:50:49,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:49,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501688457] [2024-10-24 01:50:49,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:49,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:49,674 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-24 01:50:49,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:49,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501688457] [2024-10-24 01:50:49,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501688457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:49,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:49,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:49,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655190419] [2024-10-24 01:50:49,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:49,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:49,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:49,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:49,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:49,678 INFO L87 Difference]: Start difference. First operand 392 states and 505 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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-24 01:50:50,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:50,498 INFO L93 Difference]: Finished difference Result 732 states and 964 transitions. [2024-10-24 01:50:50,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:50:50,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-24 01:50:50,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:50,500 INFO L225 Difference]: With dead ends: 732 [2024-10-24 01:50:50,500 INFO L226 Difference]: Without dead ends: 604 [2024-10-24 01:50:50,500 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-24 01:50:50,501 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 1525 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:50,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 2308 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:50:50,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-24 01:50:50,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 389. [2024-10-24 01:50:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3431635388739946) internal successors, (501), 388 states have internal predecessors, (501), 0 states have call successors, (0), 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-24 01:50:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 501 transitions. [2024-10-24 01:50:50,510 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 501 transitions. Word has length 74 [2024-10-24 01:50:50,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:50,510 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 501 transitions. [2024-10-24 01:50:50,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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-24 01:50:50,510 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 501 transitions. [2024-10-24 01:50:50,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:50:50,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:50,511 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] [2024-10-24 01:50:50,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:50:50,512 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:50,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:50,512 INFO L85 PathProgramCache]: Analyzing trace with hash 816302217, now seen corresponding path program 1 times [2024-10-24 01:50:50,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:50,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750006092] [2024-10-24 01:50:50,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:50,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:50,855 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-24 01:50:50,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:50,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750006092] [2024-10-24 01:50:50,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750006092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:50,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:50,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:50,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828663992] [2024-10-24 01:50:50,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:50,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:50,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:50,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:50,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:50,858 INFO L87 Difference]: Start difference. First operand 389 states and 501 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-24 01:50:51,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:51,629 INFO L93 Difference]: Finished difference Result 698 states and 916 transitions. [2024-10-24 01:50:51,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:50:51,629 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-24 01:50:51,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:51,631 INFO L225 Difference]: With dead ends: 698 [2024-10-24 01:50:51,632 INFO L226 Difference]: Without dead ends: 600 [2024-10-24 01:50:51,632 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-24 01:50:51,633 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 1912 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1912 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:51,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1912 Valid, 1446 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:50:51,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-24 01:50:51,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 389. [2024-10-24 01:50:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3404825737265416) internal successors, (500), 388 states have internal predecessors, (500), 0 states have call successors, (0), 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-24 01:50:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 500 transitions. [2024-10-24 01:50:51,642 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 500 transitions. Word has length 76 [2024-10-24 01:50:51,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:51,643 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 500 transitions. [2024-10-24 01:50:51,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-24 01:50:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 500 transitions. [2024-10-24 01:50:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:50:51,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:51,644 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] [2024-10-24 01:50:51,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:50:51,644 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:51,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:51,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1716231595, now seen corresponding path program 1 times [2024-10-24 01:50:51,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:51,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927810245] [2024-10-24 01:50:51,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:51,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:51,960 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-24 01:50:51,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:51,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927810245] [2024-10-24 01:50:51,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927810245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:51,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:51,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:51,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315210944] [2024-10-24 01:50:51,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:51,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:51,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:51,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:51,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:51,962 INFO L87 Difference]: Start difference. First operand 389 states and 500 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-24 01:50:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:52,795 INFO L93 Difference]: Finished difference Result 668 states and 872 transitions. [2024-10-24 01:50:52,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:50:52,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-24 01:50:52,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:52,798 INFO L225 Difference]: With dead ends: 668 [2024-10-24 01:50:52,799 INFO L226 Difference]: Without dead ends: 592 [2024-10-24 01:50:52,799 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-24 01:50:52,800 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 1533 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:52,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 1730 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:50:52,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-24 01:50:52,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 389. [2024-10-24 01:50:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3378016085790885) internal successors, (499), 388 states have internal predecessors, (499), 0 states have call successors, (0), 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-24 01:50:52,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 499 transitions. [2024-10-24 01:50:52,808 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 499 transitions. Word has length 76 [2024-10-24 01:50:52,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:52,808 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 499 transitions. [2024-10-24 01:50:52,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-24 01:50:52,809 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 499 transitions. [2024-10-24 01:50:52,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:50:52,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:52,811 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] [2024-10-24 01:50:52,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:50:52,812 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:52,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:52,813 INFO L85 PathProgramCache]: Analyzing trace with hash -694606913, now seen corresponding path program 1 times [2024-10-24 01:50:52,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:52,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103610855] [2024-10-24 01:50:52,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:52,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:53,073 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-24 01:50:53,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:53,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103610855] [2024-10-24 01:50:53,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103610855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:53,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:53,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:53,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781684717] [2024-10-24 01:50:53,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:53,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:53,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:53,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:53,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:53,076 INFO L87 Difference]: Start difference. First operand 389 states and 499 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-24 01:50:53,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:53,808 INFO L93 Difference]: Finished difference Result 747 states and 973 transitions. [2024-10-24 01:50:53,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:50:53,809 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-24 01:50:53,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:53,811 INFO L225 Difference]: With dead ends: 747 [2024-10-24 01:50:53,811 INFO L226 Difference]: Without dead ends: 604 [2024-10-24 01:50:53,811 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-24 01:50:53,812 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 1119 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:53,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 1679 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:50:53,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-24 01:50:53,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 389. [2024-10-24 01:50:53,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3351206434316354) internal successors, (498), 388 states have internal predecessors, (498), 0 states have call successors, (0), 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-24 01:50:53,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 498 transitions. [2024-10-24 01:50:53,820 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 498 transitions. Word has length 76 [2024-10-24 01:50:53,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:53,820 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 498 transitions. [2024-10-24 01:50:53,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-24 01:50:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 498 transitions. [2024-10-24 01:50:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:50:53,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:53,822 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] [2024-10-24 01:50:53,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:50:53,822 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:53,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:53,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1449671967, now seen corresponding path program 1 times [2024-10-24 01:50:53,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:53,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733076863] [2024-10-24 01:50:53,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:53,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:54,086 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-24 01:50:54,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:54,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733076863] [2024-10-24 01:50:54,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733076863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:54,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:54,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:54,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662504253] [2024-10-24 01:50:54,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:54,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:54,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:54,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:54,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:54,090 INFO L87 Difference]: Start difference. First operand 389 states and 498 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-24 01:50:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:54,862 INFO L93 Difference]: Finished difference Result 698 states and 915 transitions. [2024-10-24 01:50:54,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:50:54,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-24 01:50:54,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:54,865 INFO L225 Difference]: With dead ends: 698 [2024-10-24 01:50:54,865 INFO L226 Difference]: Without dead ends: 600 [2024-10-24 01:50:54,866 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-24 01:50:54,866 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 1548 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:54,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 1829 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:50:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-24 01:50:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 389. [2024-10-24 01:50:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3324396782841823) internal successors, (497), 388 states have internal predecessors, (497), 0 states have call successors, (0), 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-24 01:50:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 497 transitions. [2024-10-24 01:50:54,876 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 497 transitions. Word has length 76 [2024-10-24 01:50:54,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:54,876 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 497 transitions. [2024-10-24 01:50:54,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-24 01:50:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 497 transitions. [2024-10-24 01:50:54,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:50:54,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:54,878 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] [2024-10-24 01:50:54,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:50:54,879 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:54,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:54,879 INFO L85 PathProgramCache]: Analyzing trace with hash -263935870, now seen corresponding path program 1 times [2024-10-24 01:50:54,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:54,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636106211] [2024-10-24 01:50:54,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:54,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:55,199 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-24 01:50:55,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:55,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636106211] [2024-10-24 01:50:55,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636106211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:55,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:55,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:55,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920182272] [2024-10-24 01:50:55,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:55,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:55,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:55,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:55,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:55,202 INFO L87 Difference]: Start difference. First operand 389 states and 497 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-24 01:50:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:55,950 INFO L93 Difference]: Finished difference Result 668 states and 870 transitions. [2024-10-24 01:50:55,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:50:55,950 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-24 01:50:55,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:55,953 INFO L225 Difference]: With dead ends: 668 [2024-10-24 01:50:55,953 INFO L226 Difference]: Without dead ends: 592 [2024-10-24 01:50:55,953 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-24 01:50:55,954 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 1521 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:55,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1848 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:50:55,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-24 01:50:55,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 389. [2024-10-24 01:50:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3297587131367292) internal successors, (496), 388 states have internal predecessors, (496), 0 states have call successors, (0), 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-24 01:50:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 496 transitions. [2024-10-24 01:50:55,964 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 496 transitions. Word has length 76 [2024-10-24 01:50:55,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:55,965 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 496 transitions. [2024-10-24 01:50:55,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-24 01:50:55,965 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 496 transitions. [2024-10-24 01:50:55,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:50:55,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:55,966 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] [2024-10-24 01:50:55,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:50:55,967 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:55,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:55,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1457950665, now seen corresponding path program 1 times [2024-10-24 01:50:55,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:55,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391602527] [2024-10-24 01:50:55,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:55,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:56,504 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-24 01:50:56,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:56,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391602527] [2024-10-24 01:50:56,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391602527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:56,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:56,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:50:56,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373587255] [2024-10-24 01:50:56,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:56,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:50:56,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:56,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:50:56,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:56,505 INFO L87 Difference]: Start difference. First operand 389 states and 496 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 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-24 01:50:57,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:57,585 INFO L93 Difference]: Finished difference Result 870 states and 1164 transitions. [2024-10-24 01:50:57,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 01:50:57,585 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-24 01:50:57,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:57,588 INFO L225 Difference]: With dead ends: 870 [2024-10-24 01:50:57,588 INFO L226 Difference]: Without dead ends: 794 [2024-10-24 01:50:57,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-24 01:50:57,589 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 4069 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4069 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:57,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4069 Valid, 1569 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:50:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-10-24 01:50:57,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 393. [2024-10-24 01:50:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3262599469496021) internal successors, (500), 392 states have internal predecessors, (500), 0 states have call successors, (0), 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-24 01:50:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 500 transitions. [2024-10-24 01:50:57,598 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 500 transitions. Word has length 76 [2024-10-24 01:50:57,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:57,598 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 500 transitions. [2024-10-24 01:50:57,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 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-24 01:50:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 500 transitions. [2024-10-24 01:50:57,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:50:57,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:57,600 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] [2024-10-24 01:50:57,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:50:57,600 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:57,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:57,601 INFO L85 PathProgramCache]: Analyzing trace with hash -995702185, now seen corresponding path program 1 times [2024-10-24 01:50:57,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:57,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943076653] [2024-10-24 01:50:57,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:57,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:57,848 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-24 01:50:57,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:57,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943076653] [2024-10-24 01:50:57,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943076653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:57,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:57,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:57,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189678971] [2024-10-24 01:50:57,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:57,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:57,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:57,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:57,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:57,853 INFO L87 Difference]: Start difference. First operand 393 states and 500 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-24 01:50:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:58,513 INFO L93 Difference]: Finished difference Result 664 states and 864 transitions. [2024-10-24 01:50:58,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:50:58,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-24 01:50:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:58,515 INFO L225 Difference]: With dead ends: 664 [2024-10-24 01:50:58,515 INFO L226 Difference]: Without dead ends: 592 [2024-10-24 01:50:58,515 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-24 01:50:58,516 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 1839 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1839 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:58,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1839 Valid, 1457 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-24 01:50:58,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 393. [2024-10-24 01:50:58,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.323607427055703) internal successors, (499), 392 states have internal predecessors, (499), 0 states have call successors, (0), 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-24 01:50:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 499 transitions. [2024-10-24 01:50:58,524 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 499 transitions. Word has length 76 [2024-10-24 01:50:58,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:58,524 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 499 transitions. [2024-10-24 01:50:58,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-24 01:50:58,524 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 499 transitions. [2024-10-24 01:50:58,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:50:58,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:58,526 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] [2024-10-24 01:50:58,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:50:58,526 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:58,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:58,526 INFO L85 PathProgramCache]: Analyzing trace with hash -774147926, now seen corresponding path program 1 times [2024-10-24 01:50:58,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:58,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320648327] [2024-10-24 01:50:58,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:58,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:58,830 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-24 01:50:58,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:58,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320648327] [2024-10-24 01:50:58,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320648327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:58,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:58,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:58,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703301288] [2024-10-24 01:50:58,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:58,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:58,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:58,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:58,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:58,832 INFO L87 Difference]: Start difference. First operand 393 states and 499 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:59,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:59,419 INFO L93 Difference]: Finished difference Result 668 states and 866 transitions. [2024-10-24 01:50:59,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:50:59,420 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-24 01:50:59,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:59,422 INFO L225 Difference]: With dead ends: 668 [2024-10-24 01:50:59,422 INFO L226 Difference]: Without dead ends: 592 [2024-10-24 01:50:59,422 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-24 01:50:59,423 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 1806 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1806 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:59,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1806 Valid, 1474 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:59,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-24 01:50:59,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 389. [2024-10-24 01:50:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.324396782841823) internal successors, (494), 388 states have internal predecessors, (494), 0 states have call successors, (0), 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-24 01:50:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 494 transitions. [2024-10-24 01:50:59,430 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 494 transitions. Word has length 77 [2024-10-24 01:50:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:59,430 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 494 transitions. [2024-10-24 01:50:59,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:59,431 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 494 transitions. [2024-10-24 01:50:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:50:59,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:59,432 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] [2024-10-24 01:50:59,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:50:59,432 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:59,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:59,433 INFO L85 PathProgramCache]: Analyzing trace with hash 513544580, now seen corresponding path program 1 times [2024-10-24 01:50:59,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:59,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20059995] [2024-10-24 01:50:59,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:59,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:59,695 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-24 01:50:59,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:59,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20059995] [2024-10-24 01:50:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20059995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:59,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:59,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:59,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969167037] [2024-10-24 01:50:59,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:59,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:59,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:59,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:59,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:59,698 INFO L87 Difference]: Start difference. First operand 389 states and 494 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:00,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:00,304 INFO L93 Difference]: Finished difference Result 673 states and 870 transitions. [2024-10-24 01:51:00,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:51:00,304 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-24 01:51:00,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:00,306 INFO L225 Difference]: With dead ends: 673 [2024-10-24 01:51:00,306 INFO L226 Difference]: Without dead ends: 592 [2024-10-24 01:51:00,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:51:00,307 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 1480 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:00,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1536 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:51:00,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-24 01:51:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 389. [2024-10-24 01:51:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.32171581769437) internal successors, (493), 388 states have internal predecessors, (493), 0 states have call successors, (0), 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-24 01:51:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 493 transitions. [2024-10-24 01:51:00,314 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 493 transitions. Word has length 78 [2024-10-24 01:51:00,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:00,314 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 493 transitions. [2024-10-24 01:51:00,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 493 transitions. [2024-10-24 01:51:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:51:00,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:00,316 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] [2024-10-24 01:51:00,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:51:00,316 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:00,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:00,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2002078059, now seen corresponding path program 1 times [2024-10-24 01:51:00,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:00,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292534238] [2024-10-24 01:51:00,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:00,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:00,600 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-24 01:51:00,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:00,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292534238] [2024-10-24 01:51:00,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292534238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:00,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:00,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:51:00,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649364196] [2024-10-24 01:51:00,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:00,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:51:00,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:00,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:51:00,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:51:00,603 INFO L87 Difference]: Start difference. First operand 389 states and 493 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:01,215 INFO L93 Difference]: Finished difference Result 645 states and 828 transitions. [2024-10-24 01:51:01,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:51:01,216 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-24 01:51:01,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:01,217 INFO L225 Difference]: With dead ends: 645 [2024-10-24 01:51:01,217 INFO L226 Difference]: Without dead ends: 576 [2024-10-24 01:51:01,218 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-24 01:51:01,218 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 1550 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:01,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1550 Valid, 1647 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:51:01,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-10-24 01:51:01,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 389. [2024-10-24 01:51:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3190348525469169) internal successors, (492), 388 states have internal predecessors, (492), 0 states have call successors, (0), 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-24 01:51:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 492 transitions. [2024-10-24 01:51:01,225 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 492 transitions. Word has length 78 [2024-10-24 01:51:01,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:01,225 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 492 transitions. [2024-10-24 01:51:01,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 492 transitions. [2024-10-24 01:51:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:51:01,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:01,227 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] [2024-10-24 01:51:01,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:51:01,227 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:01,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:01,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1513420061, now seen corresponding path program 1 times [2024-10-24 01:51:01,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:01,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255981398] [2024-10-24 01:51:01,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:01,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:01,807 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-24 01:51:01,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:01,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255981398] [2024-10-24 01:51:01,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255981398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:01,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:01,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:51:01,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882026681] [2024-10-24 01:51:01,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:01,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:51:01,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:01,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:51:01,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:51:01,809 INFO L87 Difference]: Start difference. First operand 389 states and 492 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:03,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:03,010 INFO L93 Difference]: Finished difference Result 946 states and 1266 transitions. [2024-10-24 01:51:03,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 01:51:03,011 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-24 01:51:03,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:03,013 INFO L225 Difference]: With dead ends: 946 [2024-10-24 01:51:03,013 INFO L226 Difference]: Without dead ends: 842 [2024-10-24 01:51:03,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-24 01:51:03,015 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 3490 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3490 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:03,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3490 Valid, 1976 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 01:51:03,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2024-10-24 01:51:03,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 393. [2024-10-24 01:51:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3156498673740054) internal successors, (496), 392 states have internal predecessors, (496), 0 states have call successors, (0), 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-24 01:51:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 496 transitions. [2024-10-24 01:51:03,026 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 496 transitions. Word has length 78 [2024-10-24 01:51:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:03,026 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 496 transitions. [2024-10-24 01:51:03,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 496 transitions. [2024-10-24 01:51:03,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:51:03,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:03,028 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] [2024-10-24 01:51:03,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:51:03,028 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:03,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:03,028 INFO L85 PathProgramCache]: Analyzing trace with hash -675860338, now seen corresponding path program 1 times [2024-10-24 01:51:03,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:03,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561716811] [2024-10-24 01:51:03,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:03,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:03,286 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-24 01:51:03,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:03,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561716811] [2024-10-24 01:51:03,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561716811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:03,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:03,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:51:03,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835432720] [2024-10-24 01:51:03,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:03,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:51:03,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:03,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:51:03,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:51:03,290 INFO L87 Difference]: Start difference. First operand 393 states and 496 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:03,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:03,929 INFO L93 Difference]: Finished difference Result 613 states and 776 transitions. [2024-10-24 01:51:03,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:51:03,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-24 01:51:03,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:03,931 INFO L225 Difference]: With dead ends: 613 [2024-10-24 01:51:03,931 INFO L226 Difference]: Without dead ends: 596 [2024-10-24 01:51:03,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:51:03,933 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 1474 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:03,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1518 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:51:03,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-10-24 01:51:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 393. [2024-10-24 01:51:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.312997347480106) internal successors, (495), 392 states have internal predecessors, (495), 0 states have call successors, (0), 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-24 01:51:03,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 495 transitions. [2024-10-24 01:51:03,940 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 495 transitions. Word has length 78 [2024-10-24 01:51:03,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:03,940 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 495 transitions. [2024-10-24 01:51:03,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 495 transitions. [2024-10-24 01:51:03,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:51:03,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:03,941 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] [2024-10-24 01:51:03,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 01:51:03,942 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:03,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:03,942 INFO L85 PathProgramCache]: Analyzing trace with hash 812673141, now seen corresponding path program 1 times [2024-10-24 01:51:03,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:03,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319726341] [2024-10-24 01:51:03,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:03,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:04,177 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-24 01:51:04,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:04,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319726341] [2024-10-24 01:51:04,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319726341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:04,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:04,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:51:04,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554972898] [2024-10-24 01:51:04,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:04,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:51:04,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:04,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:51:04,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:51:04,180 INFO L87 Difference]: Start difference. First operand 393 states and 495 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:04,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:04,797 INFO L93 Difference]: Finished difference Result 585 states and 734 transitions. [2024-10-24 01:51:04,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:51:04,797 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-24 01:51:04,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:04,799 INFO L225 Difference]: With dead ends: 585 [2024-10-24 01:51:04,799 INFO L226 Difference]: Without dead ends: 580 [2024-10-24 01:51:04,800 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-24 01:51:04,800 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 1826 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1826 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:04,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1826 Valid, 1382 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:51:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-24 01:51:04,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2024-10-24 01:51:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3103448275862069) internal successors, (494), 392 states have internal predecessors, (494), 0 states have call successors, (0), 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-24 01:51:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 494 transitions. [2024-10-24 01:51:04,806 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 494 transitions. Word has length 78 [2024-10-24 01:51:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:04,806 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 494 transitions. [2024-10-24 01:51:04,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 494 transitions. [2024-10-24 01:51:04,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:51:04,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:04,807 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] [2024-10-24 01:51:04,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 01:51:04,808 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:04,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:04,808 INFO L85 PathProgramCache]: Analyzing trace with hash 406757360, now seen corresponding path program 1 times [2024-10-24 01:51:04,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:04,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714859212] [2024-10-24 01:51:04,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:04,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:05,220 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-24 01:51:05,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:05,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714859212] [2024-10-24 01:51:05,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714859212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:05,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:05,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:51:05,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046384582] [2024-10-24 01:51:05,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:05,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:51:05,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:05,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:51:05,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:51:05,223 INFO L87 Difference]: Start difference. First operand 393 states and 494 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:06,102 INFO L93 Difference]: Finished difference Result 747 states and 969 transitions. [2024-10-24 01:51:06,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 01:51:06,102 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-24 01:51:06,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:06,105 INFO L225 Difference]: With dead ends: 747 [2024-10-24 01:51:06,105 INFO L226 Difference]: Without dead ends: 742 [2024-10-24 01:51:06,106 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-24 01:51:06,106 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 4027 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4027 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:06,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4027 Valid, 1412 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:51:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-10-24 01:51:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 397. [2024-10-24 01:51:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3070866141732282) internal successors, (498), 396 states have internal predecessors, (498), 0 states have call successors, (0), 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-24 01:51:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 498 transitions. [2024-10-24 01:51:06,113 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 498 transitions. Word has length 78 [2024-10-24 01:51:06,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:06,113 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 498 transitions. [2024-10-24 01:51:06,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:06,114 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 498 transitions. [2024-10-24 01:51:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:51:06,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:06,115 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] [2024-10-24 01:51:06,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 01:51:06,115 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:06,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:06,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1340403830, now seen corresponding path program 1 times [2024-10-24 01:51:06,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:06,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856203015] [2024-10-24 01:51:06,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:06,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:06,360 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-24 01:51:06,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:06,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856203015] [2024-10-24 01:51:06,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856203015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:06,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:06,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:51:06,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202370975] [2024-10-24 01:51:06,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:06,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:51:06,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:06,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:51:06,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:51:06,364 INFO L87 Difference]: Start difference. First operand 397 states and 498 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:07,051 INFO L93 Difference]: Finished difference Result 646 states and 825 transitions. [2024-10-24 01:51:07,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:51:07,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-24 01:51:07,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:07,053 INFO L225 Difference]: With dead ends: 646 [2024-10-24 01:51:07,053 INFO L226 Difference]: Without dead ends: 580 [2024-10-24 01:51:07,053 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-24 01:51:07,054 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 1540 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:07,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 1685 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:51:07,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-24 01:51:07,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 397. [2024-10-24 01:51:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.304461942257218) internal successors, (497), 396 states have internal predecessors, (497), 0 states have call successors, (0), 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-24 01:51:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 497 transitions. [2024-10-24 01:51:07,059 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 497 transitions. Word has length 78 [2024-10-24 01:51:07,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:07,059 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 497 transitions. [2024-10-24 01:51:07,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:07,059 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 497 transitions. [2024-10-24 01:51:07,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:51:07,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:07,060 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] [2024-10-24 01:51:07,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 01:51:07,060 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:07,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:07,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1562286502, now seen corresponding path program 1 times [2024-10-24 01:51:07,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:07,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855447855] [2024-10-24 01:51:07,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:07,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:07,311 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-24 01:51:07,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:07,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855447855] [2024-10-24 01:51:07,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855447855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:07,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:07,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:51:07,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400672493] [2024-10-24 01:51:07,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:07,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:51:07,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:07,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:51:07,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:51:07,313 INFO L87 Difference]: Start difference. First operand 397 states and 497 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:07,914 INFO L93 Difference]: Finished difference Result 649 states and 827 transitions. [2024-10-24 01:51:07,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:51:07,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-24 01:51:07,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:07,916 INFO L225 Difference]: With dead ends: 649 [2024-10-24 01:51:07,916 INFO L226 Difference]: Without dead ends: 580 [2024-10-24 01:51:07,917 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-24 01:51:07,917 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 1536 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:07,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 1685 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:51:07,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-24 01:51:07,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 397. [2024-10-24 01:51:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3018372703412073) internal successors, (496), 396 states have internal predecessors, (496), 0 states have call successors, (0), 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-24 01:51:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 496 transitions. [2024-10-24 01:51:07,923 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 496 transitions. Word has length 78 [2024-10-24 01:51:07,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:07,924 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 496 transitions. [2024-10-24 01:51:07,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:07,924 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 496 transitions. [2024-10-24 01:51:07,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:51:07,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:07,925 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] [2024-10-24 01:51:07,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 01:51:07,925 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:07,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:07,926 INFO L85 PathProgramCache]: Analyzing trace with hash 978066431, now seen corresponding path program 1 times [2024-10-24 01:51:07,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:07,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047179568] [2024-10-24 01:51:07,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:07,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:08,339 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-24 01:51:08,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:08,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047179568] [2024-10-24 01:51:08,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047179568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:08,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:08,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:51:08,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123929524] [2024-10-24 01:51:08,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:08,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:51:08,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:08,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:51:08,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:51:08,342 INFO L87 Difference]: Start difference. First operand 397 states and 496 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:09,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:09,419 INFO L93 Difference]: Finished difference Result 883 states and 1165 transitions. [2024-10-24 01:51:09,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 01:51:09,420 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-24 01:51:09,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:09,422 INFO L225 Difference]: With dead ends: 883 [2024-10-24 01:51:09,422 INFO L226 Difference]: Without dead ends: 802 [2024-10-24 01:51:09,422 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-24 01:51:09,423 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 3985 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3985 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 1575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:09,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3985 Valid, 1866 Invalid, 1575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 01:51:09,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2024-10-24 01:51:09,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 401. [2024-10-24 01:51:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2987012987012987) internal successors, (500), 400 states have internal predecessors, (500), 0 states have call successors, (0), 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-24 01:51:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 500 transitions. [2024-10-24 01:51:09,429 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 500 transitions. Word has length 78 [2024-10-24 01:51:09,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:09,430 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 500 transitions. [2024-10-24 01:51:09,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:09,430 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 500 transitions. [2024-10-24 01:51:09,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:51:09,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:09,431 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] [2024-10-24 01:51:09,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 01:51:09,431 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:09,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:09,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1364256377, now seen corresponding path program 1 times [2024-10-24 01:51:09,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:09,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316236825] [2024-10-24 01:51:09,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:09,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:09,669 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-24 01:51:09,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:09,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316236825] [2024-10-24 01:51:09,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316236825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:09,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:09,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:51:09,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063307930] [2024-10-24 01:51:09,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:09,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:51:09,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:09,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:51:09,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:51:09,673 INFO L87 Difference]: Start difference. First operand 401 states and 500 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:10,167 INFO L93 Difference]: Finished difference Result 653 states and 830 transitions. [2024-10-24 01:51:10,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:51:10,168 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-24 01:51:10,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:10,170 INFO L225 Difference]: With dead ends: 653 [2024-10-24 01:51:10,170 INFO L226 Difference]: Without dead ends: 584 [2024-10-24 01:51:10,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:51:10,171 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 1503 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:10,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1380 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:51:10,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-24 01:51:10,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 401. [2024-10-24 01:51:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2961038961038962) internal successors, (499), 400 states have internal predecessors, (499), 0 states have call successors, (0), 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-24 01:51:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 499 transitions. [2024-10-24 01:51:10,176 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 499 transitions. Word has length 78 [2024-10-24 01:51:10,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:10,176 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 499 transitions. [2024-10-24 01:51:10,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 499 transitions. [2024-10-24 01:51:10,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:51:10,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:10,177 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] [2024-10-24 01:51:10,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 01:51:10,177 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:10,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:10,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2113755607, now seen corresponding path program 1 times [2024-10-24 01:51:10,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:10,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579177250] [2024-10-24 01:51:10,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:10,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:10,396 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-24 01:51:10,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:10,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579177250] [2024-10-24 01:51:10,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579177250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:10,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:10,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:51:10,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236289937] [2024-10-24 01:51:10,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:10,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:51:10,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:10,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:51:10,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:51:10,398 INFO L87 Difference]: Start difference. First operand 401 states and 499 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:10,944 INFO L93 Difference]: Finished difference Result 650 states and 825 transitions. [2024-10-24 01:51:10,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:51:10,944 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-24 01:51:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:10,946 INFO L225 Difference]: With dead ends: 650 [2024-10-24 01:51:10,946 INFO L226 Difference]: Without dead ends: 584 [2024-10-24 01:51:10,946 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-24 01:51:10,946 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 1215 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:10,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 1366 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:51:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-24 01:51:10,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 401. [2024-10-24 01:51:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2935064935064935) internal successors, (498), 400 states have internal predecessors, (498), 0 states have call successors, (0), 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-24 01:51:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 498 transitions. [2024-10-24 01:51:10,951 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 498 transitions. Word has length 78 [2024-10-24 01:51:10,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:10,952 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 498 transitions. [2024-10-24 01:51:10,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:10,952 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 498 transitions. [2024-10-24 01:51:10,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:51:10,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:10,953 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] [2024-10-24 01:51:10,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 01:51:10,953 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:10,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:10,954 INFO L85 PathProgramCache]: Analyzing trace with hash 390823278, now seen corresponding path program 1 times [2024-10-24 01:51:10,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:10,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538878771] [2024-10-24 01:51:10,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:10,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:11,356 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-24 01:51:11,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:11,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538878771] [2024-10-24 01:51:11,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538878771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:11,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:11,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:51:11,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424797172] [2024-10-24 01:51:11,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:11,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:51:11,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:11,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:51:11,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:51:11,358 INFO L87 Difference]: Start difference. First operand 401 states and 498 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:12,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:12,223 INFO L93 Difference]: Finished difference Result 751 states and 967 transitions. [2024-10-24 01:51:12,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 01:51:12,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-24 01:51:12,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:12,225 INFO L225 Difference]: With dead ends: 751 [2024-10-24 01:51:12,225 INFO L226 Difference]: Without dead ends: 746 [2024-10-24 01:51:12,226 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-24 01:51:12,226 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 4021 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4021 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:12,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4021 Valid, 1403 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:51:12,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-10-24 01:51:12,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 405. [2024-10-24 01:51:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 389 states have (on average 1.2904884318766068) internal successors, (502), 404 states have internal predecessors, (502), 0 states have call successors, (0), 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-24 01:51:12,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 502 transitions. [2024-10-24 01:51:12,232 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 502 transitions. Word has length 78 [2024-10-24 01:51:12,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:12,233 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 502 transitions. [2024-10-24 01:51:12,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:12,233 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 502 transitions. [2024-10-24 01:51:12,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:51:12,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:12,234 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] [2024-10-24 01:51:12,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-24 01:51:12,234 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:12,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:12,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1188609875, now seen corresponding path program 1 times [2024-10-24 01:51:12,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:12,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395893919] [2024-10-24 01:51:12,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:12,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:12,463 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-24 01:51:12,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:12,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395893919] [2024-10-24 01:51:12,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395893919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:12,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:12,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:51:12,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021106802] [2024-10-24 01:51:12,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:12,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:51:12,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:12,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:51:12,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:51:12,465 INFO L87 Difference]: Start difference. First operand 405 states and 502 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:12,984 INFO L93 Difference]: Finished difference Result 650 states and 823 transitions. [2024-10-24 01:51:12,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:51:12,984 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-24 01:51:12,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:12,986 INFO L225 Difference]: With dead ends: 650 [2024-10-24 01:51:12,986 INFO L226 Difference]: Without dead ends: 584 [2024-10-24 01:51:12,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:51:12,987 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 1497 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:12,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1604 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:51:12,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-24 01:51:12,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 405. [2024-10-24 01:51:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 389 states have (on average 1.287917737789203) internal successors, (501), 404 states have internal predecessors, (501), 0 states have call successors, (0), 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-24 01:51:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 501 transitions. [2024-10-24 01:51:12,991 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 501 transitions. Word has length 78 [2024-10-24 01:51:12,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:12,991 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 501 transitions. [2024-10-24 01:51:12,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:12,991 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 501 transitions. [2024-10-24 01:51:12,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:51:12,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:12,992 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] [2024-10-24 01:51:12,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-24 01:51:12,992 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:12,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:12,993 INFO L85 PathProgramCache]: Analyzing trace with hash 848969234, now seen corresponding path program 1 times [2024-10-24 01:51:12,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:12,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601924902] [2024-10-24 01:51:12,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:12,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:13,250 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-24 01:51:13,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:13,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601924902] [2024-10-24 01:51:13,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601924902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:13,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:13,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:51:13,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954750622] [2024-10-24 01:51:13,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:13,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:51:13,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:13,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:51:13,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:51:13,253 INFO L87 Difference]: Start difference. First operand 405 states and 501 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:13,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:13,839 INFO L93 Difference]: Finished difference Result 650 states and 822 transitions. [2024-10-24 01:51:13,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:51:13,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-24 01:51:13,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:13,841 INFO L225 Difference]: With dead ends: 650 [2024-10-24 01:51:13,842 INFO L226 Difference]: Without dead ends: 584 [2024-10-24 01:51:13,842 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-24 01:51:13,843 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 1215 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:13,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 1343 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:51:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-24 01:51:13,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 405. [2024-10-24 01:51:13,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 389 states have (on average 1.2853470437017995) internal successors, (500), 404 states have internal predecessors, (500), 0 states have call successors, (0), 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-24 01:51:13,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 500 transitions. [2024-10-24 01:51:13,850 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 500 transitions. Word has length 78 [2024-10-24 01:51:13,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:13,850 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 500 transitions. [2024-10-24 01:51:13,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-24 01:51:13,850 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 500 transitions. [2024-10-24 01:51:13,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:51:13,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:13,852 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] [2024-10-24 01:51:13,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-24 01:51:13,852 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:13,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:13,853 INFO L85 PathProgramCache]: Analyzing trace with hash -552246912, now seen corresponding path program 1 times [2024-10-24 01:51:13,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:13,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902601609] [2024-10-24 01:51:13,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:13,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:14,086 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-24 01:51:14,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:14,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902601609] [2024-10-24 01:51:14,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902601609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:14,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:14,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:51:14,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854784749] [2024-10-24 01:51:14,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:14,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:51:14,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:14,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:51:14,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:51:14,087 INFO L87 Difference]: Start difference. First operand 405 states and 500 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:14,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:14,673 INFO L93 Difference]: Finished difference Result 720 states and 914 transitions. [2024-10-24 01:51:14,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:51:14,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:51:14,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:14,675 INFO L225 Difference]: With dead ends: 720 [2024-10-24 01:51:14,675 INFO L226 Difference]: Without dead ends: 616 [2024-10-24 01:51:14,676 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-24 01:51:14,676 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 1012 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:14,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 1829 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:51:14,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-10-24 01:51:14,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 401. [2024-10-24 01:51:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2857142857142858) internal successors, (495), 400 states have internal predecessors, (495), 0 states have call successors, (0), 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-24 01:51:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 495 transitions. [2024-10-24 01:51:14,681 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 495 transitions. Word has length 79 [2024-10-24 01:51:14,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:14,681 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 495 transitions. [2024-10-24 01:51:14,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 495 transitions. [2024-10-24 01:51:14,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:51:14,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:14,682 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] [2024-10-24 01:51:14,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-24 01:51:14,683 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:14,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:14,683 INFO L85 PathProgramCache]: Analyzing trace with hash 2131483169, now seen corresponding path program 1 times [2024-10-24 01:51:14,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:14,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777041074] [2024-10-24 01:51:14,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:14,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:14,866 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-24 01:51:14,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:14,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777041074] [2024-10-24 01:51:14,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777041074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:14,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:14,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:51:14,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018779919] [2024-10-24 01:51:14,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:14,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:51:14,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:14,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:51:14,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:51:14,868 INFO L87 Difference]: Start difference. First operand 401 states and 495 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:15,364 INFO L93 Difference]: Finished difference Result 585 states and 722 transitions. [2024-10-24 01:51:15,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:51:15,364 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:51:15,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:15,366 INFO L225 Difference]: With dead ends: 585 [2024-10-24 01:51:15,366 INFO L226 Difference]: Without dead ends: 580 [2024-10-24 01:51:15,366 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-24 01:51:15,366 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1808 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1808 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:15,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1808 Valid, 1355 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:51:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-24 01:51:15,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 397. [2024-10-24 01:51:15,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.2860892388451444) internal successors, (490), 396 states have internal predecessors, (490), 0 states have call successors, (0), 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-24 01:51:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 490 transitions. [2024-10-24 01:51:15,371 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 490 transitions. Word has length 79 [2024-10-24 01:51:15,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:15,371 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 490 transitions. [2024-10-24 01:51:15,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 490 transitions. [2024-10-24 01:51:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:51:15,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:15,374 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] [2024-10-24 01:51:15,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-24 01:51:15,374 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:15,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:15,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1464004193, now seen corresponding path program 1 times [2024-10-24 01:51:15,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:15,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883540902] [2024-10-24 01:51:15,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:15,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:15,573 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-24 01:51:15,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:15,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883540902] [2024-10-24 01:51:15,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883540902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:15,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:15,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:51:15,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235185595] [2024-10-24 01:51:15,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:15,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:51:15,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:15,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:51:15,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:51:15,577 INFO L87 Difference]: Start difference. First operand 397 states and 490 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:16,170 INFO L93 Difference]: Finished difference Result 681 states and 861 transitions. [2024-10-24 01:51:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:51:16,170 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:51:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:16,172 INFO L225 Difference]: With dead ends: 681 [2024-10-24 01:51:16,172 INFO L226 Difference]: Without dead ends: 600 [2024-10-24 01:51:16,172 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-24 01:51:16,173 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 1106 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:16,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 1598 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:51:16,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-24 01:51:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 393. [2024-10-24 01:51:16,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.2864721485411141) internal successors, (485), 392 states have internal predecessors, (485), 0 states have call successors, (0), 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-24 01:51:16,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 485 transitions. [2024-10-24 01:51:16,181 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 485 transitions. Word has length 79 [2024-10-24 01:51:16,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:16,181 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 485 transitions. [2024-10-24 01:51:16,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 485 transitions. [2024-10-24 01:51:16,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:51:16,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:16,183 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] [2024-10-24 01:51:16,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-24 01:51:16,183 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:16,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:16,184 INFO L85 PathProgramCache]: Analyzing trace with hash -538584006, now seen corresponding path program 1 times [2024-10-24 01:51:16,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:16,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352816390] [2024-10-24 01:51:16,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:16,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:16,399 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-24 01:51:16,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:16,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352816390] [2024-10-24 01:51:16,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352816390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:16,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:16,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:51:16,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369553307] [2024-10-24 01:51:16,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:16,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:51:16,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:16,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:51:16,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:51:16,402 INFO L87 Difference]: Start difference. First operand 393 states and 485 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:17,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:17,013 INFO L93 Difference]: Finished difference Result 581 states and 716 transitions. [2024-10-24 01:51:17,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:51:17,014 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:51:17,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:17,015 INFO L225 Difference]: With dead ends: 581 [2024-10-24 01:51:17,015 INFO L226 Difference]: Without dead ends: 576 [2024-10-24 01:51:17,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:51:17,016 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 1051 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:17,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 1734 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:51:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-10-24 01:51:17,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 389. [2024-10-24 01:51:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.2868632707774799) internal successors, (480), 388 states have internal predecessors, (480), 0 states have call successors, (0), 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-24 01:51:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 480 transitions. [2024-10-24 01:51:17,020 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 480 transitions. Word has length 79 [2024-10-24 01:51:17,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:17,021 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 480 transitions. [2024-10-24 01:51:17,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 480 transitions. [2024-10-24 01:51:17,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:51:17,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:17,022 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] [2024-10-24 01:51:17,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-24 01:51:17,022 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:17,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:17,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1401129693, now seen corresponding path program 1 times [2024-10-24 01:51:17,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:17,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440047147] [2024-10-24 01:51:17,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:17,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:17,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-24 01:51:17,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:17,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440047147] [2024-10-24 01:51:17,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440047147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:17,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:17,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:51:17,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714762931] [2024-10-24 01:51:17,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:17,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:51:17,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:17,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:51:17,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:51:17,259 INFO L87 Difference]: Start difference. First operand 389 states and 480 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:17,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:17,794 INFO L93 Difference]: Finished difference Result 640 states and 806 transitions. [2024-10-24 01:51:17,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:51:17,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:51:17,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:17,796 INFO L225 Difference]: With dead ends: 640 [2024-10-24 01:51:17,796 INFO L226 Difference]: Without dead ends: 575 [2024-10-24 01:51:17,796 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-24 01:51:17,796 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 1505 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:17,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1747 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:51:17,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-10-24 01:51:17,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 388. [2024-10-24 01:51:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 372 states have (on average 1.2849462365591398) internal successors, (478), 387 states have internal predecessors, (478), 0 states have call successors, (0), 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-24 01:51:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 478 transitions. [2024-10-24 01:51:17,801 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 478 transitions. Word has length 79 [2024-10-24 01:51:17,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:17,802 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 478 transitions. [2024-10-24 01:51:17,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 478 transitions. [2024-10-24 01:51:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:51:17,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:17,803 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] [2024-10-24 01:51:17,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-24 01:51:17,803 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:17,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:17,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1269258616, now seen corresponding path program 1 times [2024-10-24 01:51:17,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:17,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288689315] [2024-10-24 01:51:17,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:17,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:18,317 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-24 01:51:18,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:18,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288689315] [2024-10-24 01:51:18,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288689315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:18,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:18,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 01:51:18,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307873538] [2024-10-24 01:51:18,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:18,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:51:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:18,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:51:18,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:51:18,319 INFO L87 Difference]: Start difference. First operand 388 states and 478 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:19,165 INFO L93 Difference]: Finished difference Result 637 states and 802 transitions. [2024-10-24 01:51:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:51:19,166 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-24 01:51:19,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:19,167 INFO L225 Difference]: With dead ends: 637 [2024-10-24 01:51:19,167 INFO L226 Difference]: Without dead ends: 569 [2024-10-24 01:51:19,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-24 01:51:19,168 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 2380 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2380 SdHoareTripleChecker+Valid, 3004 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:19,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2380 Valid, 3004 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:51:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-10-24 01:51:19,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 384. [2024-10-24 01:51:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 369 states have (on average 1.2818428184281843) internal successors, (473), 383 states have internal predecessors, (473), 0 states have call successors, (0), 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-24 01:51:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 473 transitions. [2024-10-24 01:51:19,172 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 473 transitions. Word has length 80 [2024-10-24 01:51:19,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:19,172 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 473 transitions. [2024-10-24 01:51:19,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 473 transitions. [2024-10-24 01:51:19,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:51:19,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:19,173 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] [2024-10-24 01:51:19,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-24 01:51:19,173 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:19,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:19,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1637753759, now seen corresponding path program 1 times [2024-10-24 01:51:19,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:19,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836754467] [2024-10-24 01:51:19,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:19,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:19,645 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-24 01:51:19,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:19,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836754467] [2024-10-24 01:51:19,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836754467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:19,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:19,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 01:51:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283737242] [2024-10-24 01:51:19,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:19,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:51:19,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:19,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:51:19,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:51:19,647 INFO L87 Difference]: Start difference. First operand 384 states and 473 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:20,432 INFO L93 Difference]: Finished difference Result 629 states and 793 transitions. [2024-10-24 01:51:20,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:51:20,432 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-24 01:51:20,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:20,434 INFO L225 Difference]: With dead ends: 629 [2024-10-24 01:51:20,434 INFO L226 Difference]: Without dead ends: 561 [2024-10-24 01:51:20,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-24 01:51:20,434 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 2098 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2098 SdHoareTripleChecker+Valid, 2706 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:20,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2098 Valid, 2706 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:51:20,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-10-24 01:51:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 380. [2024-10-24 01:51:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 366 states have (on average 1.278688524590164) internal successors, (468), 379 states have internal predecessors, (468), 0 states have call successors, (0), 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-24 01:51:20,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 468 transitions. [2024-10-24 01:51:20,438 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 468 transitions. Word has length 80 [2024-10-24 01:51:20,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:20,438 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 468 transitions. [2024-10-24 01:51:20,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:20,439 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 468 transitions. [2024-10-24 01:51:20,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:51:20,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:20,439 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] [2024-10-24 01:51:20,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-24 01:51:20,439 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:20,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:20,440 INFO L85 PathProgramCache]: Analyzing trace with hash 652259760, now seen corresponding path program 1 times [2024-10-24 01:51:20,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:20,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118457959] [2024-10-24 01:51:20,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:20,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:22,216 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-24 01:51:22,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:22,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118457959] [2024-10-24 01:51:22,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118457959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:22,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:22,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2024-10-24 01:51:22,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891929029] [2024-10-24 01:51:22,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:22,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-24 01:51:22,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:22,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-24 01:51:22,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2024-10-24 01:51:22,218 INFO L87 Difference]: Start difference. First operand 380 states and 468 transitions. Second operand has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:27,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:27,341 INFO L93 Difference]: Finished difference Result 1263 states and 1585 transitions. [2024-10-24 01:51:27,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-24 01:51:27,342 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-24 01:51:27,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:27,344 INFO L225 Difference]: With dead ends: 1263 [2024-10-24 01:51:27,345 INFO L226 Difference]: Without dead ends: 1198 [2024-10-24 01:51:27,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=434, Invalid=2536, Unknown=0, NotChecked=0, Total=2970 [2024-10-24 01:51:27,346 INFO L432 NwaCegarLoop]: 1014 mSDtfsCounter, 4603 mSDsluCounter, 13031 mSDsCounter, 0 mSdLazyCounter, 8152 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4603 SdHoareTripleChecker+Valid, 14045 SdHoareTripleChecker+Invalid, 8156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:27,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4603 Valid, 14045 Invalid, 8156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8152 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-24 01:51:27,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2024-10-24 01:51:27,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 399. [2024-10-24 01:51:27,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 385 states have (on average 1.2805194805194806) internal successors, (493), 398 states have internal predecessors, (493), 0 states have call successors, (0), 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-24 01:51:27,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 493 transitions. [2024-10-24 01:51:27,352 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 493 transitions. Word has length 80 [2024-10-24 01:51:27,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:27,352 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 493 transitions. [2024-10-24 01:51:27,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 493 transitions. [2024-10-24 01:51:27,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:51:27,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:27,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] [2024-10-24 01:51:27,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-24 01:51:27,353 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:27,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:27,354 INFO L85 PathProgramCache]: Analyzing trace with hash 610527558, now seen corresponding path program 1 times [2024-10-24 01:51:27,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:27,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519046632] [2024-10-24 01:51:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:27,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:28,401 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-24 01:51:28,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:28,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519046632] [2024-10-24 01:51:28,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519046632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:28,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:28,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-10-24 01:51:28,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565791706] [2024-10-24 01:51:28,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:28,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 01:51:28,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:28,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 01:51:28,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2024-10-24 01:51:28,403 INFO L87 Difference]: Start difference. First operand 399 states and 493 transitions. Second operand has 26 states, 26 states have (on average 3.076923076923077) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:33,618 INFO L93 Difference]: Finished difference Result 1406 states and 1764 transitions. [2024-10-24 01:51:33,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-24 01:51:33,618 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.076923076923077) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-24 01:51:33,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:33,621 INFO L225 Difference]: With dead ends: 1406 [2024-10-24 01:51:33,621 INFO L226 Difference]: Without dead ends: 1336 [2024-10-24 01:51:33,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=314, Invalid=1848, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 01:51:33,622 INFO L432 NwaCegarLoop]: 1288 mSDtfsCounter, 3489 mSDsluCounter, 17731 mSDsCounter, 0 mSdLazyCounter, 10139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3489 SdHoareTripleChecker+Valid, 19019 SdHoareTripleChecker+Invalid, 10141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:33,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3489 Valid, 19019 Invalid, 10141 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 10139 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-24 01:51:33,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2024-10-24 01:51:33,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 399. [2024-10-24 01:51:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 385 states have (on average 1.277922077922078) internal successors, (492), 398 states have internal predecessors, (492), 0 states have call successors, (0), 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-24 01:51:33,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 492 transitions. [2024-10-24 01:51:33,628 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 492 transitions. Word has length 80 [2024-10-24 01:51:33,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:33,628 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 492 transitions. [2024-10-24 01:51:33,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.076923076923077) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:33,628 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 492 transitions. [2024-10-24 01:51:33,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:51:33,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:33,629 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] [2024-10-24 01:51:33,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-24 01:51:33,629 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:33,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:33,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1080890953, now seen corresponding path program 1 times [2024-10-24 01:51:33,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:33,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466906060] [2024-10-24 01:51:33,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:33,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:34,063 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-24 01:51:34,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:34,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466906060] [2024-10-24 01:51:34,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466906060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:34,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:34,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 01:51:34,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627107365] [2024-10-24 01:51:34,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:34,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:51:34,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:34,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:51:34,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:51:34,065 INFO L87 Difference]: Start difference. First operand 399 states and 492 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:34,502 INFO L93 Difference]: Finished difference Result 600 states and 769 transitions. [2024-10-24 01:51:34,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:51:34,502 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-24 01:51:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:34,503 INFO L225 Difference]: With dead ends: 600 [2024-10-24 01:51:34,503 INFO L226 Difference]: Without dead ends: 473 [2024-10-24 01:51:34,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-24 01:51:34,504 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 2076 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2076 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:34,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2076 Valid, 2488 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:51:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-10-24 01:51:34,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 336. [2024-10-24 01:51:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 326 states have (on average 1.2791411042944785) internal successors, (417), 335 states have internal predecessors, (417), 0 states have call successors, (0), 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-24 01:51:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 417 transitions. [2024-10-24 01:51:34,509 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 417 transitions. Word has length 80 [2024-10-24 01:51:34,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:34,509 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 417 transitions. [2024-10-24 01:51:34,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:34,510 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 417 transitions. [2024-10-24 01:51:34,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:51:34,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:34,510 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] [2024-10-24 01:51:34,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-24 01:51:34,511 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:34,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:34,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1272157338, now seen corresponding path program 1 times [2024-10-24 01:51:34,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:34,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652360694] [2024-10-24 01:51:34,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:34,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:34,904 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-24 01:51:34,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:34,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652360694] [2024-10-24 01:51:34,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652360694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:34,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:34,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:51:34,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140035453] [2024-10-24 01:51:34,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:34,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:51:34,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:34,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:51:34,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:51:34,906 INFO L87 Difference]: Start difference. First operand 336 states and 417 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:35,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:35,361 INFO L93 Difference]: Finished difference Result 723 states and 937 transitions. [2024-10-24 01:51:35,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:51:35,361 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-24 01:51:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:35,363 INFO L225 Difference]: With dead ends: 723 [2024-10-24 01:51:35,366 INFO L226 Difference]: Without dead ends: 542 [2024-10-24 01:51:35,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-10-24 01:51:35,367 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 1757 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:35,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1757 Valid, 1509 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:51:35,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-10-24 01:51:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 219. [2024-10-24 01:51:35,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 214 states have (on average 1.2616822429906542) internal successors, (270), 218 states have internal predecessors, (270), 0 states have call successors, (0), 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-24 01:51:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 270 transitions. [2024-10-24 01:51:35,374 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 270 transitions. Word has length 80 [2024-10-24 01:51:35,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:35,374 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 270 transitions. [2024-10-24 01:51:35,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 270 transitions. [2024-10-24 01:51:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:51:35,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:35,375 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] [2024-10-24 01:51:35,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-24 01:51:35,375 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:35,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:35,375 INFO L85 PathProgramCache]: Analyzing trace with hash 659418620, now seen corresponding path program 1 times [2024-10-24 01:51:35,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:35,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448283201] [2024-10-24 01:51:35,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:35,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:35,696 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-24 01:51:35,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:35,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448283201] [2024-10-24 01:51:35,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448283201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:35,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:35,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:51:35,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066958325] [2024-10-24 01:51:35,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:35,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:51:35,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:35,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:51:35,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:51:35,698 INFO L87 Difference]: Start difference. First operand 219 states and 270 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:36,345 INFO L93 Difference]: Finished difference Result 606 states and 821 transitions. [2024-10-24 01:51:36,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 01:51:36,345 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-24 01:51:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:36,347 INFO L225 Difference]: With dead ends: 606 [2024-10-24 01:51:36,347 INFO L226 Difference]: Without dead ends: 524 [2024-10-24 01:51:36,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-24 01:51:36,348 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 2624 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2624 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:36,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2624 Valid, 877 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:51:36,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-10-24 01:51:36,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 223. [2024-10-24 01:51:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.2568807339449541) internal successors, (274), 222 states have internal predecessors, (274), 0 states have call successors, (0), 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-24 01:51:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 274 transitions. [2024-10-24 01:51:36,353 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 274 transitions. Word has length 81 [2024-10-24 01:51:36,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:36,353 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 274 transitions. [2024-10-24 01:51:36,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:36,353 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 274 transitions. [2024-10-24 01:51:36,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:51:36,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:36,354 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] [2024-10-24 01:51:36,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-24 01:51:36,354 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:36,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:36,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1571841251, now seen corresponding path program 1 times [2024-10-24 01:51:36,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:36,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220475236] [2024-10-24 01:51:36,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:36,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:36,557 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-24 01:51:36,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:36,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220475236] [2024-10-24 01:51:36,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220475236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:36,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:36,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:51:36,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783967193] [2024-10-24 01:51:36,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:36,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:51:36,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:36,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:51:36,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:51:36,559 INFO L87 Difference]: Start difference. First operand 223 states and 274 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:36,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:36,947 INFO L93 Difference]: Finished difference Result 329 states and 413 transitions. [2024-10-24 01:51:36,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:51:36,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-24 01:51:36,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:36,948 INFO L225 Difference]: With dead ends: 329 [2024-10-24 01:51:36,948 INFO L226 Difference]: Without dead ends: 322 [2024-10-24 01:51:36,949 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-24 01:51:36,949 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 739 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:36,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 811 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:51:36,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-24 01:51:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 223. [2024-10-24 01:51:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.2522935779816513) internal successors, (273), 222 states have internal predecessors, (273), 0 states have call successors, (0), 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-24 01:51:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 273 transitions. [2024-10-24 01:51:36,952 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 273 transitions. Word has length 81 [2024-10-24 01:51:36,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:36,952 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 273 transitions. [2024-10-24 01:51:36,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:36,953 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 273 transitions. [2024-10-24 01:51:36,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:51:36,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:36,953 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] [2024-10-24 01:51:36,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-24 01:51:36,953 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:36,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:36,954 INFO L85 PathProgramCache]: Analyzing trace with hash 110288228, now seen corresponding path program 1 times [2024-10-24 01:51:36,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:36,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947005481] [2024-10-24 01:51:36,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:36,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:37,153 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-24 01:51:37,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:37,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947005481] [2024-10-24 01:51:37,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947005481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:37,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:37,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:51:37,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172525922] [2024-10-24 01:51:37,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:37,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:51:37,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:37,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:51:37,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:51:37,156 INFO L87 Difference]: Start difference. First operand 223 states and 273 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:37,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:37,515 INFO L93 Difference]: Finished difference Result 329 states and 412 transitions. [2024-10-24 01:51:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:51:37,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-24 01:51:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:37,516 INFO L225 Difference]: With dead ends: 329 [2024-10-24 01:51:37,516 INFO L226 Difference]: Without dead ends: 322 [2024-10-24 01:51:37,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:51:37,517 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 509 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:37,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 794 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:51:37,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-24 01:51:37,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 223. [2024-10-24 01:51:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.2477064220183487) internal successors, (272), 222 states have internal predecessors, (272), 0 states have call successors, (0), 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-24 01:51:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2024-10-24 01:51:37,520 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 81 [2024-10-24 01:51:37,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:37,520 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2024-10-24 01:51:37,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:37,521 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2024-10-24 01:51:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:51:37,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:37,521 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] [2024-10-24 01:51:37,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-24 01:51:37,521 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:37,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:37,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1072844505, now seen corresponding path program 1 times [2024-10-24 01:51:37,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:37,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16218843] [2024-10-24 01:51:37,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:37,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:38,249 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-24 01:51:38,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:38,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16218843] [2024-10-24 01:51:38,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16218843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:38,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:38,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 01:51:38,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367331414] [2024-10-24 01:51:38,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:38,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 01:51:38,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:38,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 01:51:38,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-24 01:51:38,251 INFO L87 Difference]: Start difference. First operand 223 states and 272 transitions. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 15 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:39,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:39,526 INFO L93 Difference]: Finished difference Result 487 states and 635 transitions. [2024-10-24 01:51:39,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 01:51:39,527 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 15 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-24 01:51:39,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:39,528 INFO L225 Difference]: With dead ends: 487 [2024-10-24 01:51:39,528 INFO L226 Difference]: Without dead ends: 411 [2024-10-24 01:51:39,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2024-10-24 01:51:39,528 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 1326 mSDsluCounter, 2546 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:39,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 2749 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:51:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-10-24 01:51:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 217. [2024-10-24 01:51:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 212 states have (on average 1.240566037735849) internal successors, (263), 216 states have internal predecessors, (263), 0 states have call successors, (0), 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-24 01:51:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 263 transitions. [2024-10-24 01:51:39,532 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 263 transitions. Word has length 81 [2024-10-24 01:51:39,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:39,532 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 263 transitions. [2024-10-24 01:51:39,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 15 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 263 transitions. [2024-10-24 01:51:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:51:39,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:39,532 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] [2024-10-24 01:51:39,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-24 01:51:39,533 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:39,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:39,533 INFO L85 PathProgramCache]: Analyzing trace with hash -220542743, now seen corresponding path program 1 times [2024-10-24 01:51:39,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:39,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936604801] [2024-10-24 01:51:39,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:39,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:40,904 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-24 01:51:40,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:40,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936604801] [2024-10-24 01:51:40,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936604801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:40,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:40,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-10-24 01:51:40,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881924072] [2024-10-24 01:51:40,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:40,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 01:51:40,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:40,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 01:51:40,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2024-10-24 01:51:40,905 INFO L87 Difference]: Start difference. First operand 217 states and 263 transitions. Second operand has 24 states, 24 states have (on average 3.375) internal successors, (81), 23 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:43,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:43,200 INFO L93 Difference]: Finished difference Result 917 states and 1203 transitions. [2024-10-24 01:51:43,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-24 01:51:43,201 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 23 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-24 01:51:43,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:43,202 INFO L225 Difference]: With dead ends: 917 [2024-10-24 01:51:43,202 INFO L226 Difference]: Without dead ends: 844 [2024-10-24 01:51:43,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=282, Invalid=1610, Unknown=0, NotChecked=0, Total=1892 [2024-10-24 01:51:43,203 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 2396 mSDsluCounter, 7308 mSDsCounter, 0 mSdLazyCounter, 2881 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2396 SdHoareTripleChecker+Valid, 7852 SdHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:43,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2396 Valid, 7852 Invalid, 2882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2881 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 01:51:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-10-24 01:51:43,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 218. [2024-10-24 01:51:43,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 213 states have (on average 1.2394366197183098) internal successors, (264), 217 states have internal predecessors, (264), 0 states have call successors, (0), 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-24 01:51:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 264 transitions. [2024-10-24 01:51:43,208 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 264 transitions. Word has length 81 [2024-10-24 01:51:43,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:43,208 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 264 transitions. [2024-10-24 01:51:43,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 23 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:43,209 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 264 transitions. [2024-10-24 01:51:43,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:51:43,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:43,209 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] [2024-10-24 01:51:43,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-24 01:51:43,210 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:51:43,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:43,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2120242635, now seen corresponding path program 1 times [2024-10-24 01:51:43,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:43,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380554030] [2024-10-24 01:51:43,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:43,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms