./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c082dc45380b26d7d2efa14a2b9a25a882bb361e7db7c29c901ddfabd3b29352 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:49:36,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:49:36,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:49:36,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:49:36,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:49:36,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:49:36,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:49:36,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:49:36,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:49:36,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:49:36,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:49:36,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:49:36,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:49:36,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:49:36,662 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:49:36,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:49:36,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:49:36,667 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:49:36,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:49:36,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:49:36,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:49:36,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:49:36,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:49:36,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:49:36,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:49:36,669 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:49:36,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:49:36,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:49:36,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:49:36,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:49:36,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:49:36,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:49:36,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:49:36,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:49:36,672 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:49:36,672 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:49:36,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:49:36,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:49:36,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:49:36,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:49:36,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:49:36,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:49:36,674 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c082dc45380b26d7d2efa14a2b9a25a882bb361e7db7c29c901ddfabd3b29352 [2024-10-11 03:49:36,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:49:36,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:49:36,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:49:36,936 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:49:36,938 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:49:36,940 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-11 03:49:38,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:49:38,489 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:49:38,490 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-11 03:49:38,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/de403dfb8/f3162ece2ee74c6fad6732710af33d76/FLAG90f5a8345 [2024-10-11 03:49:38,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/de403dfb8/f3162ece2ee74c6fad6732710af33d76 [2024-10-11 03:49:38,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:49:38,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:49:38,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:49:38,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:49:38,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:49:38,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:49:38" (1/1) ... [2024-10-11 03:49:38,541 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b251132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:38, skipping insertion in model container [2024-10-11 03:49:38,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:49:38" (1/1) ... [2024-10-11 03:49:38,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:49:39,061 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-11 03:49:39,108 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-11 03:49:39,130 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-11 03:49:39,138 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-11 03:49:39,150 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[61485,61498] [2024-10-11 03:49:39,201 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-11 03:49:39,219 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-11 03:49:39,226 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-11 03:49:39,233 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-11 03:49:39,241 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-11 03:49:39,249 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-11 03:49:39,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[101855,101868] [2024-10-11 03:49:39,265 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-11 03:49:39,272 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-11 03:49:39,286 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-11 03:49:39,296 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[115829,115842] [2024-10-11 03:49:39,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:49:39,335 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:49:39,458 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33110,33123] [2024-10-11 03:49:39,494 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-11 03:49:39,505 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-11 03:49:39,515 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-11 03:49:39,522 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-11 03:49:39,546 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-11 03:49:39,558 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[83878,83891] [2024-10-11 03:49:39,564 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-11 03:49:39,570 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-11 03:49:39,612 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-11 03:49:39,617 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-11 03:49:39,622 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[101855,101868] [2024-10-11 03:49:39,627 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-11 03:49:39,635 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-11 03:49:39,640 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-11 03:49:39,646 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-11 03:49:39,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:49:39,678 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:49:39,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:39 WrapperNode [2024-10-11 03:49:39,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:49:39,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:49:39,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:49:39,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:49:39,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:39" (1/1) ... [2024-10-11 03:49:39,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:39" (1/1) ... [2024-10-11 03:49:39,820 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 5769 [2024-10-11 03:49:39,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:49:39,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:49:39,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:49:39,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:49:39,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:39" (1/1) ... [2024-10-11 03:49:39,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:39" (1/1) ... [2024-10-11 03:49:39,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:39" (1/1) ... [2024-10-11 03:49:39,891 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:49:39,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:39" (1/1) ... [2024-10-11 03:49:39,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:39" (1/1) ... [2024-10-11 03:49:39,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:39" (1/1) ... [2024-10-11 03:49:39,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:39" (1/1) ... [2024-10-11 03:49:39,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:39" (1/1) ... [2024-10-11 03:49:39,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:39" (1/1) ... [2024-10-11 03:49:39,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:49:39,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:49:39,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:49:39,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:49:39,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:39" (1/1) ... [2024-10-11 03:49:39,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:49:40,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:49:40,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:49:40,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:49:40,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:49:40,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:49:40,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:49:40,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:49:40,228 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:49:40,230 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:49:42,550 INFO L? ?]: Removed 1024 outVars from TransFormulas that were not future-live. [2024-10-11 03:49:42,550 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:49:42,599 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:49:42,599 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:49:42,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:49:42 BoogieIcfgContainer [2024-10-11 03:49:42,600 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:49:42,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:49:42,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:49:42,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:49:42,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:49:38" (1/3) ... [2024-10-11 03:49:42,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422f6385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:49:42, skipping insertion in model container [2024-10-11 03:49:42,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:39" (2/3) ... [2024-10-11 03:49:42,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422f6385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:49:42, skipping insertion in model container [2024-10-11 03:49:42,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:49:42" (3/3) ... [2024-10-11 03:49:42,606 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-10-11 03:49:42,619 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:49:42,620 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-11 03:49:42,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:49:42,698 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;@1860b38a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:49:42,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-11 03:49:42,707 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-11 03:49:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:49:42,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:42,734 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-11 03:49:42,734 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-11 03:49:42,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:42,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1232435330, now seen corresponding path program 1 times [2024-10-11 03:49:42,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:42,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053528166] [2024-10-11 03:49:42,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:42,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:43,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:43,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053528166] [2024-10-11 03:49:43,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053528166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:43,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:43,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:49:43,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997353687] [2024-10-11 03:49:43,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:43,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:49:43,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:43,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:49:43,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:49:43,233 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-11 03:49:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:44,049 INFO L93 Difference]: Finished difference Result 1444 states and 2547 transitions. [2024-10-11 03:49:44,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:49:44,051 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-11 03:49:44,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:44,066 INFO L225 Difference]: With dead ends: 1444 [2024-10-11 03:49:44,066 INFO L226 Difference]: Without dead ends: 870 [2024-10-11 03:49:44,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:49:44,073 INFO L432 NwaCegarLoop]: 835 mSDtfsCounter, 4508 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:44,073 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.7s Time] [2024-10-11 03:49:44,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-10-11 03:49:44,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2024-10-11 03:49:44,161 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-11 03:49:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1127 transitions. [2024-10-11 03:49:44,164 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1127 transitions. Word has length 71 [2024-10-11 03:49:44,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:44,165 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1127 transitions. [2024-10-11 03:49:44,166 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-11 03:49:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1127 transitions. [2024-10-11 03:49:44,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:49:44,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:44,168 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-11 03:49:44,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:49:44,169 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-11 03:49:44,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:44,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1527450296, now seen corresponding path program 1 times [2024-10-11 03:49:44,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:44,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344897627] [2024-10-11 03:49:44,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:44,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:44,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:44,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344897627] [2024-10-11 03:49:44,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344897627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:44,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:44,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:49:44,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374069314] [2024-10-11 03:49:44,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:44,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:49:44,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:44,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:49:44,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:49:44,370 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-11 03:49:44,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:44,783 INFO L93 Difference]: Finished difference Result 1071 states and 1380 transitions. [2024-10-11 03:49:44,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:49:44,784 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-11 03:49:44,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:44,786 INFO L225 Difference]: With dead ends: 1071 [2024-10-11 03:49:44,786 INFO L226 Difference]: Without dead ends: 628 [2024-10-11 03:49:44,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:49:44,788 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 2378 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:44,788 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.4s Time] [2024-10-11 03:49:44,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-10-11 03:49:44,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2024-10-11 03:49:44,797 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-11 03:49:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 816 transitions. [2024-10-11 03:49:44,799 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 816 transitions. Word has length 71 [2024-10-11 03:49:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:44,799 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 816 transitions. [2024-10-11 03:49:44,799 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-11 03:49:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 816 transitions. [2024-10-11 03:49:44,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:49:44,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:44,801 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-11 03:49:44,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:49:44,802 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-11 03:49:44,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:44,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2115552032, now seen corresponding path program 1 times [2024-10-11 03:49:44,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:44,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963590271] [2024-10-11 03:49:44,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:44,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:44,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:44,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:44,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963590271] [2024-10-11 03:49:44,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963590271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:44,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:44,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:49:44,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261969686] [2024-10-11 03:49:44,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:44,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:49:44,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:44,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:49:44,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:49:44,984 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-11 03:49:45,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:45,254 INFO L93 Difference]: Finished difference Result 765 states and 980 transitions. [2024-10-11 03:49:45,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:49:45,254 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-11 03:49:45,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:45,258 INFO L225 Difference]: With dead ends: 765 [2024-10-11 03:49:45,258 INFO L226 Difference]: Without dead ends: 446 [2024-10-11 03:49:45,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:49:45,259 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:45,261 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.2s Time] [2024-10-11 03:49:45,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-11 03:49:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2024-10-11 03:49:45,272 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-11 03:49:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 575 transitions. [2024-10-11 03:49:45,273 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 575 transitions. Word has length 71 [2024-10-11 03:49:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:45,274 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 575 transitions. [2024-10-11 03:49:45,274 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-11 03:49:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 575 transitions. [2024-10-11 03:49:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 03:49:45,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:45,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:45,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:49:45,276 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-11 03:49:45,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:45,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1156366953, now seen corresponding path program 1 times [2024-10-11 03:49:45,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:45,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834932889] [2024-10-11 03:49:45,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:45,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:45,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:45,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834932889] [2024-10-11 03:49:45,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834932889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:45,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:45,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:49:45,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510498738] [2024-10-11 03:49:45,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:45,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:49:45,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:45,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:49:45,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:49:45,410 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-11 03:49:45,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:45,608 INFO L93 Difference]: Finished difference Result 643 states and 834 transitions. [2024-10-11 03:49:45,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:49:45,608 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-11 03:49:45,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:45,610 INFO L225 Difference]: With dead ends: 643 [2024-10-11 03:49:45,610 INFO L226 Difference]: Without dead ends: 397 [2024-10-11 03:49:45,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:49:45,611 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 1488 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11 03:49:45,611 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-11 03:49:45,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-11 03:49:45,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-10-11 03:49:45,616 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-11 03:49:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 514 transitions. [2024-10-11 03:49:45,617 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 514 transitions. Word has length 72 [2024-10-11 03:49:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:45,617 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 514 transitions. [2024-10-11 03:49:45,618 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-11 03:49:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 514 transitions. [2024-10-11 03:49:45,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:49:45,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:45,619 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-11 03:49:45,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:49:45,619 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-11 03:49:45,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:45,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1186891401, now seen corresponding path program 1 times [2024-10-11 03:49:45,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:45,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449903644] [2024-10-11 03:49:45,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:45,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:45,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:45,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449903644] [2024-10-11 03:49:45,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449903644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:45,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:45,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:49:45,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459574433] [2024-10-11 03:49:45,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:45,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:49:45,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:45,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:49:45,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:49:45,731 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-11 03:49:45,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:45,985 INFO L93 Difference]: Finished difference Result 609 states and 796 transitions. [2024-10-11 03:49:45,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:49:45,986 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-11 03:49:45,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:45,987 INFO L225 Difference]: With dead ends: 609 [2024-10-11 03:49:45,987 INFO L226 Difference]: Without dead ends: 389 [2024-10-11 03:49:45,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:49:45,988 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:45,988 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.2s Time] [2024-10-11 03:49:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-11 03:49:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-10-11 03:49:45,993 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-11 03:49:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 504 transitions. [2024-10-11 03:49:45,994 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 504 transitions. Word has length 73 [2024-10-11 03:49:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:45,994 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 504 transitions. [2024-10-11 03:49:45,995 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-11 03:49:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 504 transitions. [2024-10-11 03:49:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:49:45,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:45,995 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-11 03:49:45,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:49:45,996 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-11 03:49:45,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:45,996 INFO L85 PathProgramCache]: Analyzing trace with hash -117023922, now seen corresponding path program 1 times [2024-10-11 03:49:45,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:45,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825202134] [2024-10-11 03:49:45,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:45,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:46,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:46,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825202134] [2024-10-11 03:49:46,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825202134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:46,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:46,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:49:46,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772604886] [2024-10-11 03:49:46,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:46,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:49:46,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:46,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:49:46,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:49:46,302 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-11 03:49:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:46,828 INFO L93 Difference]: Finished difference Result 753 states and 961 transitions. [2024-10-11 03:49:46,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:49:46,829 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-11 03:49:46,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:46,831 INFO L225 Difference]: With dead ends: 753 [2024-10-11 03:49:46,831 INFO L226 Difference]: Without dead ends: 541 [2024-10-11 03:49:46,832 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-11 03:49:46,833 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:46,833 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.4s Time] [2024-10-11 03:49:46,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-10-11 03:49:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 389. [2024-10-11 03:49:46,841 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-11 03:49:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 503 transitions. [2024-10-11 03:49:46,842 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 503 transitions. Word has length 74 [2024-10-11 03:49:46,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:46,843 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 503 transitions. [2024-10-11 03:49:46,843 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-11 03:49:46,843 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 503 transitions. [2024-10-11 03:49:46,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:49:46,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:46,844 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-11 03:49:46,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:49:46,845 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-11 03:49:46,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:46,845 INFO L85 PathProgramCache]: Analyzing trace with hash 98797326, now seen corresponding path program 1 times [2024-10-11 03:49:46,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:46,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975929761] [2024-10-11 03:49:46,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:46,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:47,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:47,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:47,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975929761] [2024-10-11 03:49:47,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975929761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:47,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:47,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:49:47,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449981357] [2024-10-11 03:49:47,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:47,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:47,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:47,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:47,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:47,115 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-11 03:49:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:47,768 INFO L93 Difference]: Finished difference Result 689 states and 911 transitions. [2024-10-11 03:49:47,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:49:47,769 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-11 03:49:47,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:47,770 INFO L225 Difference]: With dead ends: 689 [2024-10-11 03:49:47,771 INFO L226 Difference]: Without dead ends: 600 [2024-10-11 03:49:47,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:49:47,772 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 2089 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:47,772 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.5s Time] [2024-10-11 03:49:47,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-11 03:49:47,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 389. [2024-10-11 03:49:47,778 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-11 03:49:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 502 transitions. [2024-10-11 03:49:47,779 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 502 transitions. Word has length 74 [2024-10-11 03:49:47,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:47,779 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 502 transitions. [2024-10-11 03:49:47,780 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-11 03:49:47,780 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 502 transitions. [2024-10-11 03:49:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:49:47,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:47,780 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-11 03:49:47,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:49:47,781 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-11 03:49:47,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:47,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2064648218, now seen corresponding path program 1 times [2024-10-11 03:49:47,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:47,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535829291] [2024-10-11 03:49:47,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:47,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:48,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:48,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535829291] [2024-10-11 03:49:48,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535829291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:48,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:48,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:49:48,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918092992] [2024-10-11 03:49:48,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:48,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:49:48,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:48,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:49:48,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:49:48,235 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-11 03:49:49,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:49,063 INFO L93 Difference]: Finished difference Result 703 states and 925 transitions. [2024-10-11 03:49:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:49:49,064 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-11 03:49:49,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:49,066 INFO L225 Difference]: With dead ends: 703 [2024-10-11 03:49:49,066 INFO L226 Difference]: Without dead ends: 605 [2024-10-11 03:49:49,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2024-10-11 03:49:49,067 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 2459 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:49,067 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.7s Time] [2024-10-11 03:49:49,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-10-11 03:49:49,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 392. [2024-10-11 03:49:49,073 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-11 03:49:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 505 transitions. [2024-10-11 03:49:49,074 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 505 transitions. Word has length 74 [2024-10-11 03:49:49,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:49,074 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 505 transitions. [2024-10-11 03:49:49,074 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-11 03:49:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 505 transitions. [2024-10-11 03:49:49,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:49:49,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:49,075 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-11 03:49:49,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:49:49,075 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-11 03:49:49,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:49,076 INFO L85 PathProgramCache]: Analyzing trace with hash -878912121, now seen corresponding path program 1 times [2024-10-11 03:49:49,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:49,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603830836] [2024-10-11 03:49:49,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:49,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:49,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-11 03:49:49,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:49,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603830836] [2024-10-11 03:49:49,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603830836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:49,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:49,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:49:49,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620203803] [2024-10-11 03:49:49,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:49,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:49,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:49,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:49,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:49,341 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-11 03:49:50,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:50,039 INFO L93 Difference]: Finished difference Result 732 states and 964 transitions. [2024-10-11 03:49:50,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:49:50,039 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-11 03:49:50,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:50,041 INFO L225 Difference]: With dead ends: 732 [2024-10-11 03:49:50,041 INFO L226 Difference]: Without dead ends: 604 [2024-10-11 03:49:50,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:49:50,042 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 1525 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:50,043 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.6s Time] [2024-10-11 03:49:50,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-11 03:49:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 389. [2024-10-11 03:49:50,049 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-11 03:49:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 501 transitions. [2024-10-11 03:49:50,049 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 501 transitions. Word has length 74 [2024-10-11 03:49:50,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:50,050 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 501 transitions. [2024-10-11 03:49:50,050 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-11 03:49:50,050 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 501 transitions. [2024-10-11 03:49:50,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:49:50,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:50,051 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-11 03:49:50,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:49:50,051 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-11 03:49:50,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:50,052 INFO L85 PathProgramCache]: Analyzing trace with hash 816302217, now seen corresponding path program 1 times [2024-10-11 03:49:50,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:50,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53217644] [2024-10-11 03:49:50,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:50,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:50,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-11 03:49:50,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:50,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53217644] [2024-10-11 03:49:50,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53217644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:50,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:50,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:49:50,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230059541] [2024-10-11 03:49:50,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:50,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:50,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:50,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:50,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:50,314 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-11 03:49:50,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:50,939 INFO L93 Difference]: Finished difference Result 698 states and 916 transitions. [2024-10-11 03:49:50,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:49:50,940 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-11 03:49:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:50,941 INFO L225 Difference]: With dead ends: 698 [2024-10-11 03:49:50,942 INFO L226 Difference]: Without dead ends: 600 [2024-10-11 03:49:50,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:49:50,942 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 1912 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:50,943 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.5s Time] [2024-10-11 03:49:50,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-11 03:49:50,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 389. [2024-10-11 03:49:50,952 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-11 03:49:50,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 500 transitions. [2024-10-11 03:49:50,952 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 500 transitions. Word has length 76 [2024-10-11 03:49:50,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:50,953 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 500 transitions. [2024-10-11 03:49:50,953 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-11 03:49:50,953 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 500 transitions. [2024-10-11 03:49:50,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:49:50,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:50,954 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-11 03:49:50,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:49:50,954 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-11 03:49:50,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:50,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1716231595, now seen corresponding path program 1 times [2024-10-11 03:49:50,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:50,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834214796] [2024-10-11 03:49:50,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:50,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:51,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:51,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834214796] [2024-10-11 03:49:51,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834214796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:51,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:51,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:49:51,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757436987] [2024-10-11 03:49:51,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:51,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:51,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:51,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:51,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:51,254 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-11 03:49:51,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:51,897 INFO L93 Difference]: Finished difference Result 668 states and 872 transitions. [2024-10-11 03:49:51,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:49:51,898 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-11 03:49:51,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:51,899 INFO L225 Difference]: With dead ends: 668 [2024-10-11 03:49:51,899 INFO L226 Difference]: Without dead ends: 592 [2024-10-11 03:49:51,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:49:51,900 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 1533 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:51,900 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.5s Time] [2024-10-11 03:49:51,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-11 03:49:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 389. [2024-10-11 03:49:51,906 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-11 03:49:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 499 transitions. [2024-10-11 03:49:51,907 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 499 transitions. Word has length 76 [2024-10-11 03:49:51,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:51,907 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 499 transitions. [2024-10-11 03:49:51,907 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-11 03:49:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 499 transitions. [2024-10-11 03:49:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:49:51,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:51,908 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-11 03:49:51,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:49:51,908 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-11 03:49:51,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:51,909 INFO L85 PathProgramCache]: Analyzing trace with hash -694606913, now seen corresponding path program 1 times [2024-10-11 03:49:51,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:51,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195542274] [2024-10-11 03:49:51,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:51,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:52,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:52,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:52,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195542274] [2024-10-11 03:49:52,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195542274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:52,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:52,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:49:52,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659512625] [2024-10-11 03:49:52,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:52,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:52,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:52,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:52,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:52,143 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-11 03:49:52,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:52,761 INFO L93 Difference]: Finished difference Result 747 states and 973 transitions. [2024-10-11 03:49:52,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:49:52,761 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-11 03:49:52,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:52,763 INFO L225 Difference]: With dead ends: 747 [2024-10-11 03:49:52,763 INFO L226 Difference]: Without dead ends: 604 [2024-10-11 03:49:52,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:49:52,764 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 1119 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:52,764 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.5s Time] [2024-10-11 03:49:52,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-11 03:49:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 389. [2024-10-11 03:49:52,770 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-11 03:49:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 498 transitions. [2024-10-11 03:49:52,771 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 498 transitions. Word has length 76 [2024-10-11 03:49:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:52,771 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 498 transitions. [2024-10-11 03:49:52,771 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-11 03:49:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 498 transitions. [2024-10-11 03:49:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:49:52,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:52,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:52,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:49:52,772 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-11 03:49:52,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:52,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1449671967, now seen corresponding path program 1 times [2024-10-11 03:49:52,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:52,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363525651] [2024-10-11 03:49:52,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:52,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:52,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:52,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363525651] [2024-10-11 03:49:52,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363525651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:52,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:52,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:49:52,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17477024] [2024-10-11 03:49:52,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:52,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:52,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:52,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:52,960 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-11 03:49:53,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:53,612 INFO L93 Difference]: Finished difference Result 698 states and 915 transitions. [2024-10-11 03:49:53,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:49:53,612 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-11 03:49:53,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:53,614 INFO L225 Difference]: With dead ends: 698 [2024-10-11 03:49:53,614 INFO L226 Difference]: Without dead ends: 600 [2024-10-11 03:49:53,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:49:53,615 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 1548 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:53,616 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.5s Time] [2024-10-11 03:49:53,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-11 03:49:53,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 389. [2024-10-11 03:49:53,622 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-11 03:49:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 497 transitions. [2024-10-11 03:49:53,624 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 497 transitions. Word has length 76 [2024-10-11 03:49:53,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:53,624 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 497 transitions. [2024-10-11 03:49:53,624 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-11 03:49:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 497 transitions. [2024-10-11 03:49:53,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:49:53,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:53,626 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-11 03:49:53,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:49:53,626 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-11 03:49:53,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:53,627 INFO L85 PathProgramCache]: Analyzing trace with hash -263935870, now seen corresponding path program 1 times [2024-10-11 03:49:53,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:53,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562481287] [2024-10-11 03:49:53,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:53,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:53,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:53,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:53,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562481287] [2024-10-11 03:49:53,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562481287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:53,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:53,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:49:53,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633659253] [2024-10-11 03:49:53,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:53,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:53,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:53,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:53,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:53,899 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-11 03:49:54,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:54,569 INFO L93 Difference]: Finished difference Result 668 states and 870 transitions. [2024-10-11 03:49:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:49:54,570 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-11 03:49:54,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:54,571 INFO L225 Difference]: With dead ends: 668 [2024-10-11 03:49:54,571 INFO L226 Difference]: Without dead ends: 592 [2024-10-11 03:49:54,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:49:54,572 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-11 03:49:54,573 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-11 03:49:54,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-11 03:49:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 389. [2024-10-11 03:49:54,579 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-11 03:49:54,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 496 transitions. [2024-10-11 03:49:54,580 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 496 transitions. Word has length 76 [2024-10-11 03:49:54,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:54,581 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 496 transitions. [2024-10-11 03:49:54,581 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-11 03:49:54,581 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 496 transitions. [2024-10-11 03:49:54,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:49:54,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:54,582 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-11 03:49:54,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:49:54,582 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-11 03:49:54,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:54,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1457950665, now seen corresponding path program 1 times [2024-10-11 03:49:54,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:54,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894746494] [2024-10-11 03:49:54,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:54,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:54,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:54,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894746494] [2024-10-11 03:49:54,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894746494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:54,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:54,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:49:54,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378898168] [2024-10-11 03:49:54,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:54,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:49:54,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:54,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:49:54,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:49:54,995 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-11 03:49:55,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:55,907 INFO L93 Difference]: Finished difference Result 870 states and 1164 transitions. [2024-10-11 03:49:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:49:55,908 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-11 03:49:55,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:55,910 INFO L225 Difference]: With dead ends: 870 [2024-10-11 03:49:55,910 INFO L226 Difference]: Without dead ends: 794 [2024-10-11 03:49:55,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:49:55,912 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 4069 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:55,913 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.6s Time] [2024-10-11 03:49:55,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-10-11 03:49:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 393. [2024-10-11 03:49:55,918 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-11 03:49:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 500 transitions. [2024-10-11 03:49:55,919 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 500 transitions. Word has length 76 [2024-10-11 03:49:55,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:55,919 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 500 transitions. [2024-10-11 03:49:55,919 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-11 03:49:55,919 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 500 transitions. [2024-10-11 03:49:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:49:55,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:55,920 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-11 03:49:55,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:49:55,920 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-11 03:49:55,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash -995702185, now seen corresponding path program 1 times [2024-10-11 03:49:55,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:55,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367676195] [2024-10-11 03:49:55,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:55,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:56,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:56,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367676195] [2024-10-11 03:49:56,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367676195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:56,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:56,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:49:56,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824644735] [2024-10-11 03:49:56,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:56,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:56,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:56,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:56,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:56,150 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-11 03:49:56,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:56,624 INFO L93 Difference]: Finished difference Result 664 states and 864 transitions. [2024-10-11 03:49:56,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:49:56,625 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-11 03:49:56,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:56,626 INFO L225 Difference]: With dead ends: 664 [2024-10-11 03:49:56,626 INFO L226 Difference]: Without dead ends: 592 [2024-10-11 03:49:56,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:49:56,627 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 1839 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:56,627 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.4s Time] [2024-10-11 03:49:56,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-11 03:49:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 393. [2024-10-11 03:49:56,632 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-11 03:49:56,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 499 transitions. [2024-10-11 03:49:56,633 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 499 transitions. Word has length 76 [2024-10-11 03:49:56,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:56,634 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 499 transitions. [2024-10-11 03:49:56,634 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-11 03:49:56,634 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 499 transitions. [2024-10-11 03:49:56,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:49:56,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:56,635 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-11 03:49:56,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:49:56,636 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-11 03:49:56,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:56,636 INFO L85 PathProgramCache]: Analyzing trace with hash -774147926, now seen corresponding path program 1 times [2024-10-11 03:49:56,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:56,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967928126] [2024-10-11 03:49:56,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:56,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:56,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:56,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967928126] [2024-10-11 03:49:56,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967928126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:56,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:56,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:49:56,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832051919] [2024-10-11 03:49:56,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:56,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:56,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:56,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:56,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:56,847 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-11 03:49:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:57,399 INFO L93 Difference]: Finished difference Result 668 states and 866 transitions. [2024-10-11 03:49:57,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:49:57,400 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-11 03:49:57,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:57,401 INFO L225 Difference]: With dead ends: 668 [2024-10-11 03:49:57,401 INFO L226 Difference]: Without dead ends: 592 [2024-10-11 03:49:57,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:49:57,402 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:57,402 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.4s Time] [2024-10-11 03:49:57,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-11 03:49:57,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 389. [2024-10-11 03:49:57,407 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-11 03:49:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 494 transitions. [2024-10-11 03:49:57,407 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 494 transitions. Word has length 77 [2024-10-11 03:49:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:57,408 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 494 transitions. [2024-10-11 03:49:57,408 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-11 03:49:57,408 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 494 transitions. [2024-10-11 03:49:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:49:57,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:57,409 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-11 03:49:57,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:49:57,409 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-11 03:49:57,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash 513544580, now seen corresponding path program 1 times [2024-10-11 03:49:57,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:57,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270947668] [2024-10-11 03:49:57,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:57,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:57,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:57,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270947668] [2024-10-11 03:49:57,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270947668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:57,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:57,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:49:57,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895855084] [2024-10-11 03:49:57,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:57,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:57,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:57,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:57,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:57,644 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-11 03:49:58,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:58,082 INFO L93 Difference]: Finished difference Result 673 states and 870 transitions. [2024-10-11 03:49:58,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:49:58,082 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-11 03:49:58,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:58,084 INFO L225 Difference]: With dead ends: 673 [2024-10-11 03:49:58,084 INFO L226 Difference]: Without dead ends: 592 [2024-10-11 03:49:58,084 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-11 03:49:58,085 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 1480 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:58,085 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.4s Time] [2024-10-11 03:49:58,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-11 03:49:58,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 389. [2024-10-11 03:49:58,096 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-11 03:49:58,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 493 transitions. [2024-10-11 03:49:58,097 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 493 transitions. Word has length 78 [2024-10-11 03:49:58,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:58,097 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 493 transitions. [2024-10-11 03:49:58,097 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-11 03:49:58,097 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 493 transitions. [2024-10-11 03:49:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:49:58,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:58,098 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-11 03:49:58,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:49:58,098 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-11 03:49:58,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:58,099 INFO L85 PathProgramCache]: Analyzing trace with hash 2002078059, now seen corresponding path program 1 times [2024-10-11 03:49:58,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:58,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739342819] [2024-10-11 03:49:58,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:58,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:58,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:58,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:58,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739342819] [2024-10-11 03:49:58,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739342819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:58,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:58,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:49:58,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766101406] [2024-10-11 03:49:58,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:58,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:58,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:58,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:58,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:58,306 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-11 03:49:58,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:58,860 INFO L93 Difference]: Finished difference Result 645 states and 828 transitions. [2024-10-11 03:49:58,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:49:58,860 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-11 03:49:58,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:58,862 INFO L225 Difference]: With dead ends: 645 [2024-10-11 03:49:58,862 INFO L226 Difference]: Without dead ends: 576 [2024-10-11 03:49:58,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:49:58,863 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-11 03:49:58,863 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-11 03:49:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-10-11 03:49:58,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 389. [2024-10-11 03:49:58,867 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-11 03:49:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 492 transitions. [2024-10-11 03:49:58,868 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 492 transitions. Word has length 78 [2024-10-11 03:49:58,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:58,868 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 492 transitions. [2024-10-11 03:49:58,868 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-11 03:49:58,868 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 492 transitions. [2024-10-11 03:49:58,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:49:58,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:58,869 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-11 03:49:58,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:49:58,869 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-11 03:49:58,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:58,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1513420061, now seen corresponding path program 1 times [2024-10-11 03:49:58,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:58,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347144774] [2024-10-11 03:49:58,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:58,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:59,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:59,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347144774] [2024-10-11 03:49:59,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347144774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:59,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:59,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:49:59,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303977767] [2024-10-11 03:49:59,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:59,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:49:59,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:59,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:49:59,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:49:59,264 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-11 03:50:00,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:00,250 INFO L93 Difference]: Finished difference Result 946 states and 1266 transitions. [2024-10-11 03:50:00,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:50:00,251 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-11 03:50:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:00,253 INFO L225 Difference]: With dead ends: 946 [2024-10-11 03:50:00,253 INFO L226 Difference]: Without dead ends: 842 [2024-10-11 03:50:00,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:50:00,254 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 3490 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:00,255 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.7s Time] [2024-10-11 03:50:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2024-10-11 03:50:00,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 393. [2024-10-11 03:50:00,262 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-11 03:50:00,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 496 transitions. [2024-10-11 03:50:00,263 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 496 transitions. Word has length 78 [2024-10-11 03:50:00,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:00,263 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 496 transitions. [2024-10-11 03:50:00,263 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-11 03:50:00,264 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 496 transitions. [2024-10-11 03:50:00,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:50:00,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:00,264 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-11 03:50:00,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:50:00,265 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-11 03:50:00,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:00,265 INFO L85 PathProgramCache]: Analyzing trace with hash -675860338, now seen corresponding path program 1 times [2024-10-11 03:50:00,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:00,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064668608] [2024-10-11 03:50:00,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:00,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:00,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:00,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064668608] [2024-10-11 03:50:00,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064668608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:00,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:00,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:00,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453012862] [2024-10-11 03:50:00,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:00,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:00,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:00,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:00,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:00,476 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-11 03:50:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:00,973 INFO L93 Difference]: Finished difference Result 613 states and 776 transitions. [2024-10-11 03:50:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:50:00,974 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-11 03:50:00,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:00,975 INFO L225 Difference]: With dead ends: 613 [2024-10-11 03:50:00,975 INFO L226 Difference]: Without dead ends: 596 [2024-10-11 03:50:00,976 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-11 03:50:00,976 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 1474 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:00,976 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.4s Time] [2024-10-11 03:50:00,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-10-11 03:50:00,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 393. [2024-10-11 03:50:00,982 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-11 03:50:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 495 transitions. [2024-10-11 03:50:00,982 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 495 transitions. Word has length 78 [2024-10-11 03:50:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:00,983 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 495 transitions. [2024-10-11 03:50:00,983 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-11 03:50:00,983 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 495 transitions. [2024-10-11 03:50:00,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:50:00,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:00,984 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-11 03:50:00,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:50:00,984 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-11 03:50:00,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:00,984 INFO L85 PathProgramCache]: Analyzing trace with hash 812673141, now seen corresponding path program 1 times [2024-10-11 03:50:00,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:00,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460950652] [2024-10-11 03:50:00,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:00,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:01,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:01,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460950652] [2024-10-11 03:50:01,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460950652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:01,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:01,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:01,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953305233] [2024-10-11 03:50:01,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:01,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:01,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:01,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:01,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:01,166 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-11 03:50:01,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:01,710 INFO L93 Difference]: Finished difference Result 585 states and 734 transitions. [2024-10-11 03:50:01,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:50:01,710 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-11 03:50:01,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:01,712 INFO L225 Difference]: With dead ends: 585 [2024-10-11 03:50:01,712 INFO L226 Difference]: Without dead ends: 580 [2024-10-11 03:50:01,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:50:01,712 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:01,713 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.4s Time] [2024-10-11 03:50:01,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-11 03:50:01,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2024-10-11 03:50:01,717 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-11 03:50:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 494 transitions. [2024-10-11 03:50:01,717 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 494 transitions. Word has length 78 [2024-10-11 03:50:01,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:01,718 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 494 transitions. [2024-10-11 03:50:01,718 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-11 03:50:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 494 transitions. [2024-10-11 03:50:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:50:01,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:01,719 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:01,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:50:01,719 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-11 03:50:01,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:01,720 INFO L85 PathProgramCache]: Analyzing trace with hash 406757360, now seen corresponding path program 1 times [2024-10-11 03:50:01,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:01,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193958946] [2024-10-11 03:50:01,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:01,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:02,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:02,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193958946] [2024-10-11 03:50:02,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193958946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:02,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:02,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:50:02,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944798118] [2024-10-11 03:50:02,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:02,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:50:02,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:02,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:50:02,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:50:02,053 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-11 03:50:02,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:02,828 INFO L93 Difference]: Finished difference Result 747 states and 969 transitions. [2024-10-11 03:50:02,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:50:02,828 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-11 03:50:02,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:02,830 INFO L225 Difference]: With dead ends: 747 [2024-10-11 03:50:02,830 INFO L226 Difference]: Without dead ends: 742 [2024-10-11 03:50:02,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:50:02,831 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 4027 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:02,831 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.5s Time] [2024-10-11 03:50:02,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-10-11 03:50:02,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 397. [2024-10-11 03:50:02,835 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-11 03:50:02,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 498 transitions. [2024-10-11 03:50:02,836 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 498 transitions. Word has length 78 [2024-10-11 03:50:02,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:02,836 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 498 transitions. [2024-10-11 03:50:02,836 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-11 03:50:02,836 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 498 transitions. [2024-10-11 03:50:02,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:50:02,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:02,837 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-11 03:50:02,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:50:02,837 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-11 03:50:02,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:02,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1340403830, now seen corresponding path program 1 times [2024-10-11 03:50:02,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:02,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179620736] [2024-10-11 03:50:02,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:02,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:03,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:03,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179620736] [2024-10-11 03:50:03,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179620736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:03,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:03,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:03,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383435475] [2024-10-11 03:50:03,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:03,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:03,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:03,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:03,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:03,030 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-11 03:50:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:03,506 INFO L93 Difference]: Finished difference Result 646 states and 825 transitions. [2024-10-11 03:50:03,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:50:03,507 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-11 03:50:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:03,508 INFO L225 Difference]: With dead ends: 646 [2024-10-11 03:50:03,508 INFO L226 Difference]: Without dead ends: 580 [2024-10-11 03:50:03,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:50:03,509 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 1540 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:03,509 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.4s Time] [2024-10-11 03:50:03,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-11 03:50:03,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 397. [2024-10-11 03:50:03,514 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-11 03:50:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 497 transitions. [2024-10-11 03:50:03,515 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 497 transitions. Word has length 78 [2024-10-11 03:50:03,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:03,515 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 497 transitions. [2024-10-11 03:50:03,515 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-11 03:50:03,515 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 497 transitions. [2024-10-11 03:50:03,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:50:03,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:03,516 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-11 03:50:03,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:50:03,516 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-11 03:50:03,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:03,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1562286502, now seen corresponding path program 1 times [2024-10-11 03:50:03,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:03,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65956008] [2024-10-11 03:50:03,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:03,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:03,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:03,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65956008] [2024-10-11 03:50:03,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65956008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:03,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:03,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:03,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240454092] [2024-10-11 03:50:03,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:03,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:03,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:03,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:03,747 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-11 03:50:04,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:04,295 INFO L93 Difference]: Finished difference Result 649 states and 827 transitions. [2024-10-11 03:50:04,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:50:04,295 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-11 03:50:04,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:04,297 INFO L225 Difference]: With dead ends: 649 [2024-10-11 03:50:04,297 INFO L226 Difference]: Without dead ends: 580 [2024-10-11 03:50:04,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:50:04,298 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-11 03:50:04,298 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-11 03:50:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-11 03:50:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 397. [2024-10-11 03:50:04,303 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-11 03:50:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 496 transitions. [2024-10-11 03:50:04,303 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 496 transitions. Word has length 78 [2024-10-11 03:50:04,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:04,303 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 496 transitions. [2024-10-11 03:50:04,304 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-11 03:50:04,304 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 496 transitions. [2024-10-11 03:50:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:50:04,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:04,304 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-11 03:50:04,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:50:04,305 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-11 03:50:04,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash 978066431, now seen corresponding path program 1 times [2024-10-11 03:50:04,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:04,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788016817] [2024-10-11 03:50:04,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:04,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:04,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:04,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788016817] [2024-10-11 03:50:04,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788016817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:04,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:04,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:50:04,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329076157] [2024-10-11 03:50:04,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:04,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:50:04,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:04,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:50:04,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:50:04,663 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-11 03:50:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:05,572 INFO L93 Difference]: Finished difference Result 883 states and 1165 transitions. [2024-10-11 03:50:05,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:50:05,573 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-11 03:50:05,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:05,575 INFO L225 Difference]: With dead ends: 883 [2024-10-11 03:50:05,575 INFO L226 Difference]: Without dead ends: 802 [2024-10-11 03:50:05,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:50:05,576 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 3985 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:05,576 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.6s Time] [2024-10-11 03:50:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2024-10-11 03:50:05,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 401. [2024-10-11 03:50:05,581 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-11 03:50:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 500 transitions. [2024-10-11 03:50:05,582 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 500 transitions. Word has length 78 [2024-10-11 03:50:05,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:05,582 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 500 transitions. [2024-10-11 03:50:05,583 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-11 03:50:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 500 transitions. [2024-10-11 03:50:05,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:50:05,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:05,583 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-11 03:50:05,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:50:05,584 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-11 03:50:05,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:05,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1364256377, now seen corresponding path program 1 times [2024-10-11 03:50:05,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:05,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312300554] [2024-10-11 03:50:05,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:05,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:05,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-11 03:50:05,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:05,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312300554] [2024-10-11 03:50:05,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312300554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:05,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:05,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:05,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310185696] [2024-10-11 03:50:05,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:05,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:05,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:05,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:05,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:05,809 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-11 03:50:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:06,227 INFO L93 Difference]: Finished difference Result 653 states and 830 transitions. [2024-10-11 03:50:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:50:06,227 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-11 03:50:06,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:06,228 INFO L225 Difference]: With dead ends: 653 [2024-10-11 03:50:06,229 INFO L226 Difference]: Without dead ends: 584 [2024-10-11 03:50:06,229 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-11 03:50:06,229 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:06,230 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.3s Time] [2024-10-11 03:50:06,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-11 03:50:06,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 401. [2024-10-11 03:50:06,234 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-11 03:50:06,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 499 transitions. [2024-10-11 03:50:06,234 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 499 transitions. Word has length 78 [2024-10-11 03:50:06,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:06,235 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 499 transitions. [2024-10-11 03:50:06,235 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-11 03:50:06,235 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 499 transitions. [2024-10-11 03:50:06,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:50:06,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:06,235 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-11 03:50:06,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:50:06,236 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-11 03:50:06,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:06,236 INFO L85 PathProgramCache]: Analyzing trace with hash 2113755607, now seen corresponding path program 1 times [2024-10-11 03:50:06,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:06,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781902523] [2024-10-11 03:50:06,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:06,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:06,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:06,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781902523] [2024-10-11 03:50:06,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781902523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:06,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:06,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:06,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104904312] [2024-10-11 03:50:06,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:06,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:06,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:06,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:06,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:06,394 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-11 03:50:06,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:06,791 INFO L93 Difference]: Finished difference Result 650 states and 825 transitions. [2024-10-11 03:50:06,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:50:06,792 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-11 03:50:06,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:06,793 INFO L225 Difference]: With dead ends: 650 [2024-10-11 03:50:06,793 INFO L226 Difference]: Without dead ends: 584 [2024-10-11 03:50:06,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:50:06,794 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 1215 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:06,794 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.3s Time] [2024-10-11 03:50:06,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-11 03:50:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 401. [2024-10-11 03:50:06,797 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-11 03:50:06,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 498 transitions. [2024-10-11 03:50:06,798 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 498 transitions. Word has length 78 [2024-10-11 03:50:06,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:06,798 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 498 transitions. [2024-10-11 03:50:06,798 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-11 03:50:06,798 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 498 transitions. [2024-10-11 03:50:06,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:50:06,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:06,799 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-11 03:50:06,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 03:50:06,799 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-11 03:50:06,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:06,799 INFO L85 PathProgramCache]: Analyzing trace with hash 390823278, now seen corresponding path program 1 times [2024-10-11 03:50:06,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:06,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279828854] [2024-10-11 03:50:06,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:06,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:07,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:07,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279828854] [2024-10-11 03:50:07,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279828854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:07,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:07,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:50:07,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133479984] [2024-10-11 03:50:07,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:07,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:50:07,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:07,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:50:07,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:50:07,140 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-11 03:50:07,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:07,911 INFO L93 Difference]: Finished difference Result 751 states and 967 transitions. [2024-10-11 03:50:07,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:50:07,911 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-11 03:50:07,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:07,913 INFO L225 Difference]: With dead ends: 751 [2024-10-11 03:50:07,913 INFO L226 Difference]: Without dead ends: 746 [2024-10-11 03:50:07,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:50:07,914 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 4021 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:07,914 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.5s Time] [2024-10-11 03:50:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-10-11 03:50:07,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 405. [2024-10-11 03:50:07,923 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-11 03:50:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 502 transitions. [2024-10-11 03:50:07,924 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 502 transitions. Word has length 78 [2024-10-11 03:50:07,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:07,924 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 502 transitions. [2024-10-11 03:50:07,925 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-11 03:50:07,925 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 502 transitions. [2024-10-11 03:50:07,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:50:07,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50: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-11 03:50:07,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 03:50:07,925 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-11 03:50:07,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:07,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1188609875, now seen corresponding path program 1 times [2024-10-11 03:50:07,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:07,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862462670] [2024-10-11 03:50:07,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:07,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:08,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:08,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862462670] [2024-10-11 03:50:08,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862462670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:08,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:08,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:08,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856602111] [2024-10-11 03:50:08,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:08,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:08,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:08,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:08,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:08,109 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-11 03:50:08,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:08,611 INFO L93 Difference]: Finished difference Result 650 states and 823 transitions. [2024-10-11 03:50:08,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:50:08,611 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-11 03:50:08,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:08,613 INFO L225 Difference]: With dead ends: 650 [2024-10-11 03:50:08,613 INFO L226 Difference]: Without dead ends: 584 [2024-10-11 03:50:08,613 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-11 03:50:08,614 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-11 03:50:08,614 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-11 03:50:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-11 03:50:08,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 405. [2024-10-11 03:50:08,618 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-11 03:50:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 501 transitions. [2024-10-11 03:50:08,619 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 501 transitions. Word has length 78 [2024-10-11 03:50:08,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:08,619 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 501 transitions. [2024-10-11 03:50:08,619 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-11 03:50:08,619 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 501 transitions. [2024-10-11 03:50:08,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:50:08,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:08,620 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-11 03:50:08,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 03:50:08,620 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-11 03:50:08,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:08,620 INFO L85 PathProgramCache]: Analyzing trace with hash 848969234, now seen corresponding path program 1 times [2024-10-11 03:50:08,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:08,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030677414] [2024-10-11 03:50:08,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:08,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:08,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:08,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030677414] [2024-10-11 03:50:08,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030677414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:08,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:08,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:08,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017282416] [2024-10-11 03:50:08,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:08,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:08,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:08,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:08,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:08,813 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-11 03:50:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:09,277 INFO L93 Difference]: Finished difference Result 650 states and 822 transitions. [2024-10-11 03:50:09,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:50:09,277 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-11 03:50:09,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:09,279 INFO L225 Difference]: With dead ends: 650 [2024-10-11 03:50:09,279 INFO L226 Difference]: Without dead ends: 584 [2024-10-11 03:50:09,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:50:09,280 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 1215 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:09,280 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.4s Time] [2024-10-11 03:50:09,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-11 03:50:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 405. [2024-10-11 03:50:09,289 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-11 03:50:09,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 500 transitions. [2024-10-11 03:50:09,289 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 500 transitions. Word has length 78 [2024-10-11 03:50:09,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:09,290 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 500 transitions. [2024-10-11 03:50:09,290 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-11 03:50:09,290 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 500 transitions. [2024-10-11 03:50:09,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 03:50:09,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:09,290 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-11 03:50:09,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 03:50:09,291 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-11 03:50:09,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:09,291 INFO L85 PathProgramCache]: Analyzing trace with hash -552246912, now seen corresponding path program 1 times [2024-10-11 03:50:09,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:09,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765003901] [2024-10-11 03:50:09,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:09,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:09,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:09,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765003901] [2024-10-11 03:50:09,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765003901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:09,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:09,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:09,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690749] [2024-10-11 03:50:09,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:09,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:09,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:09,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:09,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:09,474 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-11 03:50:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:09,994 INFO L93 Difference]: Finished difference Result 720 states and 914 transitions. [2024-10-11 03:50:09,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:50:09,994 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-11 03:50:09,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:09,996 INFO L225 Difference]: With dead ends: 720 [2024-10-11 03:50:09,996 INFO L226 Difference]: Without dead ends: 616 [2024-10-11 03:50:09,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:50:09,997 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 1012 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:09,997 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.4s Time] [2024-10-11 03:50:09,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-10-11 03:50:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 401. [2024-10-11 03:50:10,000 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-11 03:50:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 495 transitions. [2024-10-11 03:50:10,001 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 495 transitions. Word has length 79 [2024-10-11 03:50:10,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:10,001 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 495 transitions. [2024-10-11 03:50:10,001 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-11 03:50:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 495 transitions. [2024-10-11 03:50:10,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 03:50:10,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:10,002 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-11 03:50:10,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 03:50:10,002 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-11 03:50:10,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:10,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2131483169, now seen corresponding path program 1 times [2024-10-11 03:50:10,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:10,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842178502] [2024-10-11 03:50:10,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:10,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:10,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:10,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842178502] [2024-10-11 03:50:10,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842178502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:10,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:10,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:10,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916561526] [2024-10-11 03:50:10,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:10,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:10,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:10,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:10,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:10,144 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-11 03:50:10,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:10,573 INFO L93 Difference]: Finished difference Result 585 states and 722 transitions. [2024-10-11 03:50:10,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:50:10,573 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-11 03:50:10,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:10,575 INFO L225 Difference]: With dead ends: 585 [2024-10-11 03:50:10,575 INFO L226 Difference]: Without dead ends: 580 [2024-10-11 03:50:10,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:50:10,575 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:10,576 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.3s Time] [2024-10-11 03:50:10,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-11 03:50:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 397. [2024-10-11 03:50:10,579 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-11 03:50:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 490 transitions. [2024-10-11 03:50:10,580 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 490 transitions. Word has length 79 [2024-10-11 03:50:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:10,580 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 490 transitions. [2024-10-11 03:50:10,580 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-11 03:50:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 490 transitions. [2024-10-11 03:50:10,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 03:50:10,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:10,581 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-11 03:50:10,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 03:50:10,581 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-11 03:50:10,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:10,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1464004193, now seen corresponding path program 1 times [2024-10-11 03:50:10,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:10,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812365487] [2024-10-11 03:50:10,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:10,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:10,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:10,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812365487] [2024-10-11 03:50:10,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812365487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:10,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:10,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:10,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032538272] [2024-10-11 03:50:10,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:10,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:10,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:10,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:10,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:10,749 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-11 03:50:11,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:11,229 INFO L93 Difference]: Finished difference Result 681 states and 861 transitions. [2024-10-11 03:50:11,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:50:11,229 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-11 03:50:11,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:11,231 INFO L225 Difference]: With dead ends: 681 [2024-10-11 03:50:11,231 INFO L226 Difference]: Without dead ends: 600 [2024-10-11 03:50:11,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:50:11,232 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 1106 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:11,232 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.4s Time] [2024-10-11 03:50:11,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-11 03:50:11,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 393. [2024-10-11 03:50:11,236 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-11 03:50:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 485 transitions. [2024-10-11 03:50:11,236 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 485 transitions. Word has length 79 [2024-10-11 03:50:11,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:11,237 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 485 transitions. [2024-10-11 03:50:11,237 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-11 03:50:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 485 transitions. [2024-10-11 03:50:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 03:50:11,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:11,237 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-11 03:50:11,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 03:50:11,238 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-11 03:50:11,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:11,238 INFO L85 PathProgramCache]: Analyzing trace with hash -538584006, now seen corresponding path program 1 times [2024-10-11 03:50:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:11,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516253847] [2024-10-11 03:50:11,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:11,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:11,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:11,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516253847] [2024-10-11 03:50:11,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516253847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:11,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:11,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:11,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632785166] [2024-10-11 03:50:11,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:11,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:11,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:11,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:11,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:11,387 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-11 03:50:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:11,833 INFO L93 Difference]: Finished difference Result 581 states and 716 transitions. [2024-10-11 03:50:11,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:50:11,834 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-11 03:50:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:11,835 INFO L225 Difference]: With dead ends: 581 [2024-10-11 03:50:11,835 INFO L226 Difference]: Without dead ends: 576 [2024-10-11 03:50:11,835 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-11 03:50:11,836 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 1051 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:11,836 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.4s Time] [2024-10-11 03:50:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-10-11 03:50:11,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 389. [2024-10-11 03:50:11,839 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-11 03:50:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 480 transitions. [2024-10-11 03:50:11,840 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 480 transitions. Word has length 79 [2024-10-11 03:50:11,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:11,840 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 480 transitions. [2024-10-11 03:50:11,840 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-11 03:50:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 480 transitions. [2024-10-11 03:50:11,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 03:50:11,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:11,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:11,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 03:50:11,841 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-11 03:50:11,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:11,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1401129693, now seen corresponding path program 1 times [2024-10-11 03:50:11,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:11,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902121680] [2024-10-11 03:50:11,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:11,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:12,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:12,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902121680] [2024-10-11 03:50:12,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902121680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:12,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:12,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:12,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444455423] [2024-10-11 03:50:12,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:12,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:12,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:12,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:12,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:12,023 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-11 03:50:12,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:12,467 INFO L93 Difference]: Finished difference Result 640 states and 806 transitions. [2024-10-11 03:50:12,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:50:12,468 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-11 03:50:12,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:12,469 INFO L225 Difference]: With dead ends: 640 [2024-10-11 03:50:12,469 INFO L226 Difference]: Without dead ends: 575 [2024-10-11 03:50:12,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:50:12,470 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 1505 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:12,470 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.4s Time] [2024-10-11 03:50:12,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-10-11 03:50:12,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 388. [2024-10-11 03:50:12,473 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-11 03:50:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 478 transitions. [2024-10-11 03:50:12,474 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 478 transitions. Word has length 79 [2024-10-11 03:50:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:12,474 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 478 transitions. [2024-10-11 03:50:12,474 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-11 03:50:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 478 transitions. [2024-10-11 03:50:12,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 03:50:12,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:12,474 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-11 03:50:12,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 03:50:12,475 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-11 03:50:12,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:12,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1269258616, now seen corresponding path program 1 times [2024-10-11 03:50:12,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:12,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57251661] [2024-10-11 03:50:12,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:12,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:12,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:12,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57251661] [2024-10-11 03:50:12,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57251661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:12,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:12,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:50:12,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347878073] [2024-10-11 03:50:12,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:12,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:50:12,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:12,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:50:12,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:50:12,885 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-11 03:50:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:13,586 INFO L93 Difference]: Finished difference Result 637 states and 802 transitions. [2024-10-11 03:50:13,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:50:13,586 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-11 03:50:13,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:13,588 INFO L225 Difference]: With dead ends: 637 [2024-10-11 03:50:13,588 INFO L226 Difference]: Without dead ends: 569 [2024-10-11 03:50:13,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:50:13,588 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 2380 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:13,588 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.5s Time] [2024-10-11 03:50:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-10-11 03:50:13,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 384. [2024-10-11 03:50:13,591 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-11 03:50:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 473 transitions. [2024-10-11 03:50:13,592 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 473 transitions. Word has length 80 [2024-10-11 03:50:13,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:13,592 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 473 transitions. [2024-10-11 03:50:13,592 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-11 03:50:13,592 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 473 transitions. [2024-10-11 03:50:13,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 03:50:13,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:13,593 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-11 03:50:13,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 03:50:13,593 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-11 03:50:13,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:13,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1637753759, now seen corresponding path program 1 times [2024-10-11 03:50:13,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:13,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942495057] [2024-10-11 03:50:13,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:13,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:13,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:13,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942495057] [2024-10-11 03:50:13,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942495057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:13,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:13,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:50:13,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966696087] [2024-10-11 03:50:13,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:13,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:50:13,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:13,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:50:13,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:50:13,952 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-11 03:50:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:14,668 INFO L93 Difference]: Finished difference Result 629 states and 793 transitions. [2024-10-11 03:50:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:50:14,668 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-11 03:50:14,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:14,670 INFO L225 Difference]: With dead ends: 629 [2024-10-11 03:50:14,670 INFO L226 Difference]: Without dead ends: 561 [2024-10-11 03:50:14,670 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-11 03:50:14,670 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-11 03:50:14,671 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-11 03:50:14,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-10-11 03:50:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 380. [2024-10-11 03:50:14,674 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-11 03:50:14,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 468 transitions. [2024-10-11 03:50:14,674 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 468 transitions. Word has length 80 [2024-10-11 03:50:14,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:14,674 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 468 transitions. [2024-10-11 03:50:14,675 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-11 03:50:14,675 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 468 transitions. [2024-10-11 03:50:14,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 03:50:14,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:14,675 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-11 03:50:14,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-11 03:50:14,675 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-11 03:50:14,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:14,676 INFO L85 PathProgramCache]: Analyzing trace with hash 652259760, now seen corresponding path program 1 times [2024-10-11 03:50:14,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:14,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014413643] [2024-10-11 03:50:14,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:14,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:16,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:16,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014413643] [2024-10-11 03:50:16,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014413643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:16,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:16,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2024-10-11 03:50:16,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776768963] [2024-10-11 03:50:16,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:16,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 03:50:16,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:16,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 03:50:16,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2024-10-11 03:50:16,160 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-11 03:50:20,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:20,701 INFO L93 Difference]: Finished difference Result 1263 states and 1585 transitions. [2024-10-11 03:50:20,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-11 03:50:20,701 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-11 03:50:20,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:20,704 INFO L225 Difference]: With dead ends: 1263 [2024-10-11 03:50:20,704 INFO L226 Difference]: Without dead ends: 1198 [2024-10-11 03:50:20,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=434, Invalid=2536, Unknown=0, NotChecked=0, Total=2970 [2024-10-11 03:50:20,706 INFO L432 NwaCegarLoop]: 1014 mSDtfsCounter, 4603 mSDsluCounter, 13031 mSDsCounter, 0 mSdLazyCounter, 8152 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:20,706 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.4s Time] [2024-10-11 03:50:20,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2024-10-11 03:50:20,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 399. [2024-10-11 03:50:20,712 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-11 03:50:20,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 493 transitions. [2024-10-11 03:50:20,713 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 493 transitions. Word has length 80 [2024-10-11 03:50:20,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:20,713 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 493 transitions. [2024-10-11 03:50:20,713 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-11 03:50:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 493 transitions. [2024-10-11 03:50:20,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 03:50:20,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:20,714 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-11 03:50:20,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-11 03:50:20,714 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-11 03:50:20,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:20,715 INFO L85 PathProgramCache]: Analyzing trace with hash 610527558, now seen corresponding path program 1 times [2024-10-11 03:50:20,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:20,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044909513] [2024-10-11 03:50:20,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:20,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:21,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:21,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:21,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044909513] [2024-10-11 03:50:21,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044909513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:21,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:21,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-10-11 03:50:21,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823316998] [2024-10-11 03:50:21,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:21,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 03:50:21,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:21,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 03:50:21,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:50:21,549 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-11 03:50:26,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:26,063 INFO L93 Difference]: Finished difference Result 1406 states and 1764 transitions. [2024-10-11 03:50:26,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 03:50:26,063 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-11 03:50:26,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:26,066 INFO L225 Difference]: With dead ends: 1406 [2024-10-11 03:50:26,066 INFO L226 Difference]: Without dead ends: 1336 [2024-10-11 03:50:26,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=314, Invalid=1848, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 03:50:26,067 INFO L432 NwaCegarLoop]: 1288 mSDtfsCounter, 3489 mSDsluCounter, 17731 mSDsCounter, 0 mSdLazyCounter, 10139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:26,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3489 Valid, 19019 Invalid, 10141 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 10139 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 03:50:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2024-10-11 03:50:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 399. [2024-10-11 03:50:26,073 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-11 03:50:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 492 transitions. [2024-10-11 03:50:26,074 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 492 transitions. Word has length 80 [2024-10-11 03:50:26,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:26,074 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 492 transitions. [2024-10-11 03:50:26,074 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-11 03:50:26,074 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 492 transitions. [2024-10-11 03:50:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 03:50:26,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:26,075 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-11 03:50:26,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-11 03:50:26,075 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-11 03:50:26,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:26,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1080890953, now seen corresponding path program 1 times [2024-10-11 03:50:26,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:26,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755538613] [2024-10-11 03:50:26,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:26,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:26,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:26,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755538613] [2024-10-11 03:50:26,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755538613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:26,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:26,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:50:26,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243836030] [2024-10-11 03:50:26,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:26,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:50:26,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:26,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:50:26,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:50:26,419 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-11 03:50:26,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:26,781 INFO L93 Difference]: Finished difference Result 600 states and 769 transitions. [2024-10-11 03:50:26,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:50:26,781 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-11 03:50:26,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:26,782 INFO L225 Difference]: With dead ends: 600 [2024-10-11 03:50:26,782 INFO L226 Difference]: Without dead ends: 473 [2024-10-11 03:50:26,783 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-11 03:50:26,783 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:26,783 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.1s Time] [2024-10-11 03:50:26,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-10-11 03:50:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 336. [2024-10-11 03:50:26,786 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-11 03:50:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 417 transitions. [2024-10-11 03:50:26,786 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 417 transitions. Word has length 80 [2024-10-11 03:50:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:26,786 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 417 transitions. [2024-10-11 03:50:26,787 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-11 03:50:26,787 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 417 transitions. [2024-10-11 03:50:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 03:50:26,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:26,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, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:26,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-11 03:50:26,787 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-11 03:50:26,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:26,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1272157338, now seen corresponding path program 1 times [2024-10-11 03:50:26,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:26,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430247176] [2024-10-11 03:50:26,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:26,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:27,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:27,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430247176] [2024-10-11 03:50:27,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430247176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:27,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:27,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:50:27,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434332468] [2024-10-11 03:50:27,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:27,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:50:27,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:27,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:50:27,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:50:27,088 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-11 03:50:27,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:27,486 INFO L93 Difference]: Finished difference Result 723 states and 937 transitions. [2024-10-11 03:50:27,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:50:27,486 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-11 03:50:27,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:27,488 INFO L225 Difference]: With dead ends: 723 [2024-10-11 03:50:27,488 INFO L226 Difference]: Without dead ends: 542 [2024-10-11 03:50:27,489 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-11 03:50:27,489 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-11 03:50:27,489 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-11 03:50:27,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-10-11 03:50:27,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 219. [2024-10-11 03:50:27,493 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-11 03:50:27,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 270 transitions. [2024-10-11 03:50:27,494 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 270 transitions. Word has length 80 [2024-10-11 03:50:27,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:27,494 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 270 transitions. [2024-10-11 03:50:27,495 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-11 03:50:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 270 transitions. [2024-10-11 03:50:27,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 03:50:27,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:27,495 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-11 03:50:27,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-11 03:50:27,495 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-11 03:50:27,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:27,496 INFO L85 PathProgramCache]: Analyzing trace with hash 659418620, now seen corresponding path program 1 times [2024-10-11 03:50:27,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:27,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147155982] [2024-10-11 03:50:27,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:27,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:27,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:27,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147155982] [2024-10-11 03:50:27,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147155982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:27,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:27,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:50:27,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194085021] [2024-10-11 03:50:27,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:27,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:50:27,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:27,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:50:27,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:50:27,786 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-11 03:50:28,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:28,293 INFO L93 Difference]: Finished difference Result 606 states and 821 transitions. [2024-10-11 03:50:28,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:50:28,294 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-11 03:50:28,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:28,295 INFO L225 Difference]: With dead ends: 606 [2024-10-11 03:50:28,295 INFO L226 Difference]: Without dead ends: 524 [2024-10-11 03:50:28,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:50:28,296 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:28,296 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.3s Time] [2024-10-11 03:50:28,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-10-11 03:50:28,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 223. [2024-10-11 03:50:28,298 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-11 03:50:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 274 transitions. [2024-10-11 03:50:28,299 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 274 transitions. Word has length 81 [2024-10-11 03:50:28,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:28,299 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 274 transitions. [2024-10-11 03:50:28,299 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-11 03:50:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 274 transitions. [2024-10-11 03:50:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 03:50:28,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:28,300 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-11 03:50:28,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-11 03:50:28,300 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-11 03:50:28,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:28,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1571841251, now seen corresponding path program 1 times [2024-10-11 03:50:28,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:28,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780019005] [2024-10-11 03:50:28,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:28,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:28,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:28,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780019005] [2024-10-11 03:50:28,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780019005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:28,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:28,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:28,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101292439] [2024-10-11 03:50:28,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:28,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:28,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:28,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:28,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:28,487 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-11 03:50:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:28,816 INFO L93 Difference]: Finished difference Result 329 states and 413 transitions. [2024-10-11 03:50:28,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:50:28,816 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-11 03:50:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:28,817 INFO L225 Difference]: With dead ends: 329 [2024-10-11 03:50:28,817 INFO L226 Difference]: Without dead ends: 322 [2024-10-11 03:50:28,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:50:28,817 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:28,818 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.2s Time] [2024-10-11 03:50:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-11 03:50:28,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 223. [2024-10-11 03:50:28,820 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-11 03:50:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 273 transitions. [2024-10-11 03:50:28,820 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 273 transitions. Word has length 81 [2024-10-11 03:50:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:28,820 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 273 transitions. [2024-10-11 03:50:28,821 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-11 03:50:28,821 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 273 transitions. [2024-10-11 03:50:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 03:50:28,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:28,821 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-11 03:50:28,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-11 03:50:28,821 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-11 03:50:28,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:28,822 INFO L85 PathProgramCache]: Analyzing trace with hash 110288228, now seen corresponding path program 1 times [2024-10-11 03:50:28,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:28,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328249567] [2024-10-11 03:50:28,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:28,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:28,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:28,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328249567] [2024-10-11 03:50:28,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328249567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:28,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:28,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:28,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440539650] [2024-10-11 03:50:28,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:28,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:28,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:28,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:28,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:28,983 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-11 03:50:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:29,297 INFO L93 Difference]: Finished difference Result 329 states and 412 transitions. [2024-10-11 03:50:29,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:50:29,297 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-11 03:50:29,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:29,298 INFO L225 Difference]: With dead ends: 329 [2024-10-11 03:50:29,298 INFO L226 Difference]: Without dead ends: 322 [2024-10-11 03:50:29,298 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-11 03:50:29,298 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:29,299 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.2s Time] [2024-10-11 03:50:29,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-11 03:50:29,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 223. [2024-10-11 03:50:29,303 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-11 03:50:29,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2024-10-11 03:50:29,303 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 81 [2024-10-11 03:50:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:29,303 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2024-10-11 03:50:29,303 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-11 03:50:29,304 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2024-10-11 03:50:29,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 03:50:29,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:29,304 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-11 03:50:29,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-11 03:50:29,304 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-11 03:50:29,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:29,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1072844505, now seen corresponding path program 1 times [2024-10-11 03:50:29,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:29,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431528765] [2024-10-11 03:50:29,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:29,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:29,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:29,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431528765] [2024-10-11 03:50:29,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431528765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:29,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:29,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 03:50:29,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355062116] [2024-10-11 03:50:29,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:29,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 03:50:29,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:29,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 03:50:29,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:50:29,915 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-11 03:50:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:31,025 INFO L93 Difference]: Finished difference Result 487 states and 635 transitions. [2024-10-11 03:50:31,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:50:31,026 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-11 03:50:31,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:31,027 INFO L225 Difference]: With dead ends: 487 [2024-10-11 03:50:31,027 INFO L226 Difference]: Without dead ends: 411 [2024-10-11 03:50:31,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2024-10-11 03:50:31,028 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:31,028 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.4s Time] [2024-10-11 03:50:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-10-11 03:50:31,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 217. [2024-10-11 03:50:31,030 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-11 03:50:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 263 transitions. [2024-10-11 03:50:31,030 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 263 transitions. Word has length 81 [2024-10-11 03:50:31,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:31,031 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 263 transitions. [2024-10-11 03:50:31,031 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-11 03:50:31,031 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 263 transitions. [2024-10-11 03:50:31,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 03:50:31,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:31,031 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-11 03:50:31,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-11 03:50:31,031 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-11 03:50:31,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:31,032 INFO L85 PathProgramCache]: Analyzing trace with hash -220542743, now seen corresponding path program 1 times [2024-10-11 03:50:31,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:31,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635226766] [2024-10-11 03:50:31,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:31,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:32,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:32,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635226766] [2024-10-11 03:50:32,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635226766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:32,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:32,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-10-11 03:50:32,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063131268] [2024-10-11 03:50:32,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:32,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 03:50:32,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:32,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 03:50:32,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2024-10-11 03:50:32,195 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-11 03:50:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:34,191 INFO L93 Difference]: Finished difference Result 917 states and 1203 transitions. [2024-10-11 03:50:34,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 03:50:34,191 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-11 03:50:34,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:34,193 INFO L225 Difference]: With dead ends: 917 [2024-10-11 03:50:34,193 INFO L226 Difference]: Without dead ends: 844 [2024-10-11 03:50:34,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=282, Invalid=1610, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 03:50:34,193 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 2396 mSDsluCounter, 7308 mSDsCounter, 0 mSdLazyCounter, 2881 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:34,194 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.2s Time] [2024-10-11 03:50:34,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-10-11 03:50:34,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 218. [2024-10-11 03:50:34,196 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-11 03:50:34,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 264 transitions. [2024-10-11 03:50:34,197 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 264 transitions. Word has length 81 [2024-10-11 03:50:34,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:34,197 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 264 transitions. [2024-10-11 03:50:34,197 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-11 03:50:34,197 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 264 transitions. [2024-10-11 03:50:34,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 03:50:34,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:34,198 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-11 03:50:34,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-11 03:50:34,198 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-11 03:50:34,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:34,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2120242635, now seen corresponding path program 1 times [2024-10-11 03:50:34,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:34,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355162833] [2024-10-11 03:50:34,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:34,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:34,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-11 03:50:34,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:34,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355162833] [2024-10-11 03:50:34,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355162833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:34,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:34,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:50:34,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196352143] [2024-10-11 03:50:34,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:34,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:50:34,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:34,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:50:34,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:50:34,574 INFO L87 Difference]: Start difference. First operand 218 states and 264 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 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-11 03:50:35,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:35,143 INFO L93 Difference]: Finished difference Result 593 states and 780 transitions. [2024-10-11 03:50:35,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:50:35,144 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 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-11 03:50:35,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:35,145 INFO L225 Difference]: With dead ends: 593 [2024-10-11 03:50:35,145 INFO L226 Difference]: Without dead ends: 498 [2024-10-11 03:50:35,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:50:35,146 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 1170 mSDsluCounter, 2861 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 3205 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:35,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 3205 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:50:35,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-10-11 03:50:35,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 175. [2024-10-11 03:50:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 172 states have (on average 1.244186046511628) internal successors, (214), 174 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 214 transitions. [2024-10-11 03:50:35,149 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 214 transitions. Word has length 81 [2024-10-11 03:50:35,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:35,149 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 214 transitions. [2024-10-11 03:50:35,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 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-11 03:50:35,149 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 214 transitions. [2024-10-11 03:50:35,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 03:50:35,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:35,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:35,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-11 03:50:35,149 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:35,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:35,150 INFO L85 PathProgramCache]: Analyzing trace with hash -589436179, now seen corresponding path program 1 times [2024-10-11 03:50:35,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:35,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872982749] [2024-10-11 03:50:35,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:35,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:35,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:35,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:35,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872982749] [2024-10-11 03:50:35,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872982749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:35,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:35,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:35,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655293855] [2024-10-11 03:50:35,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:35,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:35,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:35,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:35,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:35,342 INFO L87 Difference]: Start difference. First operand 175 states and 214 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:35,648 INFO L93 Difference]: Finished difference Result 356 states and 463 transitions. [2024-10-11 03:50:35,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:50:35,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-11 03:50:35,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:35,649 INFO L225 Difference]: With dead ends: 356 [2024-10-11 03:50:35,649 INFO L226 Difference]: Without dead ends: 274 [2024-10-11 03:50:35,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:50:35,650 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 628 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:35,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 1064 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:50:35,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-11 03:50:35,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 171. [2024-10-11 03:50:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 168 states have (on average 1.244047619047619) internal successors, (209), 170 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 209 transitions. [2024-10-11 03:50:35,652 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 209 transitions. Word has length 82 [2024-10-11 03:50:35,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:35,652 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 209 transitions. [2024-10-11 03:50:35,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:35,652 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 209 transitions. [2024-10-11 03:50:35,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 03:50:35,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:35,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:35,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-11 03:50:35,653 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:35,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:35,653 INFO L85 PathProgramCache]: Analyzing trace with hash -571562505, now seen corresponding path program 1 times [2024-10-11 03:50:35,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:35,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44772933] [2024-10-11 03:50:35,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:35,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:35,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:35,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44772933] [2024-10-11 03:50:35,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44772933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:35,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:35,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:50:35,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585773286] [2024-10-11 03:50:35,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:35,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:50:35,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:35,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:50:35,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:50:35,974 INFO L87 Difference]: Start difference. First operand 171 states and 209 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:36,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:36,322 INFO L93 Difference]: Finished difference Result 248 states and 320 transitions. [2024-10-11 03:50:36,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:50:36,323 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-10-11 03:50:36,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:36,323 INFO L225 Difference]: With dead ends: 248 [2024-10-11 03:50:36,323 INFO L226 Difference]: Without dead ends: 242 [2024-10-11 03:50:36,324 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-11 03:50:36,324 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 885 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:36,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 1438 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:50:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-11 03:50:36,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 165. [2024-10-11 03:50:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 163 states have (on average 1.2453987730061349) internal successors, (203), 164 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:36,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 203 transitions. [2024-10-11 03:50:36,326 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 203 transitions. Word has length 83 [2024-10-11 03:50:36,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:36,326 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 203 transitions. [2024-10-11 03:50:36,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 203 transitions. [2024-10-11 03:50:36,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 03:50:36,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:36,327 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:36,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-11 03:50:36,327 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:36,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:36,327 INFO L85 PathProgramCache]: Analyzing trace with hash 762395294, now seen corresponding path program 1 times [2024-10-11 03:50:36,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:36,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834551938] [2024-10-11 03:50:36,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:36,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:37,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:37,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834551938] [2024-10-11 03:50:37,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834551938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:37,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:37,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2024-10-11 03:50:37,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841120388] [2024-10-11 03:50:37,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:37,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 03:50:37,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:37,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 03:50:37,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2024-10-11 03:50:37,349 INFO L87 Difference]: Start difference. First operand 165 states and 203 transitions. Second operand has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:39,893 INFO L93 Difference]: Finished difference Result 648 states and 860 transitions. [2024-10-11 03:50:39,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 03:50:39,894 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-10-11 03:50:39,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:39,895 INFO L225 Difference]: With dead ends: 648 [2024-10-11 03:50:39,895 INFO L226 Difference]: Without dead ends: 640 [2024-10-11 03:50:39,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=318, Invalid=2034, Unknown=0, NotChecked=0, Total=2352 [2024-10-11 03:50:39,896 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 1873 mSDsluCounter, 8159 mSDsCounter, 0 mSdLazyCounter, 4433 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 8742 SdHoareTripleChecker+Invalid, 4433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:39,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 8742 Invalid, 4433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4433 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 03:50:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-10-11 03:50:39,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 184. [2024-10-11 03:50:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 182 states have (on average 1.2417582417582418) internal successors, (226), 183 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 226 transitions. [2024-10-11 03:50:39,898 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 226 transitions. Word has length 83 [2024-10-11 03:50:39,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:39,898 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 226 transitions. [2024-10-11 03:50:39,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:39,899 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 226 transitions. [2024-10-11 03:50:39,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 03:50:39,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:39,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:39,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-11 03:50:39,899 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:39,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:39,899 INFO L85 PathProgramCache]: Analyzing trace with hash -906874595, now seen corresponding path program 1 times [2024-10-11 03:50:39,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:39,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303793717] [2024-10-11 03:50:39,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:39,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:40,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:40,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303793717] [2024-10-11 03:50:40,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303793717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:40,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:40,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:50:40,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838711876] [2024-10-11 03:50:40,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:40,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:50:40,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:40,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:50:40,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:50:40,224 INFO L87 Difference]: Start difference. First operand 184 states and 226 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:40,521 INFO L93 Difference]: Finished difference Result 267 states and 344 transitions. [2024-10-11 03:50:40,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:50:40,521 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-10-11 03:50:40,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:40,521 INFO L225 Difference]: With dead ends: 267 [2024-10-11 03:50:40,521 INFO L226 Difference]: Without dead ends: 252 [2024-10-11 03:50:40,522 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-11 03:50:40,522 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 835 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:40,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1465 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:50:40,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-11 03:50:40,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 153. [2024-10-11 03:50:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.25) internal successors, (190), 152 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 190 transitions. [2024-10-11 03:50:40,524 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 190 transitions. Word has length 84 [2024-10-11 03:50:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:40,524 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 190 transitions. [2024-10-11 03:50:40,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 190 transitions. [2024-10-11 03:50:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:50:40,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:40,525 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:40,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-10-11 03:50:40,525 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:40,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:40,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1671719509, now seen corresponding path program 1 times [2024-10-11 03:50:40,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:40,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922857179] [2024-10-11 03:50:40,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:40,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:40,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:40,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922857179] [2024-10-11 03:50:40,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922857179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:40,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:40,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:40,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769754822] [2024-10-11 03:50:40,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:40,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:50:40,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:40,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:50:40,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:50:40,613 INFO L87 Difference]: Start difference. First operand 153 states and 190 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:40,706 INFO L93 Difference]: Finished difference Result 793 states and 1140 transitions. [2024-10-11 03:50:40,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:50:40,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-10-11 03:50:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:40,708 INFO L225 Difference]: With dead ends: 793 [2024-10-11 03:50:40,708 INFO L226 Difference]: Without dead ends: 729 [2024-10-11 03:50:40,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:50:40,708 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 1784 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1784 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:40,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1784 Valid, 1140 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:40,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-10-11 03:50:40,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 215. [2024-10-11 03:50:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.3177570093457944) internal successors, (282), 214 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 282 transitions. [2024-10-11 03:50:40,711 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 282 transitions. Word has length 110 [2024-10-11 03:50:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:40,712 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 282 transitions. [2024-10-11 03:50:40,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 282 transitions. [2024-10-11 03:50:40,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:50:40,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:40,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:40,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-10-11 03:50:40,713 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:40,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:40,713 INFO L85 PathProgramCache]: Analyzing trace with hash 238276620, now seen corresponding path program 1 times [2024-10-11 03:50:40,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:40,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710007330] [2024-10-11 03:50:40,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:40,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:40,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:40,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:40,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710007330] [2024-10-11 03:50:40,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710007330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:40,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:40,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:40,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030386813] [2024-10-11 03:50:40,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:40,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:50:40,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:40,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:50:40,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:50:40,824 INFO L87 Difference]: Start difference. First operand 215 states and 282 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:40,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:40,894 INFO L93 Difference]: Finished difference Result 909 states and 1310 transitions. [2024-10-11 03:50:40,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:50:40,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-11 03:50:40,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:40,895 INFO L225 Difference]: With dead ends: 909 [2024-10-11 03:50:40,896 INFO L226 Difference]: Without dead ends: 783 [2024-10-11 03:50:40,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:50:40,896 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 1195 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:40,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 882 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:40,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-10-11 03:50:40,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 339. [2024-10-11 03:50:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.3816568047337279) internal successors, (467), 338 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:40,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 467 transitions. [2024-10-11 03:50:40,901 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 467 transitions. Word has length 112 [2024-10-11 03:50:40,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:40,902 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 467 transitions. [2024-10-11 03:50:40,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 467 transitions. [2024-10-11 03:50:40,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:50:40,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:40,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:40,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-11 03:50:40,903 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:40,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:40,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2013488005, now seen corresponding path program 1 times [2024-10-11 03:50:40,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:40,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435577892] [2024-10-11 03:50:40,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:40,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:40,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:40,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435577892] [2024-10-11 03:50:40,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435577892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:40,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:40,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:50:40,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127230297] [2024-10-11 03:50:40,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:40,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:50:40,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:40,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:50:40,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:40,964 INFO L87 Difference]: Start difference. First operand 339 states and 467 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:40,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:40,988 INFO L93 Difference]: Finished difference Result 813 states and 1165 transitions. [2024-10-11 03:50:40,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:50:40,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-11 03:50:40,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:40,989 INFO L225 Difference]: With dead ends: 813 [2024-10-11 03:50:40,990 INFO L226 Difference]: Without dead ends: 563 [2024-10-11 03:50:40,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:40,990 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 110 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:40,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 303 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:40,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-10-11 03:50:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 557. [2024-10-11 03:50:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 556 states have (on average 1.3992805755395683) internal successors, (778), 556 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 778 transitions. [2024-10-11 03:50:40,995 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 778 transitions. Word has length 112 [2024-10-11 03:50:40,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:40,996 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 778 transitions. [2024-10-11 03:50:40,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 778 transitions. [2024-10-11 03:50:40,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:50:40,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:40,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:40,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-10-11 03:50:40,997 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:40,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:40,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2079981517, now seen corresponding path program 1 times [2024-10-11 03:50:40,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:40,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241087733] [2024-10-11 03:50:40,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:40,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:41,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:41,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241087733] [2024-10-11 03:50:41,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241087733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:41,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:41,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:41,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8895017] [2024-10-11 03:50:41,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:41,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:50:41,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:41,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:50:41,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:50:41,169 INFO L87 Difference]: Start difference. First operand 557 states and 778 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:41,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:41,260 INFO L93 Difference]: Finished difference Result 1027 states and 1462 transitions. [2024-10-11 03:50:41,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:50:41,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-11 03:50:41,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:41,261 INFO L225 Difference]: With dead ends: 1027 [2024-10-11 03:50:41,261 INFO L226 Difference]: Without dead ends: 559 [2024-10-11 03:50:41,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:50:41,262 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 99 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:41,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 644 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:41,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-11 03:50:41,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 557. [2024-10-11 03:50:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 556 states have (on average 1.39568345323741) internal successors, (776), 556 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:41,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 776 transitions. [2024-10-11 03:50:41,267 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 776 transitions. Word has length 112 [2024-10-11 03:50:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:41,268 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 776 transitions. [2024-10-11 03:50:41,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:41,268 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 776 transitions. [2024-10-11 03:50:41,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:50:41,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:41,268 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:41,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-10-11 03:50:41,269 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:41,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:41,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2113425932, now seen corresponding path program 1 times [2024-10-11 03:50:41,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:41,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362247179] [2024-10-11 03:50:41,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:41,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:41,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:41,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362247179] [2024-10-11 03:50:41,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362247179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:41,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:41,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:41,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437800841] [2024-10-11 03:50:41,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:41,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:50:41,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:41,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:50:41,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:50:41,380 INFO L87 Difference]: Start difference. First operand 557 states and 776 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:41,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:41,455 INFO L93 Difference]: Finished difference Result 1851 states and 2656 transitions. [2024-10-11 03:50:41,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:50:41,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-11 03:50:41,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:41,457 INFO L225 Difference]: With dead ends: 1851 [2024-10-11 03:50:41,457 INFO L226 Difference]: Without dead ends: 1616 [2024-10-11 03:50:41,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:50:41,458 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 1055 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:41,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 953 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2024-10-11 03:50:41,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 907. [2024-10-11 03:50:41,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 1.4172185430463575) internal successors, (1284), 906 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1284 transitions. [2024-10-11 03:50:41,468 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1284 transitions. Word has length 112 [2024-10-11 03:50:41,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:41,468 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1284 transitions. [2024-10-11 03:50:41,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1284 transitions. [2024-10-11 03:50:41,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:50:41,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:41,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:41,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-10-11 03:50:41,469 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:41,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:41,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1817455604, now seen corresponding path program 1 times [2024-10-11 03:50:41,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:41,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771654243] [2024-10-11 03:50:41,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:41,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:41,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:41,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:41,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771654243] [2024-10-11 03:50:41,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771654243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:41,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:41,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:41,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753338690] [2024-10-11 03:50:41,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:41,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:50:41,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:41,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:50:41,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:50:41,568 INFO L87 Difference]: Start difference. First operand 907 states and 1284 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:41,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:41,648 INFO L93 Difference]: Finished difference Result 2084 states and 2995 transitions. [2024-10-11 03:50:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:50:41,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-11 03:50:41,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:41,650 INFO L225 Difference]: With dead ends: 2084 [2024-10-11 03:50:41,650 INFO L226 Difference]: Without dead ends: 1849 [2024-10-11 03:50:41,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:50:41,651 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 1067 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:41,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1067 Valid, 1014 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2024-10-11 03:50:41,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1140. [2024-10-11 03:50:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 1.4249341527655839) internal successors, (1623), 1139 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:41,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1623 transitions. [2024-10-11 03:50:41,664 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1623 transitions. Word has length 112 [2024-10-11 03:50:41,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:41,664 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1623 transitions. [2024-10-11 03:50:41,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:41,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1623 transitions. [2024-10-11 03:50:41,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:50:41,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:41,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:41,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-10-11 03:50:41,666 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:41,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:41,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1076996596, now seen corresponding path program 1 times [2024-10-11 03:50:41,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:41,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332395879] [2024-10-11 03:50:41,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:41,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:41,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:41,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:41,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332395879] [2024-10-11 03:50:41,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332395879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:41,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:41,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:41,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931993466] [2024-10-11 03:50:41,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:41,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:50:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:41,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:50:41,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:50:41,771 INFO L87 Difference]: Start difference. First operand 1140 states and 1623 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:41,868 INFO L93 Difference]: Finished difference Result 2317 states and 3334 transitions. [2024-10-11 03:50:41,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:50:41,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-11 03:50:41,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:41,872 INFO L225 Difference]: With dead ends: 2317 [2024-10-11 03:50:41,873 INFO L226 Difference]: Without dead ends: 2082 [2024-10-11 03:50:41,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:50:41,874 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 1171 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:41,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 1017 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:50:41,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2024-10-11 03:50:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1373. [2024-10-11 03:50:41,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1372 states have (on average 1.4300291545189505) internal successors, (1962), 1372 states have internal predecessors, (1962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1962 transitions. [2024-10-11 03:50:41,888 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1962 transitions. Word has length 112 [2024-10-11 03:50:41,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:41,888 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 1962 transitions. [2024-10-11 03:50:41,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:41,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1962 transitions. [2024-10-11 03:50:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 03:50:41,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:41,889 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:41,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-10-11 03:50:41,889 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:41,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:41,891 INFO L85 PathProgramCache]: Analyzing trace with hash -393257428, now seen corresponding path program 1 times [2024-10-11 03:50:41,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:41,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421593398] [2024-10-11 03:50:41,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:41,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:41,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:41,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421593398] [2024-10-11 03:50:41,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421593398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:41,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:41,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:50:41,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590300805] [2024-10-11 03:50:41,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:41,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:50:41,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:41,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:50:41,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:41,972 INFO L87 Difference]: Start difference. First operand 1373 states and 1962 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:41,989 INFO L93 Difference]: Finished difference Result 3853 states and 5542 transitions. [2024-10-11 03:50:41,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:50:41,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-11 03:50:41,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:41,992 INFO L225 Difference]: With dead ends: 3853 [2024-10-11 03:50:41,992 INFO L226 Difference]: Without dead ends: 2569 [2024-10-11 03:50:41,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:41,994 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 89 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:41,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 403 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:41,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2024-10-11 03:50:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2479. [2024-10-11 03:50:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2479 states, 2478 states have (on average 1.4293785310734464) internal successors, (3542), 2478 states have internal predecessors, (3542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3542 transitions. [2024-10-11 03:50:42,016 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3542 transitions. Word has length 113 [2024-10-11 03:50:42,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:42,016 INFO L471 AbstractCegarLoop]: Abstraction has 2479 states and 3542 transitions. [2024-10-11 03:50:42,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:42,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3542 transitions. [2024-10-11 03:50:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 03:50:42,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:42,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:42,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-10-11 03:50:42,018 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:42,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:42,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1915285261, now seen corresponding path program 1 times [2024-10-11 03:50:42,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:42,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592430003] [2024-10-11 03:50:42,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:42,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:42,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:42,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:42,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592430003] [2024-10-11 03:50:42,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592430003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:42,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:42,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:50:42,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923258388] [2024-10-11 03:50:42,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:42,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:50:42,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:42,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:50:42,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:42,104 INFO L87 Difference]: Start difference. First operand 2479 states and 3542 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:42,125 INFO L93 Difference]: Finished difference Result 7083 states and 10128 transitions. [2024-10-11 03:50:42,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:50:42,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-10-11 03:50:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:42,132 INFO L225 Difference]: With dead ends: 7083 [2024-10-11 03:50:42,132 INFO L226 Difference]: Without dead ends: 4693 [2024-10-11 03:50:42,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:42,136 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 82 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:42,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 403 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:42,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4693 states. [2024-10-11 03:50:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4693 to 4515. [2024-10-11 03:50:42,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4515 states, 4514 states have (on average 1.4213557820115197) internal successors, (6416), 4514 states have internal predecessors, (6416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 6416 transitions. [2024-10-11 03:50:42,178 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 6416 transitions. Word has length 114 [2024-10-11 03:50:42,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:42,178 INFO L471 AbstractCegarLoop]: Abstraction has 4515 states and 6416 transitions. [2024-10-11 03:50:42,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 6416 transitions. [2024-10-11 03:50:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 03:50:42,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:42,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:42,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-10-11 03:50:42,179 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:42,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:42,180 INFO L85 PathProgramCache]: Analyzing trace with hash 16834680, now seen corresponding path program 1 times [2024-10-11 03:50:42,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:42,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314853800] [2024-10-11 03:50:42,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:42,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:42,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:42,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:42,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314853800] [2024-10-11 03:50:42,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314853800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:42,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:42,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:50:42,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762430130] [2024-10-11 03:50:42,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:42,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:50:42,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:42,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:50:42,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:42,276 INFO L87 Difference]: Start difference. First operand 4515 states and 6416 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:42,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:42,311 INFO L93 Difference]: Finished difference Result 13015 states and 18442 transitions. [2024-10-11 03:50:42,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:50:42,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-11 03:50:42,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:42,322 INFO L225 Difference]: With dead ends: 13015 [2024-10-11 03:50:42,322 INFO L226 Difference]: Without dead ends: 8589 [2024-10-11 03:50:42,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:42,328 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 75 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:42,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 403 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:42,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8589 states. [2024-10-11 03:50:42,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8589 to 8235. [2024-10-11 03:50:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8235 states, 8234 states have (on average 1.4078212290502794) internal successors, (11592), 8234 states have internal predecessors, (11592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8235 states to 8235 states and 11592 transitions. [2024-10-11 03:50:42,408 INFO L78 Accepts]: Start accepts. Automaton has 8235 states and 11592 transitions. Word has length 115 [2024-10-11 03:50:42,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:42,408 INFO L471 AbstractCegarLoop]: Abstraction has 8235 states and 11592 transitions. [2024-10-11 03:50:42,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:42,408 INFO L276 IsEmpty]: Start isEmpty. Operand 8235 states and 11592 transitions. [2024-10-11 03:50:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 03:50:42,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:42,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:42,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-10-11 03:50:42,409 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:42,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:42,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1053800601, now seen corresponding path program 1 times [2024-10-11 03:50:42,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:42,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108119085] [2024-10-11 03:50:42,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:42,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:42,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:42,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108119085] [2024-10-11 03:50:42,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108119085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:42,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:42,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:50:42,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012209869] [2024-10-11 03:50:42,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:42,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:50:42,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:42,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:50:42,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:42,497 INFO L87 Difference]: Start difference. First operand 8235 states and 11592 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:42,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:42,547 INFO L93 Difference]: Finished difference Result 23823 states and 33354 transitions. [2024-10-11 03:50:42,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:50:42,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-10-11 03:50:42,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:42,566 INFO L225 Difference]: With dead ends: 23823 [2024-10-11 03:50:42,566 INFO L226 Difference]: Without dead ends: 15677 [2024-10-11 03:50:42,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:42,576 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 65 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:42,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 403 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15677 states. [2024-10-11 03:50:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15677 to 14971. [2024-10-11 03:50:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14971 states, 14970 states have (on average 1.389445557782231) internal successors, (20800), 14970 states have internal predecessors, (20800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14971 states to 14971 states and 20800 transitions. [2024-10-11 03:50:42,727 INFO L78 Accepts]: Start accepts. Automaton has 14971 states and 20800 transitions. Word has length 116 [2024-10-11 03:50:42,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:42,728 INFO L471 AbstractCegarLoop]: Abstraction has 14971 states and 20800 transitions. [2024-10-11 03:50:42,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 14971 states and 20800 transitions. [2024-10-11 03:50:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 03:50:42,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:42,728 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:42,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-10-11 03:50:42,729 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:42,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:42,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1617381692, now seen corresponding path program 1 times [2024-10-11 03:50:42,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:42,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441247005] [2024-10-11 03:50:42,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:42,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:42,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:42,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441247005] [2024-10-11 03:50:42,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441247005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:42,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:42,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:50:42,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612290300] [2024-10-11 03:50:42,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:42,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:50:42,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:42,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:50:42,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:50:42,978 INFO L87 Difference]: Start difference. First operand 14971 states and 20800 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:43,029 INFO L93 Difference]: Finished difference Result 15453 states and 21441 transitions. [2024-10-11 03:50:43,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:50:43,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-10-11 03:50:43,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:43,052 INFO L225 Difference]: With dead ends: 15453 [2024-10-11 03:50:43,052 INFO L226 Difference]: Without dead ends: 15451 [2024-10-11 03:50:43,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:50:43,059 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:43,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 917 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:43,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15451 states. [2024-10-11 03:50:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15451 to 15451. [2024-10-11 03:50:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15451 states, 15450 states have (on average 1.3711326860841424) internal successors, (21184), 15450 states have internal predecessors, (21184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15451 states to 15451 states and 21184 transitions. [2024-10-11 03:50:43,234 INFO L78 Accepts]: Start accepts. Automaton has 15451 states and 21184 transitions. Word has length 117 [2024-10-11 03:50:43,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:43,235 INFO L471 AbstractCegarLoop]: Abstraction has 15451 states and 21184 transitions. [2024-10-11 03:50:43,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:43,235 INFO L276 IsEmpty]: Start isEmpty. Operand 15451 states and 21184 transitions. [2024-10-11 03:50:43,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 03:50:43,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:43,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:43,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-10-11 03:50:43,236 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:43,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:43,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2070251932, now seen corresponding path program 1 times [2024-10-11 03:50:43,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:43,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817536233] [2024-10-11 03:50:43,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:43,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:43,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:43,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:43,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817536233] [2024-10-11 03:50:43,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817536233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:43,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:43,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:43,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757576614] [2024-10-11 03:50:43,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:43,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:50:43,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:43,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:50:43,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:50:43,354 INFO L87 Difference]: Start difference. First operand 15451 states and 21184 transitions. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:43,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:43,494 INFO L93 Difference]: Finished difference Result 29463 states and 40550 transitions. [2024-10-11 03:50:43,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:50:43,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-10-11 03:50:43,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:43,535 INFO L225 Difference]: With dead ends: 29463 [2024-10-11 03:50:43,535 INFO L226 Difference]: Without dead ends: 26661 [2024-10-11 03:50:43,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:50:43,547 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 1174 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:43,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 896 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:50:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26661 states. [2024-10-11 03:50:43,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26661 to 18251. [2024-10-11 03:50:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18251 states, 18250 states have (on average 1.3711780821917807) internal successors, (25024), 18250 states have internal predecessors, (25024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18251 states to 18251 states and 25024 transitions. [2024-10-11 03:50:43,896 INFO L78 Accepts]: Start accepts. Automaton has 18251 states and 25024 transitions. Word has length 117 [2024-10-11 03:50:43,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:43,896 INFO L471 AbstractCegarLoop]: Abstraction has 18251 states and 25024 transitions. [2024-10-11 03:50:43,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 18251 states and 25024 transitions. [2024-10-11 03:50:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 03:50:43,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:43,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:43,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-10-11 03:50:43,897 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:43,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:43,898 INFO L85 PathProgramCache]: Analyzing trace with hash 500777747, now seen corresponding path program 1 times [2024-10-11 03:50:43,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:43,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153818982] [2024-10-11 03:50:43,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:43,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:43,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:43,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:43,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153818982] [2024-10-11 03:50:43,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153818982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:43,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:43,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:50:43,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752052668] [2024-10-11 03:50:43,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:43,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:50:43,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:43,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:50:43,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:43,978 INFO L87 Difference]: Start difference. First operand 18251 states and 25024 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:44,064 INFO L93 Difference]: Finished difference Result 47295 states and 64674 transitions. [2024-10-11 03:50:44,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:50:44,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2024-10-11 03:50:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:44,099 INFO L225 Difference]: With dead ends: 47295 [2024-10-11 03:50:44,099 INFO L226 Difference]: Without dead ends: 29133 [2024-10-11 03:50:44,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:44,118 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 93 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:44,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 406 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:44,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29133 states. [2024-10-11 03:50:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29133 to 27467. [2024-10-11 03:50:44,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27467 states, 27466 states have (on average 1.3561494211024538) internal successors, (37248), 27466 states have internal predecessors, (37248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:44,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27467 states to 27467 states and 37248 transitions. [2024-10-11 03:50:44,432 INFO L78 Accepts]: Start accepts. Automaton has 27467 states and 37248 transitions. Word has length 118 [2024-10-11 03:50:44,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:44,432 INFO L471 AbstractCegarLoop]: Abstraction has 27467 states and 37248 transitions. [2024-10-11 03:50:44,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:44,432 INFO L276 IsEmpty]: Start isEmpty. Operand 27467 states and 37248 transitions. [2024-10-11 03:50:44,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 03:50:44,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:44,436 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:44,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-10-11 03:50:44,437 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:44,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:44,437 INFO L85 PathProgramCache]: Analyzing trace with hash 531509387, now seen corresponding path program 1 times [2024-10-11 03:50:44,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:44,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382839977] [2024-10-11 03:50:44,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:44,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:44,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:44,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382839977] [2024-10-11 03:50:44,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382839977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:44,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:44,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:50:44,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359153583] [2024-10-11 03:50:44,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:44,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:50:44,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:44,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:50:44,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:44,651 INFO L87 Difference]: Start difference. First operand 27467 states and 37248 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:44,774 INFO L93 Difference]: Finished difference Result 54847 states and 74402 transitions. [2024-10-11 03:50:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:50:44,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2024-10-11 03:50:44,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:44,808 INFO L225 Difference]: With dead ends: 54847 [2024-10-11 03:50:44,808 INFO L226 Difference]: Without dead ends: 27469 [2024-10-11 03:50:44,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:44,840 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 81 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:44,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 377 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:44,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27469 states. [2024-10-11 03:50:45,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27469 to 27467. [2024-10-11 03:50:45,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27467 states, 27466 states have (on average 1.3410034224131653) internal successors, (36832), 27466 states have internal predecessors, (36832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27467 states to 27467 states and 36832 transitions. [2024-10-11 03:50:45,158 INFO L78 Accepts]: Start accepts. Automaton has 27467 states and 36832 transitions. Word has length 148 [2024-10-11 03:50:45,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:45,158 INFO L471 AbstractCegarLoop]: Abstraction has 27467 states and 36832 transitions. [2024-10-11 03:50:45,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:45,159 INFO L276 IsEmpty]: Start isEmpty. Operand 27467 states and 36832 transitions. [2024-10-11 03:50:45,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 03:50:45,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:45,161 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:45,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-10-11 03:50:45,161 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-11 03:50:45,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:45,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1792864446, now seen corresponding path program 1 times [2024-10-11 03:50:45,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:45,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609788506] [2024-10-11 03:50:45,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:45,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:45,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:45,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609788506] [2024-10-11 03:50:45,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609788506] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:50:45,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006740904] [2024-10-11 03:50:45,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:45,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:50:45,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:50:45,478 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:50:45,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:50:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:45,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 03:50:45,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:50:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:46,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:50:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:48,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006740904] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:50:48,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:50:48,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 24 [2024-10-11 03:50:48,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899233360] [2024-10-11 03:50:48,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:50:48,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 03:50:48,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:48,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 03:50:48,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:50:48,024 INFO L87 Difference]: Start difference. First operand 27467 states and 36832 transitions. Second operand has 25 states, 25 states have (on average 15.04) internal successors, (376), 24 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:49,700 INFO L93 Difference]: Finished difference Result 136915 states and 182472 transitions. [2024-10-11 03:50:49,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-11 03:50:49,701 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 15.04) internal successors, (376), 24 states have internal predecessors, (376), 0 states have call successors, (0), 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 148 [2024-10-11 03:50:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:49,825 INFO L225 Difference]: With dead ends: 136915 [2024-10-11 03:50:49,826 INFO L226 Difference]: Without dead ends: 109537 [2024-10-11 03:50:49,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=810, Invalid=2850, Unknown=0, NotChecked=0, Total=3660 [2024-10-11 03:50:49,839 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 2506 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 1825 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2506 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:49,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2506 Valid, 1868 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1825 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:50:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109537 states.