./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.4.ufo.BOUNDED-8.pals.c.v+lhb-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.4.ufo.BOUNDED-8.pals.c.v+lhb-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 38533fb2932c589b42c93c264dc8e5e297bb0dbb9a49080a666466aefcec5174 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:47:06,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:47:06,249 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:47:06,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:47:06,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:47:06,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:47:06,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:47:06,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:47:06,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:47:06,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:47:06,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:47:06,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:47:06,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:47:06,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:47:06,290 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:47:06,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:47:06,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:47:06,291 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:47:06,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:47:06,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:47:06,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:47:06,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:47:06,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:47:06,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:47:06,293 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:47:06,293 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:47:06,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:47:06,294 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:47:06,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:47:06,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:47:06,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:47:06,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:47:06,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:47:06,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:47:06,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:47:06,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:47:06,296 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:47:06,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:47:06,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:47:06,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:47:06,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:47:06,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:47:06,298 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 -> 38533fb2932c589b42c93c264dc8e5e297bb0dbb9a49080a666466aefcec5174 [2024-10-11 03:47:06,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:47:06,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:47:06,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:47:06,581 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:47:06,582 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:47:06,583 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2024-10-11 03:47:07,914 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:47:08,229 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:47:08,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2024-10-11 03:47:08,264 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/710883656/c819d094d3524ae895ed3085de2a650f/FLAG054b31de0 [2024-10-11 03:47:08,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/710883656/c819d094d3524ae895ed3085de2a650f [2024-10-11 03:47:08,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:47:08,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:47:08,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:47:08,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:47:08,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:47:08,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:47:08" (1/1) ... [2024-10-11 03:47:08,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c72213f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:08, skipping insertion in model container [2024-10-11 03:47:08,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:47:08" (1/1) ... [2024-10-11 03:47:08,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:47:08,671 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9419,9432] [2024-10-11 03:47:08,706 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12891,12904] [2024-10-11 03:47:08,713 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14047,14060] [2024-10-11 03:47:08,718 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14703,14716] [2024-10-11 03:47:08,727 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16224,16237] [2024-10-11 03:47:08,731 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16880,16893] [2024-10-11 03:47:08,736 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17864,17877] [2024-10-11 03:47:08,745 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20202,20215] [2024-10-11 03:47:08,749 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20861,20874] [2024-10-11 03:47:08,758 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21885,21898] [2024-10-11 03:47:08,767 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23760,23773] [2024-10-11 03:47:08,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:47:08,877 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:47:08,959 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9419,9432] [2024-10-11 03:47:08,970 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12891,12904] [2024-10-11 03:47:08,975 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14047,14060] [2024-10-11 03:47:08,978 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14703,14716] [2024-10-11 03:47:08,984 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16224,16237] [2024-10-11 03:47:08,987 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16880,16893] [2024-10-11 03:47:08,991 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17864,17877] [2024-10-11 03:47:08,999 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20202,20215] [2024-10-11 03:47:09,002 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20861,20874] [2024-10-11 03:47:09,007 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21885,21898] [2024-10-11 03:47:09,013 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23760,23773] [2024-10-11 03:47:09,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:47:09,083 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:47:09,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:09 WrapperNode [2024-10-11 03:47:09,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:47:09,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:47:09,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:47:09,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:47:09,092 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:47:09" (1/1) ... [2024-10-11 03:47:09,127 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:47:09" (1/1) ... [2024-10-11 03:47:09,207 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2020 [2024-10-11 03:47:09,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:47:09,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:47:09,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:47:09,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:47:09,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:09" (1/1) ... [2024-10-11 03:47:09,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:09" (1/1) ... [2024-10-11 03:47:09,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:09" (1/1) ... [2024-10-11 03:47:09,329 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:47:09,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:09" (1/1) ... [2024-10-11 03:47:09,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:09" (1/1) ... [2024-10-11 03:47:09,377 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:09" (1/1) ... [2024-10-11 03:47:09,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:09" (1/1) ... [2024-10-11 03:47:09,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:09" (1/1) ... [2024-10-11 03:47:09,413 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:09" (1/1) ... [2024-10-11 03:47:09,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:47:09,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:47:09,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:47:09,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:47:09,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:09" (1/1) ... [2024-10-11 03:47:09,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:47:09,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:47:09,462 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:47:09,469 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:47:09,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:47:09,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:47:09,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:47:09,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:47:09,665 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:47:09,667 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:47:10,944 INFO L? ?]: Removed 326 outVars from TransFormulas that were not future-live. [2024-10-11 03:47:10,945 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:47:11,006 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:47:11,010 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:47:11,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:47:11 BoogieIcfgContainer [2024-10-11 03:47:11,011 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:47:11,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:47:11,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:47:11,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:47:11,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:47:08" (1/3) ... [2024-10-11 03:47:11,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427dd2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:47:11, skipping insertion in model container [2024-10-11 03:47:11,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:09" (2/3) ... [2024-10-11 03:47:11,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427dd2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:47:11, skipping insertion in model container [2024-10-11 03:47:11,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:47:11" (3/3) ... [2024-10-11 03:47:11,020 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2024-10-11 03:47:11,037 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:47:11,037 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-10-11 03:47:11,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:47:11,123 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;@7dc0fb1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:47:11,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-11 03:47:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 356 states, 344 states have (on average 1.8430232558139534) internal successors, (634), 355 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:11,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 03:47:11,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:11,148 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] [2024-10-11 03:47:11,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:11,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:11,156 INFO L85 PathProgramCache]: Analyzing trace with hash -972469851, now seen corresponding path program 1 times [2024-10-11 03:47:11,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:11,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863726588] [2024-10-11 03:47:11,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:11,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:11,746 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:47:11,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:11,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863726588] [2024-10-11 03:47:11,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863726588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:11,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:11,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:47:11,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892079289] [2024-10-11 03:47:11,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:11,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:47:11,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:11,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:47:11,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:47:11,783 INFO L87 Difference]: Start difference. First operand has 356 states, 344 states have (on average 1.8430232558139534) internal successors, (634), 355 states have internal predecessors, (634), 0 states have call successors, (0), 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 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:12,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:12,147 INFO L93 Difference]: Finished difference Result 565 states and 969 transitions. [2024-10-11 03:47:12,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:47:12,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-10-11 03:47:12,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:12,164 INFO L225 Difference]: With dead ends: 565 [2024-10-11 03:47:12,165 INFO L226 Difference]: Without dead ends: 302 [2024-10-11 03:47:12,169 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:47:12,174 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 1462 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:12,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 378 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:47:12,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-11 03:47:12,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2024-10-11 03:47:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 291 states have (on average 1.288659793814433) internal successors, (375), 301 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 375 transitions. [2024-10-11 03:47:12,228 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 375 transitions. Word has length 58 [2024-10-11 03:47:12,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:12,229 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 375 transitions. [2024-10-11 03:47:12,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:12,229 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 375 transitions. [2024-10-11 03:47:12,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 03:47:12,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:12,234 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:47:12,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:47:12,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:12,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:12,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2110592992, now seen corresponding path program 1 times [2024-10-11 03:47:12,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:12,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258546714] [2024-10-11 03:47:12,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:12,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:12,418 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:47:12,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:12,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258546714] [2024-10-11 03:47:12,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258546714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:12,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:12,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:47:12,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727057685] [2024-10-11 03:47:12,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:12,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:47:12,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:12,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:47:12,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:47:12,422 INFO L87 Difference]: Start difference. First operand 302 states and 375 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:12,603 INFO L93 Difference]: Finished difference Result 505 states and 644 transitions. [2024-10-11 03:47:12,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:47:12,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-10-11 03:47:12,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:12,605 INFO L225 Difference]: With dead ends: 505 [2024-10-11 03:47:12,605 INFO L226 Difference]: Without dead ends: 267 [2024-10-11 03:47:12,608 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:47:12,611 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 970 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:12,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 203 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:47:12,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-11 03:47:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-10-11 03:47:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 256 states have (on average 1.30859375) internal successors, (335), 266 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 335 transitions. [2024-10-11 03:47:12,630 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 335 transitions. Word has length 59 [2024-10-11 03:47:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:12,630 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 335 transitions. [2024-10-11 03:47:12,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 335 transitions. [2024-10-11 03:47:12,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 03:47:12,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:12,632 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] [2024-10-11 03:47:12,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:47:12,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:12,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:12,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2026571766, now seen corresponding path program 1 times [2024-10-11 03:47:12,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:12,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941684645] [2024-10-11 03:47:12,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:12,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:47:12,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:12,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941684645] [2024-10-11 03:47:12,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941684645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:12,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:12,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:47:12,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343291814] [2024-10-11 03:47:12,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:12,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:47:12,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:12,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:47:12,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:47:12,803 INFO L87 Difference]: Start difference. First operand 267 states and 335 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:13,013 INFO L93 Difference]: Finished difference Result 470 states and 603 transitions. [2024-10-11 03:47:13,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:47:13,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-11 03:47:13,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:13,015 INFO L225 Difference]: With dead ends: 470 [2024-10-11 03:47:13,015 INFO L226 Difference]: Without dead ends: 257 [2024-10-11 03:47:13,016 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:47:13,017 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 892 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:13,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 196 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:47:13,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-10-11 03:47:13,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2024-10-11 03:47:13,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 246 states have (on average 1.3089430894308942) internal successors, (322), 256 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 322 transitions. [2024-10-11 03:47:13,036 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 322 transitions. Word has length 60 [2024-10-11 03:47:13,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:13,037 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 322 transitions. [2024-10-11 03:47:13,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 322 transitions. [2024-10-11 03:47:13,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 03:47:13,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:13,038 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] [2024-10-11 03:47:13,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:47:13,039 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:13,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:13,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2081966607, now seen corresponding path program 1 times [2024-10-11 03:47:13,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:13,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464873448] [2024-10-11 03:47:13,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:13,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:13,218 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:47:13,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:13,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464873448] [2024-10-11 03:47:13,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464873448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:13,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:13,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:47:13,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086917679] [2024-10-11 03:47:13,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:13,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:47:13,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:13,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:47:13,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:47:13,220 INFO L87 Difference]: Start difference. First operand 257 states and 322 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:13,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:13,383 INFO L93 Difference]: Finished difference Result 460 states and 589 transitions. [2024-10-11 03:47:13,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:47:13,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-11 03:47:13,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:13,385 INFO L225 Difference]: With dead ends: 460 [2024-10-11 03:47:13,386 INFO L226 Difference]: Without dead ends: 246 [2024-10-11 03:47:13,386 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:47:13,387 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 880 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:13,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 191 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:47:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-11 03:47:13,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-10-11 03:47:13,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.3148936170212766) internal successors, (309), 245 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 309 transitions. [2024-10-11 03:47:13,393 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 309 transitions. Word has length 61 [2024-10-11 03:47:13,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:13,394 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 309 transitions. [2024-10-11 03:47:13,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 309 transitions. [2024-10-11 03:47:13,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:47:13,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:13,395 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] [2024-10-11 03:47:13,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:47:13,396 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:13,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:13,396 INFO L85 PathProgramCache]: Analyzing trace with hash -617130845, now seen corresponding path program 1 times [2024-10-11 03:47:13,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:13,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091825539] [2024-10-11 03:47:13,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:13,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:13,791 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:47:13,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:13,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091825539] [2024-10-11 03:47:13,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091825539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:13,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:13,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:47:13,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510439870] [2024-10-11 03:47:13,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:13,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:47:13,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:13,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:47:13,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:47:13,798 INFO L87 Difference]: Start difference. First operand 246 states and 309 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:14,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:14,397 INFO L93 Difference]: Finished difference Result 470 states and 607 transitions. [2024-10-11 03:47:14,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:47:14,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-11 03:47:14,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:14,400 INFO L225 Difference]: With dead ends: 470 [2024-10-11 03:47:14,400 INFO L226 Difference]: Without dead ends: 382 [2024-10-11 03:47:14,400 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:47:14,401 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 636 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:14,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 997 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:47:14,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-10-11 03:47:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 246. [2024-10-11 03:47:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.3106382978723403) internal successors, (308), 245 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 308 transitions. [2024-10-11 03:47:14,407 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 308 transitions. Word has length 62 [2024-10-11 03:47:14,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:14,408 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 308 transitions. [2024-10-11 03:47:14,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 308 transitions. [2024-10-11 03:47:14,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:47:14,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:14,410 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] [2024-10-11 03:47:14,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:47:14,411 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:14,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:14,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1025976073, now seen corresponding path program 1 times [2024-10-11 03:47:14,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:14,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427614045] [2024-10-11 03:47:14,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:14,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:14,753 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:47:14,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:14,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427614045] [2024-10-11 03:47:14,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427614045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:14,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:14,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:47:14,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749762141] [2024-10-11 03:47:14,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:14,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:47:14,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:14,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:47:14,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:47:14,760 INFO L87 Difference]: Start difference. First operand 246 states and 308 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:15,334 INFO L93 Difference]: Finished difference Result 444 states and 573 transitions. [2024-10-11 03:47:15,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:47:15,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-11 03:47:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:15,337 INFO L225 Difference]: With dead ends: 444 [2024-10-11 03:47:15,337 INFO L226 Difference]: Without dead ends: 378 [2024-10-11 03:47:15,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:47:15,338 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 936 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:15,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1101 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:47:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-11 03:47:15,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 246. [2024-10-11 03:47:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.3063829787234043) internal successors, (307), 245 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 307 transitions. [2024-10-11 03:47:15,347 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 307 transitions. Word has length 62 [2024-10-11 03:47:15,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:15,347 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 307 transitions. [2024-10-11 03:47:15,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 307 transitions. [2024-10-11 03:47:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:47:15,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:15,349 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] [2024-10-11 03:47:15,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:47:15,350 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:15,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:15,351 INFO L85 PathProgramCache]: Analyzing trace with hash 762232665, now seen corresponding path program 1 times [2024-10-11 03:47:15,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:15,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884007853] [2024-10-11 03:47:15,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:15,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:15,747 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:47:15,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:15,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884007853] [2024-10-11 03:47:15,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884007853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:15,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:15,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:47:15,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891926274] [2024-10-11 03:47:15,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:15,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:47:15,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:15,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:47:15,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:47:15,753 INFO L87 Difference]: Start difference. First operand 246 states and 307 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:16,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:16,283 INFO L93 Difference]: Finished difference Result 474 states and 608 transitions. [2024-10-11 03:47:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:47:16,283 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-11 03:47:16,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:16,285 INFO L225 Difference]: With dead ends: 474 [2024-10-11 03:47:16,285 INFO L226 Difference]: Without dead ends: 380 [2024-10-11 03:47:16,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:47:16,286 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 1325 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:16,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 926 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:47:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-11 03:47:16,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 246. [2024-10-11 03:47:16,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.3021276595744682) internal successors, (306), 245 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:16,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 306 transitions. [2024-10-11 03:47:16,292 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 306 transitions. Word has length 62 [2024-10-11 03:47:16,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:16,292 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 306 transitions. [2024-10-11 03:47:16,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:16,293 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 306 transitions. [2024-10-11 03:47:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:47:16,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:16,294 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] [2024-10-11 03:47:16,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:47:16,294 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:16,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:16,295 INFO L85 PathProgramCache]: Analyzing trace with hash -838403427, now seen corresponding path program 1 times [2024-10-11 03:47:16,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:16,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280485572] [2024-10-11 03:47:16,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:16,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:47:16,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:16,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280485572] [2024-10-11 03:47:16,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280485572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:16,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:16,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:47:16,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455382689] [2024-10-11 03:47:16,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:16,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:47:16,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:16,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:47:16,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:47:16,602 INFO L87 Difference]: Start difference. First operand 246 states and 306 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:17,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:17,036 INFO L93 Difference]: Finished difference Result 485 states and 605 transitions. [2024-10-11 03:47:17,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:47:17,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-11 03:47:17,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:17,038 INFO L225 Difference]: With dead ends: 485 [2024-10-11 03:47:17,039 INFO L226 Difference]: Without dead ends: 352 [2024-10-11 03:47:17,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:47:17,040 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 846 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:17,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 756 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:47:17,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-11 03:47:17,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 246. [2024-10-11 03:47:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.297872340425532) internal successors, (305), 245 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 305 transitions. [2024-10-11 03:47:17,046 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 305 transitions. Word has length 62 [2024-10-11 03:47:17,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:17,046 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 305 transitions. [2024-10-11 03:47:17,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:17,046 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 305 transitions. [2024-10-11 03:47:17,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:47:17,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:17,047 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] [2024-10-11 03:47:17,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:47:17,047 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:17,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:17,048 INFO L85 PathProgramCache]: Analyzing trace with hash 350648810, now seen corresponding path program 1 times [2024-10-11 03:47:17,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:17,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318828716] [2024-10-11 03:47:17,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:17,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:17,337 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:47:17,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:17,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318828716] [2024-10-11 03:47:17,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318828716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:17,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:17,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:47:17,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758892497] [2024-10-11 03:47:17,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:17,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:47:17,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:17,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:47:17,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:47:17,342 INFO L87 Difference]: Start difference. First operand 246 states and 305 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:17,883 INFO L93 Difference]: Finished difference Result 429 states and 545 transitions. [2024-10-11 03:47:17,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:47:17,883 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-11 03:47:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:17,885 INFO L225 Difference]: With dead ends: 429 [2024-10-11 03:47:17,885 INFO L226 Difference]: Without dead ends: 370 [2024-10-11 03:47:17,885 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:47:17,886 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 940 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:17,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 976 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:47:17,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-10-11 03:47:17,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 246. [2024-10-11 03:47:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2936170212765958) internal successors, (304), 245 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:17,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 304 transitions. [2024-10-11 03:47:17,891 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 304 transitions. Word has length 64 [2024-10-11 03:47:17,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:17,891 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 304 transitions. [2024-10-11 03:47:17,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:17,892 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 304 transitions. [2024-10-11 03:47:17,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:47:17,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:17,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:47:17,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:47:17,893 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:17,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:17,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2032121384, now seen corresponding path program 1 times [2024-10-11 03:47:17,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:17,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343621019] [2024-10-11 03:47:17,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:17,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:18,372 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:47:18,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:18,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343621019] [2024-10-11 03:47:18,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343621019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:18,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:18,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:47:18,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123171721] [2024-10-11 03:47:18,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:18,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:47:18,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:18,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:47:18,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:47:18,375 INFO L87 Difference]: Start difference. First operand 246 states and 304 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:19,384 INFO L93 Difference]: Finished difference Result 631 states and 837 transitions. [2024-10-11 03:47:19,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:47:19,385 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-11 03:47:19,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:19,387 INFO L225 Difference]: With dead ends: 631 [2024-10-11 03:47:19,387 INFO L226 Difference]: Without dead ends: 560 [2024-10-11 03:47:19,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:47:19,389 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 2696 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2696 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:19,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2696 Valid, 1234 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:47:19,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-10-11 03:47:19,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 250. [2024-10-11 03:47:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.288702928870293) internal successors, (308), 249 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 308 transitions. [2024-10-11 03:47:19,396 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 308 transitions. Word has length 64 [2024-10-11 03:47:19,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:19,396 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 308 transitions. [2024-10-11 03:47:19,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 308 transitions. [2024-10-11 03:47:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:47:19,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:19,399 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] [2024-10-11 03:47:19,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:47:19,400 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:19,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:19,400 INFO L85 PathProgramCache]: Analyzing trace with hash 861544116, now seen corresponding path program 1 times [2024-10-11 03:47:19,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:19,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734181108] [2024-10-11 03:47:19,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:19,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:19,642 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:47:19,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:19,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734181108] [2024-10-11 03:47:19,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734181108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:19,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:19,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:47:19,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693554076] [2024-10-11 03:47:19,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:19,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:47:19,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:19,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:47:19,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:47:19,645 INFO L87 Difference]: Start difference. First operand 250 states and 308 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:20,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:20,158 INFO L93 Difference]: Finished difference Result 430 states and 545 transitions. [2024-10-11 03:47:20,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:47:20,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-11 03:47:20,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:20,160 INFO L225 Difference]: With dead ends: 430 [2024-10-11 03:47:20,160 INFO L226 Difference]: Without dead ends: 374 [2024-10-11 03:47:20,161 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:47:20,161 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 650 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:20,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 982 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:47:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-11 03:47:20,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 250. [2024-10-11 03:47:20,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.284518828451883) internal successors, (307), 249 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 307 transitions. [2024-10-11 03:47:20,168 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 307 transitions. Word has length 64 [2024-10-11 03:47:20,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:20,168 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 307 transitions. [2024-10-11 03:47:20,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:20,169 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 307 transitions. [2024-10-11 03:47:20,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:47:20,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:20,170 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] [2024-10-11 03:47:20,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:47:20,170 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:20,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:20,171 INFO L85 PathProgramCache]: Analyzing trace with hash -404487765, now seen corresponding path program 1 times [2024-10-11 03:47:20,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:20,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845986329] [2024-10-11 03:47:20,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:20,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:20,387 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:47:20,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:20,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845986329] [2024-10-11 03:47:20,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845986329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:20,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:20,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:47:20,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748995722] [2024-10-11 03:47:20,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:20,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:47:20,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:20,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:47:20,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:47:20,390 INFO L87 Difference]: Start difference. First operand 250 states and 307 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:20,867 INFO L93 Difference]: Finished difference Result 379 states and 467 transitions. [2024-10-11 03:47:20,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:47:20,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-11 03:47:20,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:20,869 INFO L225 Difference]: With dead ends: 379 [2024-10-11 03:47:20,869 INFO L226 Difference]: Without dead ends: 374 [2024-10-11 03:47:20,869 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:47:20,870 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 1214 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:20,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 760 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:47:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-11 03:47:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 250. [2024-10-11 03:47:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.2803347280334727) internal successors, (306), 249 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 306 transitions. [2024-10-11 03:47:20,875 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 306 transitions. Word has length 64 [2024-10-11 03:47:20,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:20,876 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 306 transitions. [2024-10-11 03:47:20,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:20,876 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 306 transitions. [2024-10-11 03:47:20,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:47:20,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:20,877 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] [2024-10-11 03:47:20,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:47:20,877 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:20,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:20,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1265909968, now seen corresponding path program 1 times [2024-10-11 03:47:20,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:20,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048381369] [2024-10-11 03:47:20,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:20,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:21,133 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:47:21,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:21,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048381369] [2024-10-11 03:47:21,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048381369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:21,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:21,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:47:21,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451457662] [2024-10-11 03:47:21,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:21,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:47:21,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:21,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:47:21,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:47:21,136 INFO L87 Difference]: Start difference. First operand 250 states and 306 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:21,582 INFO L93 Difference]: Finished difference Result 379 states and 465 transitions. [2024-10-11 03:47:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:47:21,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-11 03:47:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:21,584 INFO L225 Difference]: With dead ends: 379 [2024-10-11 03:47:21,584 INFO L226 Difference]: Without dead ends: 374 [2024-10-11 03:47:21,584 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:47:21,584 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 931 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:21,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 975 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:47:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-11 03:47:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 250. [2024-10-11 03:47:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.2761506276150627) internal successors, (305), 249 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 305 transitions. [2024-10-11 03:47:21,591 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 305 transitions. Word has length 64 [2024-10-11 03:47:21,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:21,591 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 305 transitions. [2024-10-11 03:47:21,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:21,592 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 305 transitions. [2024-10-11 03:47:21,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:47:21,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:21,592 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] [2024-10-11 03:47:21,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:47:21,593 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:21,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:21,593 INFO L85 PathProgramCache]: Analyzing trace with hash 646287134, now seen corresponding path program 1 times [2024-10-11 03:47:21,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:21,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195396477] [2024-10-11 03:47:21,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:21,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:21,835 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:47:21,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:21,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195396477] [2024-10-11 03:47:21,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195396477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:21,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:21,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:47:21,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248850779] [2024-10-11 03:47:21,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:21,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:47:21,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:21,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:47:21,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:47:21,838 INFO L87 Difference]: Start difference. First operand 250 states and 305 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:22,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:22,329 INFO L93 Difference]: Finished difference Result 395 states and 489 transitions. [2024-10-11 03:47:22,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:47:22,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-11 03:47:22,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:22,331 INFO L225 Difference]: With dead ends: 395 [2024-10-11 03:47:22,331 INFO L226 Difference]: Without dead ends: 378 [2024-10-11 03:47:22,331 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:47:22,332 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 911 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:22,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1195 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:47:22,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-11 03:47:22,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 250. [2024-10-11 03:47:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.2719665271966527) internal successors, (304), 249 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:22,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 304 transitions. [2024-10-11 03:47:22,337 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 304 transitions. Word has length 64 [2024-10-11 03:47:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:22,338 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 304 transitions. [2024-10-11 03:47:22,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 304 transitions. [2024-10-11 03:47:22,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:47:22,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:22,339 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] [2024-10-11 03:47:22,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:47:22,339 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:22,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:22,340 INFO L85 PathProgramCache]: Analyzing trace with hash -819884853, now seen corresponding path program 1 times [2024-10-11 03:47:22,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:22,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231961442] [2024-10-11 03:47:22,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:22,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:22,732 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:47:22,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:22,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231961442] [2024-10-11 03:47:22,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231961442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:22,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:22,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:47:22,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815023227] [2024-10-11 03:47:22,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:22,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:47:22,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:22,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:47:22,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:47:22,735 INFO L87 Difference]: Start difference. First operand 250 states and 304 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:23,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:23,837 INFO L93 Difference]: Finished difference Result 584 states and 741 transitions. [2024-10-11 03:47:23,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 03:47:23,838 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-10-11 03:47:23,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:23,841 INFO L225 Difference]: With dead ends: 584 [2024-10-11 03:47:23,841 INFO L226 Difference]: Without dead ends: 513 [2024-10-11 03:47:23,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:47:23,844 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 1113 mSDsluCounter, 2009 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:23,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 2385 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:47:23,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-10-11 03:47:23,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 246. [2024-10-11 03:47:23,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2723404255319148) internal successors, (299), 245 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 299 transitions. [2024-10-11 03:47:23,853 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 299 transitions. Word has length 65 [2024-10-11 03:47:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:23,854 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 299 transitions. [2024-10-11 03:47:23,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 299 transitions. [2024-10-11 03:47:23,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 03:47:23,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:23,855 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] [2024-10-11 03:47:23,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:47:23,855 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:23,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:23,855 INFO L85 PathProgramCache]: Analyzing trace with hash 107558087, now seen corresponding path program 1 times [2024-10-11 03:47:23,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:23,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695081268] [2024-10-11 03:47:23,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:23,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:24,380 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:47:24,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:24,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695081268] [2024-10-11 03:47:24,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695081268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:24,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:24,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:47:24,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616371303] [2024-10-11 03:47:24,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:24,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:47:24,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:24,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:47:24,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:47:24,382 INFO L87 Difference]: Start difference. First operand 246 states and 299 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:24,696 INFO L93 Difference]: Finished difference Result 383 states and 483 transitions. [2024-10-11 03:47:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:47:24,697 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-11 03:47:24,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:24,698 INFO L225 Difference]: With dead ends: 383 [2024-10-11 03:47:24,698 INFO L226 Difference]: Without dead ends: 266 [2024-10-11 03:47:24,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:47:24,699 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1092 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:24,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 666 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:47:24,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-11 03:47:24,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 183. [2024-10-11 03:47:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 176 states have (on average 1.2613636363636365) internal successors, (222), 182 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 222 transitions. [2024-10-11 03:47:24,705 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 222 transitions. Word has length 66 [2024-10-11 03:47:24,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:24,705 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 222 transitions. [2024-10-11 03:47:24,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:24,706 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 222 transitions. [2024-10-11 03:47:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 03:47:24,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:24,706 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] [2024-10-11 03:47:24,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:47:24,707 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:24,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:24,707 INFO L85 PathProgramCache]: Analyzing trace with hash 89242274, now seen corresponding path program 1 times [2024-10-11 03:47:24,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:24,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991619656] [2024-10-11 03:47:24,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:24,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:25,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:47:25,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:25,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991619656] [2024-10-11 03:47:25,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991619656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:25,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:25,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-10-11 03:47:25,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614036528] [2024-10-11 03:47:25,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:25,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 03:47:25,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:25,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 03:47:25,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2024-10-11 03:47:25,975 INFO L87 Difference]: Start difference. First operand 183 states and 222 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:27,998 INFO L93 Difference]: Finished difference Result 585 states and 751 transitions. [2024-10-11 03:47:27,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 03:47:27,999 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-11 03:47:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:28,002 INFO L225 Difference]: With dead ends: 585 [2024-10-11 03:47:28,002 INFO L226 Difference]: Without dead ends: 527 [2024-10-11 03:47:28,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=290, Invalid=1516, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 03:47:28,003 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 1893 mSDsluCounter, 4803 mSDsCounter, 0 mSdLazyCounter, 2582 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1893 SdHoareTripleChecker+Valid, 5224 SdHoareTripleChecker+Invalid, 2584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:28,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1893 Valid, 5224 Invalid, 2584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2582 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:47:28,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-11 03:47:28,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 198. [2024-10-11 03:47:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 191 states have (on average 1.2722513089005236) internal successors, (243), 197 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 243 transitions. [2024-10-11 03:47:28,010 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 243 transitions. Word has length 66 [2024-10-11 03:47:28,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:28,011 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 243 transitions. [2024-10-11 03:47:28,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:28,011 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 243 transitions. [2024-10-11 03:47:28,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 03:47:28,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:28,012 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] [2024-10-11 03:47:28,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:47:28,012 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:28,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:28,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1372728877, now seen corresponding path program 1 times [2024-10-11 03:47:28,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:28,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991441500] [2024-10-11 03:47:28,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:28,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:28,530 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:47:28,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:28,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991441500] [2024-10-11 03:47:28,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991441500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:28,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:28,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:47:28,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643368032] [2024-10-11 03:47:28,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:28,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:47:28,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:28,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:47:28,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:47:28,532 INFO L87 Difference]: Start difference. First operand 198 states and 243 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:29,198 INFO L93 Difference]: Finished difference Result 437 states and 557 transitions. [2024-10-11 03:47:29,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:47:29,200 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-11 03:47:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:29,202 INFO L225 Difference]: With dead ends: 437 [2024-10-11 03:47:29,202 INFO L226 Difference]: Without dead ends: 433 [2024-10-11 03:47:29,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:47:29,203 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 1285 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:29,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 1432 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:47:29,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-11 03:47:29,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 194. [2024-10-11 03:47:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 188 states have (on average 1.2712765957446808) internal successors, (239), 193 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 239 transitions. [2024-10-11 03:47:29,210 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 239 transitions. Word has length 66 [2024-10-11 03:47:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:29,211 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 239 transitions. [2024-10-11 03:47:29,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 239 transitions. [2024-10-11 03:47:29,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 03:47:29,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:29,212 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] [2024-10-11 03:47:29,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:47:29,212 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:29,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:29,213 INFO L85 PathProgramCache]: Analyzing trace with hash -407788271, now seen corresponding path program 1 times [2024-10-11 03:47:29,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:29,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308521118] [2024-10-11 03:47:29,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:29,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:29,753 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:47:29,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:29,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308521118] [2024-10-11 03:47:29,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308521118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:29,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:29,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:47:29,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995481132] [2024-10-11 03:47:29,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:29,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:47:29,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:29,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:47:29,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:47:29,755 INFO L87 Difference]: Start difference. First operand 194 states and 239 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:30,401 INFO L93 Difference]: Finished difference Result 520 states and 681 transitions. [2024-10-11 03:47:30,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:47:30,401 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-11 03:47:30,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:30,403 INFO L225 Difference]: With dead ends: 520 [2024-10-11 03:47:30,403 INFO L226 Difference]: Without dead ends: 437 [2024-10-11 03:47:30,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:47:30,404 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 861 mSDsluCounter, 3162 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 3672 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:30,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 3672 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:47:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-10-11 03:47:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 165. [2024-10-11 03:47:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 161 states have (on average 1.2732919254658386) internal successors, (205), 164 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 205 transitions. [2024-10-11 03:47:30,409 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 205 transitions. Word has length 66 [2024-10-11 03:47:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:30,410 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 205 transitions. [2024-10-11 03:47:30,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 205 transitions. [2024-10-11 03:47:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 03:47:30,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:30,411 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] [2024-10-11 03:47:30,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:47:30,411 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:30,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:30,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1736033602, now seen corresponding path program 1 times [2024-10-11 03:47:30,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:30,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223064497] [2024-10-11 03:47:30,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:30,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:30,881 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:47:30,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:30,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223064497] [2024-10-11 03:47:30,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223064497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:30,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:30,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:47:30,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679658797] [2024-10-11 03:47:30,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:30,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:47:30,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:30,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:47:30,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:47:30,883 INFO L87 Difference]: Start difference. First operand 165 states and 205 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:31,257 INFO L93 Difference]: Finished difference Result 292 states and 384 transitions. [2024-10-11 03:47:31,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:47:31,258 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-10-11 03:47:31,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:31,259 INFO L225 Difference]: With dead ends: 292 [2024-10-11 03:47:31,259 INFO L226 Difference]: Without dead ends: 234 [2024-10-11 03:47:31,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:47:31,260 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 468 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:31,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 815 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:47:31,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-11 03:47:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 146. [2024-10-11 03:47:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 143 states have (on average 1.2517482517482517) internal successors, (179), 145 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2024-10-11 03:47:31,267 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 67 [2024-10-11 03:47:31,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:31,267 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2024-10-11 03:47:31,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:31,268 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2024-10-11 03:47:31,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 03:47:31,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:31,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] [2024-10-11 03:47:31,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:47:31,269 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:31,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:31,269 INFO L85 PathProgramCache]: Analyzing trace with hash -812946096, now seen corresponding path program 1 times [2024-10-11 03:47:31,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:31,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053624579] [2024-10-11 03:47:31,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:31,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:31,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:47:31,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:31,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053624579] [2024-10-11 03:47:31,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053624579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:31,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:31,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:47:31,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955429242] [2024-10-11 03:47:31,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:31,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:47:31,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:31,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:47:31,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:47:31,490 INFO L87 Difference]: Start difference. First operand 146 states and 179 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:31,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:31,758 INFO L93 Difference]: Finished difference Result 228 states and 287 transitions. [2024-10-11 03:47:31,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:47:31,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-10-11 03:47:31,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:31,759 INFO L225 Difference]: With dead ends: 228 [2024-10-11 03:47:31,759 INFO L226 Difference]: Without dead ends: 221 [2024-10-11 03:47:31,760 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:47:31,760 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 532 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:31,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 566 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:47:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-11 03:47:31,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 146. [2024-10-11 03:47:31,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 143 states have (on average 1.2447552447552448) internal successors, (178), 145 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:31,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 178 transitions. [2024-10-11 03:47:31,766 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 178 transitions. Word has length 67 [2024-10-11 03:47:31,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:31,767 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 178 transitions. [2024-10-11 03:47:31,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:31,767 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 178 transitions. [2024-10-11 03:47:31,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 03:47:31,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:31,768 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] [2024-10-11 03:47:31,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:47:31,769 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:31,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:31,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1116116258, now seen corresponding path program 1 times [2024-10-11 03:47:31,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:31,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946564666] [2024-10-11 03:47:31,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:31,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:31,967 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:47:31,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:31,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946564666] [2024-10-11 03:47:31,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946564666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:31,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:31,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:47:31,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177866138] [2024-10-11 03:47:31,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:31,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:47:31,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:31,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:47:31,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:47:31,970 INFO L87 Difference]: Start difference. First operand 146 states and 178 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:32,346 INFO L93 Difference]: Finished difference Result 311 states and 400 transitions. [2024-10-11 03:47:32,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:47:32,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-10-11 03:47:32,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:32,347 INFO L225 Difference]: With dead ends: 311 [2024-10-11 03:47:32,347 INFO L226 Difference]: Without dead ends: 239 [2024-10-11 03:47:32,348 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:47:32,348 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 535 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:32,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 724 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:47:32,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-11 03:47:32,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 146. [2024-10-11 03:47:32,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 143 states have (on average 1.2377622377622377) internal successors, (177), 145 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:32,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2024-10-11 03:47:32,352 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 67 [2024-10-11 03:47:32,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:32,352 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2024-10-11 03:47:32,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:32,353 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2024-10-11 03:47:32,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:47:32,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:32,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:47:32,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:47:32,354 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:32,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:32,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1523699975, now seen corresponding path program 1 times [2024-10-11 03:47:32,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:32,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26163172] [2024-10-11 03:47:32,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:32,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:33,571 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:47:33,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:33,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26163172] [2024-10-11 03:47:33,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26163172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:33,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:33,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-11 03:47:33,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855346390] [2024-10-11 03:47:33,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:33,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 03:47:33,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:33,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 03:47:33,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2024-10-11 03:47:33,573 INFO L87 Difference]: Start difference. First operand 146 states and 177 transitions. Second operand has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:35,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:35,292 INFO L93 Difference]: Finished difference Result 404 states and 520 transitions. [2024-10-11 03:47:35,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 03:47:35,293 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-10-11 03:47:35,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:35,294 INFO L225 Difference]: With dead ends: 404 [2024-10-11 03:47:35,294 INFO L226 Difference]: Without dead ends: 398 [2024-10-11 03:47:35,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=234, Invalid=1326, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 03:47:35,295 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1253 mSDsluCounter, 3868 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 4179 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:35,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 4179 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:47:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-11 03:47:35,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 162. [2024-10-11 03:47:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 159 states have (on average 1.2389937106918238) internal successors, (197), 161 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 197 transitions. [2024-10-11 03:47:35,300 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 197 transitions. Word has length 69 [2024-10-11 03:47:35,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:35,300 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 197 transitions. [2024-10-11 03:47:35,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 197 transitions. [2024-10-11 03:47:35,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:47:35,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:35,302 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] [2024-10-11 03:47:35,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:47:35,302 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:35,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:35,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1858906752, now seen corresponding path program 1 times [2024-10-11 03:47:35,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:35,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412089106] [2024-10-11 03:47:35,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:35,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:36,173 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:47:36,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:36,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412089106] [2024-10-11 03:47:36,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412089106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:36,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:36,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-10-11 03:47:36,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670105757] [2024-10-11 03:47:36,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:36,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 03:47:36,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:36,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 03:47:36,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:47:36,175 INFO L87 Difference]: Start difference. First operand 162 states and 197 transitions. Second operand has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:37,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:37,594 INFO L93 Difference]: Finished difference Result 500 states and 645 transitions. [2024-10-11 03:47:37,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 03:47:37,595 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-10-11 03:47:37,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:37,596 INFO L225 Difference]: With dead ends: 500 [2024-10-11 03:47:37,596 INFO L226 Difference]: Without dead ends: 492 [2024-10-11 03:47:37,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=1107, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 03:47:37,598 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 1494 mSDsluCounter, 4180 mSDsCounter, 0 mSdLazyCounter, 2220 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 4590 SdHoareTripleChecker+Invalid, 2226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:37,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 4590 Invalid, 2226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2220 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:47:37,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-10-11 03:47:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 166. [2024-10-11 03:47:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 163 states have (on average 1.2392638036809815) internal successors, (202), 165 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 202 transitions. [2024-10-11 03:47:37,606 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 202 transitions. Word has length 69 [2024-10-11 03:47:37,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:37,606 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 202 transitions. [2024-10-11 03:47:37,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 202 transitions. [2024-10-11 03:47:37,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 03:47:37,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:37,607 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] [2024-10-11 03:47:37,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:47:37,608 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:37,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:37,608 INFO L85 PathProgramCache]: Analyzing trace with hash -327269785, now seen corresponding path program 1 times [2024-10-11 03:47:37,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:37,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776877275] [2024-10-11 03:47:37,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:37,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:38,081 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:47:38,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:38,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776877275] [2024-10-11 03:47:38,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776877275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:38,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:38,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:47:38,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307456940] [2024-10-11 03:47:38,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:38,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:47:38,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:38,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:47:38,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:47:38,085 INFO L87 Difference]: Start difference. First operand 166 states and 202 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:38,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:38,668 INFO L93 Difference]: Finished difference Result 363 states and 476 transitions. [2024-10-11 03:47:38,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:47:38,669 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-10-11 03:47:38,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:38,670 INFO L225 Difference]: With dead ends: 363 [2024-10-11 03:47:38,670 INFO L226 Difference]: Without dead ends: 357 [2024-10-11 03:47:38,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:47:38,671 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 1061 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:38,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 1814 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:47:38,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-11 03:47:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 154. [2024-10-11 03:47:38,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 152 states have (on average 1.236842105263158) internal successors, (188), 153 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 188 transitions. [2024-10-11 03:47:38,675 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 188 transitions. Word has length 70 [2024-10-11 03:47:38,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:38,676 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 188 transitions. [2024-10-11 03:47:38,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:38,676 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 188 transitions. [2024-10-11 03:47:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 03:47:38,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:38,677 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] [2024-10-11 03:47:38,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:47:38,677 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:38,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:38,678 INFO L85 PathProgramCache]: Analyzing trace with hash 7936992, now seen corresponding path program 1 times [2024-10-11 03:47:38,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:38,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892814752] [2024-10-11 03:47:38,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:38,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:39,195 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:47:39,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:39,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892814752] [2024-10-11 03:47:39,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892814752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:39,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:39,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:47:39,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839357408] [2024-10-11 03:47:39,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:39,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:47:39,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:39,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:47:39,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:47:39,199 INFO L87 Difference]: Start difference. First operand 154 states and 188 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:39,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:39,865 INFO L93 Difference]: Finished difference Result 361 states and 478 transitions. [2024-10-11 03:47:39,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:47:39,866 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-10-11 03:47:39,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:39,867 INFO L225 Difference]: With dead ends: 361 [2024-10-11 03:47:39,867 INFO L226 Difference]: Without dead ends: 346 [2024-10-11 03:47:39,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:47:39,868 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 841 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 2247 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:39,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 2247 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:47:39,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-11 03:47:39,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 128. [2024-10-11 03:47:39,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.2440944881889764) internal successors, (158), 127 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2024-10-11 03:47:39,871 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 70 [2024-10-11 03:47:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:39,872 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2024-10-11 03:47:39,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:39,872 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2024-10-11 03:47:39,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:47:39,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:39,873 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] [2024-10-11 03:47:39,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:47:39,873 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:39,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:39,874 INFO L85 PathProgramCache]: Analyzing trace with hash 258319301, now seen corresponding path program 1 times [2024-10-11 03:47:39,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:39,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488773379] [2024-10-11 03:47:39,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:39,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:39,971 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:47:39,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:39,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488773379] [2024-10-11 03:47:39,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488773379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:39,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:39,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:47:39,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649928386] [2024-10-11 03:47:39,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:39,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:47:39,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:39,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:47:39,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:47:39,973 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:40,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:40,077 INFO L93 Difference]: Finished difference Result 560 states and 790 transitions. [2024-10-11 03:47:40,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:47:40,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-11 03:47:40,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:40,079 INFO L225 Difference]: With dead ends: 560 [2024-10-11 03:47:40,079 INFO L226 Difference]: Without dead ends: 506 [2024-10-11 03:47:40,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:47:40,080 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 834 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:40,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 1256 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:47:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-10-11 03:47:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 180. [2024-10-11 03:47:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.3072625698324023) internal successors, (234), 179 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 234 transitions. [2024-10-11 03:47:40,090 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 234 transitions. Word has length 92 [2024-10-11 03:47:40,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:40,091 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 234 transitions. [2024-10-11 03:47:40,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 234 transitions. [2024-10-11 03:47:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:47:40,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:40,092 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] [2024-10-11 03:47:40,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:47:40,092 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:40,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:40,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1995837309, now seen corresponding path program 1 times [2024-10-11 03:47:40,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:40,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800062881] [2024-10-11 03:47:40,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:40,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:40,208 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:47:40,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:40,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800062881] [2024-10-11 03:47:40,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800062881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:40,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:40,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:47:40,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864339528] [2024-10-11 03:47:40,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:40,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:47:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:40,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:47:40,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:47:40,211 INFO L87 Difference]: Start difference. First operand 180 states and 234 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:40,286 INFO L93 Difference]: Finished difference Result 658 states and 931 transitions. [2024-10-11 03:47:40,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:47:40,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:47:40,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:40,291 INFO L225 Difference]: With dead ends: 658 [2024-10-11 03:47:40,292 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 03:47:40,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:47:40,293 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 642 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:40,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 750 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:40,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 03:47:40,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 284. [2024-10-11 03:47:40,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.3674911660777385) internal successors, (387), 283 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 387 transitions. [2024-10-11 03:47:40,299 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 387 transitions. Word has length 94 [2024-10-11 03:47:40,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:40,300 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 387 transitions. [2024-10-11 03:47:40,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:40,300 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 387 transitions. [2024-10-11 03:47:40,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:47:40,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:40,301 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] [2024-10-11 03:47:40,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 03:47:40,302 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:40,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:40,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1133377405, now seen corresponding path program 1 times [2024-10-11 03:47:40,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:40,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723696293] [2024-10-11 03:47:40,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:40,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:40,403 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:47:40,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:40,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723696293] [2024-10-11 03:47:40,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723696293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:40,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:40,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:47:40,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095507199] [2024-10-11 03:47:40,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:40,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:47:40,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:40,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:47:40,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:47:40,404 INFO L87 Difference]: Start difference. First operand 284 states and 387 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:40,485 INFO L93 Difference]: Finished difference Result 762 states and 1084 transitions. [2024-10-11 03:47:40,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:47:40,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:47:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:40,488 INFO L225 Difference]: With dead ends: 762 [2024-10-11 03:47:40,488 INFO L226 Difference]: Without dead ends: 656 [2024-10-11 03:47:40,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:47:40,489 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 641 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:40,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 711 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:47:40,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-10-11 03:47:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 440. [2024-10-11 03:47:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.4031890660592254) internal successors, (616), 439 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 616 transitions. [2024-10-11 03:47:40,502 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 616 transitions. Word has length 94 [2024-10-11 03:47:40,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:40,503 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 616 transitions. [2024-10-11 03:47:40,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 616 transitions. [2024-10-11 03:47:40,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:47:40,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:40,504 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] [2024-10-11 03:47:40,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 03:47:40,505 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:40,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:40,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2140031494, now seen corresponding path program 1 times [2024-10-11 03:47:40,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:40,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832498685] [2024-10-11 03:47:40,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:40,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:40,715 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:47:40,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:40,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832498685] [2024-10-11 03:47:40,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832498685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:40,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:40,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:47:40,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490465668] [2024-10-11 03:47:40,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:40,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:47:40,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:40,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:47:40,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:47:40,717 INFO L87 Difference]: Start difference. First operand 440 states and 616 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:40,801 INFO L93 Difference]: Finished difference Result 808 states and 1154 transitions. [2024-10-11 03:47:40,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:47:40,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:47:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:40,803 INFO L225 Difference]: With dead ends: 808 [2024-10-11 03:47:40,803 INFO L226 Difference]: Without dead ends: 442 [2024-10-11 03:47:40,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:47:40,805 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 260 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:40,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 372 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:40,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-11 03:47:40,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2024-10-11 03:47:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.3940774487471526) internal successors, (612), 439 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:40,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 612 transitions. [2024-10-11 03:47:40,812 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 612 transitions. Word has length 94 [2024-10-11 03:47:40,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:40,813 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 612 transitions. [2024-10-11 03:47:40,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:40,813 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 612 transitions. [2024-10-11 03:47:40,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:47:40,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:40,814 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] [2024-10-11 03:47:40,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 03:47:40,814 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:40,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:40,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1370738501, now seen corresponding path program 1 times [2024-10-11 03:47:40,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:40,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951228150] [2024-10-11 03:47:40,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:40,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:40,862 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:47:40,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:40,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951228150] [2024-10-11 03:47:40,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951228150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:40,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:40,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:47:40,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067112082] [2024-10-11 03:47:40,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:40,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:47:40,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:40,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:47:40,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:47:40,864 INFO L87 Difference]: Start difference. First operand 440 states and 612 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:40,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:40,888 INFO L93 Difference]: Finished difference Result 1127 states and 1603 transitions. [2024-10-11 03:47:40,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:47:40,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:47:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:40,891 INFO L225 Difference]: With dead ends: 1127 [2024-10-11 03:47:40,891 INFO L226 Difference]: Without dead ends: 761 [2024-10-11 03:47:40,891 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:47:40,892 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 66 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:40,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 363 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:40,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-10-11 03:47:40,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 759. [2024-10-11 03:47:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 758 states have (on average 1.391820580474934) internal successors, (1055), 758 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:40,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1055 transitions. [2024-10-11 03:47:40,904 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1055 transitions. Word has length 94 [2024-10-11 03:47:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:40,905 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1055 transitions. [2024-10-11 03:47:40,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1055 transitions. [2024-10-11 03:47:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:47:40,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:40,906 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] [2024-10-11 03:47:40,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 03:47:40,906 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:40,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:40,908 INFO L85 PathProgramCache]: Analyzing trace with hash 257200399, now seen corresponding path program 1 times [2024-10-11 03:47:40,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:40,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747832891] [2024-10-11 03:47:40,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:40,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:41,016 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:47:41,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:41,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747832891] [2024-10-11 03:47:41,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747832891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:41,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:41,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:47:41,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980479446] [2024-10-11 03:47:41,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:41,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:47:41,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:41,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:47:41,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:47:41,020 INFO L87 Difference]: Start difference. First operand 759 states and 1055 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:41,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:41,105 INFO L93 Difference]: Finished difference Result 1549 states and 2180 transitions. [2024-10-11 03:47:41,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:47:41,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:47:41,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:41,110 INFO L225 Difference]: With dead ends: 1549 [2024-10-11 03:47:41,110 INFO L226 Difference]: Without dead ends: 1352 [2024-10-11 03:47:41,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:47:41,113 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 609 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:41,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 744 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:47:41,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2024-10-11 03:47:41,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 954. [2024-10-11 03:47:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 953 states have (on average 1.3987408184679957) internal successors, (1333), 953 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1333 transitions. [2024-10-11 03:47:41,132 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1333 transitions. Word has length 94 [2024-10-11 03:47:41,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:41,132 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1333 transitions. [2024-10-11 03:47:41,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1333 transitions. [2024-10-11 03:47:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:47:41,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:41,133 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] [2024-10-11 03:47:41,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 03:47:41,134 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:41,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:41,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1322748169, now seen corresponding path program 1 times [2024-10-11 03:47:41,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:41,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871104153] [2024-10-11 03:47:41,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:41,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:41,245 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:47:41,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:41,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871104153] [2024-10-11 03:47:41,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871104153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:41,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:41,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:47:41,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592286592] [2024-10-11 03:47:41,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:41,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:47:41,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:41,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:47:41,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:47:41,248 INFO L87 Difference]: Start difference. First operand 954 states and 1333 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:41,333 INFO L93 Difference]: Finished difference Result 1744 states and 2458 transitions. [2024-10-11 03:47:41,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:47:41,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:47:41,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:41,338 INFO L225 Difference]: With dead ends: 1744 [2024-10-11 03:47:41,338 INFO L226 Difference]: Without dead ends: 1547 [2024-10-11 03:47:41,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:47:41,339 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 579 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:41,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 794 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:47:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-10-11 03:47:41,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1149. [2024-10-11 03:47:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 1.4033101045296168) internal successors, (1611), 1148 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1611 transitions. [2024-10-11 03:47:41,360 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1611 transitions. Word has length 94 [2024-10-11 03:47:41,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:41,360 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1611 transitions. [2024-10-11 03:47:41,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:41,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1611 transitions. [2024-10-11 03:47:41,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:47:41,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:41,362 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] [2024-10-11 03:47:41,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 03:47:41,362 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:41,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:41,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1857299327, now seen corresponding path program 1 times [2024-10-11 03:47:41,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:41,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957950111] [2024-10-11 03:47:41,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:41,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:41,449 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:47:41,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:41,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957950111] [2024-10-11 03:47:41,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957950111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:41,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:41,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:47:41,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11926234] [2024-10-11 03:47:41,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:41,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:47:41,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:41,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:47:41,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:47:41,452 INFO L87 Difference]: Start difference. First operand 1149 states and 1611 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:41,476 INFO L93 Difference]: Finished difference Result 2881 states and 4058 transitions. [2024-10-11 03:47:41,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:47:41,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-10-11 03:47:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:41,482 INFO L225 Difference]: With dead ends: 2881 [2024-10-11 03:47:41,482 INFO L226 Difference]: Without dead ends: 1806 [2024-10-11 03:47:41,484 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:47:41,484 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 77 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 339 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:47:41,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 339 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2024-10-11 03:47:41,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1716. [2024-10-11 03:47:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1715 states have (on average 1.3953352769679301) internal successors, (2393), 1715 states have internal predecessors, (2393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2393 transitions. [2024-10-11 03:47:41,534 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2393 transitions. Word has length 95 [2024-10-11 03:47:41,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:41,534 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 2393 transitions. [2024-10-11 03:47:41,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:41,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2393 transitions. [2024-10-11 03:47:41,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:47:41,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:41,535 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] [2024-10-11 03:47:41,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 03:47:41,536 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:41,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:41,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1350299432, now seen corresponding path program 1 times [2024-10-11 03:47:41,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:41,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464328053] [2024-10-11 03:47:41,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:41,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:41,634 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:47:41,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:41,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464328053] [2024-10-11 03:47:41,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464328053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:41,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:41,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:47:41,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356312567] [2024-10-11 03:47:41,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:41,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:47:41,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:41,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:47:41,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:47:41,636 INFO L87 Difference]: Start difference. First operand 1716 states and 2393 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:41,665 INFO L93 Difference]: Finished difference Result 4868 states and 6790 transitions. [2024-10-11 03:47:41,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:47:41,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-11 03:47:41,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:41,675 INFO L225 Difference]: With dead ends: 4868 [2024-10-11 03:47:41,676 INFO L226 Difference]: Without dead ends: 3226 [2024-10-11 03:47:41,678 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:47:41,679 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 70 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 339 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:47:41,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 339 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:41,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3226 states. [2024-10-11 03:47:41,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3226 to 3092. [2024-10-11 03:47:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3092 states, 3091 states have (on average 1.3836945972177288) internal successors, (4277), 3091 states have internal predecessors, (4277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:41,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4277 transitions. [2024-10-11 03:47:41,734 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4277 transitions. Word has length 96 [2024-10-11 03:47:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:41,735 INFO L471 AbstractCegarLoop]: Abstraction has 3092 states and 4277 transitions. [2024-10-11 03:47:41,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4277 transitions. [2024-10-11 03:47:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 03:47:41,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:41,737 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] [2024-10-11 03:47:41,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 03:47:41,737 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:41,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash 962335532, now seen corresponding path program 1 times [2024-10-11 03:47:41,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:41,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525587086] [2024-10-11 03:47:41,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:41,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:41,834 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:47:41,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:41,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525587086] [2024-10-11 03:47:41,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525587086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:41,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:41,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:47:41,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561933984] [2024-10-11 03:47:41,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:41,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:47:41,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:41,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:47:41,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:47:41,836 INFO L87 Difference]: Start difference. First operand 3092 states and 4277 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:41,872 INFO L93 Difference]: Finished difference Result 8864 states and 12211 transitions. [2024-10-11 03:47:41,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:47:41,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-11 03:47:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:41,889 INFO L225 Difference]: With dead ends: 8864 [2024-10-11 03:47:41,890 INFO L226 Difference]: Without dead ends: 5846 [2024-10-11 03:47:41,895 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:47:41,895 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 63 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 338 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:47:41,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 338 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5846 states. [2024-10-11 03:47:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5846 to 5580. [2024-10-11 03:47:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5580 states, 5579 states have (on average 1.3651191969887078) internal successors, (7616), 5579 states have internal predecessors, (7616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5580 states to 5580 states and 7616 transitions. [2024-10-11 03:47:41,988 INFO L78 Accepts]: Start accepts. Automaton has 5580 states and 7616 transitions. Word has length 97 [2024-10-11 03:47:41,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:41,988 INFO L471 AbstractCegarLoop]: Abstraction has 5580 states and 7616 transitions. [2024-10-11 03:47:41,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 5580 states and 7616 transitions. [2024-10-11 03:47:41,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 03:47:41,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:41,990 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] [2024-10-11 03:47:41,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 03:47:41,990 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:41,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:41,990 INFO L85 PathProgramCache]: Analyzing trace with hash 171833001, now seen corresponding path program 1 times [2024-10-11 03:47:41,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:41,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698038988] [2024-10-11 03:47:41,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:41,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:42,083 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:47:42,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:42,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698038988] [2024-10-11 03:47:42,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698038988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:42,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:42,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:47:42,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041333352] [2024-10-11 03:47:42,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:42,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:47:42,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:42,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:47:42,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:47:42,086 INFO L87 Difference]: Start difference. First operand 5580 states and 7616 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:42,142 INFO L93 Difference]: Finished difference Result 16064 states and 21766 transitions. [2024-10-11 03:47:42,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:47:42,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-11 03:47:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:42,164 INFO L225 Difference]: With dead ends: 16064 [2024-10-11 03:47:42,164 INFO L226 Difference]: Without dead ends: 10558 [2024-10-11 03:47:42,204 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:47:42,205 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 53 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 336 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:47:42,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 336 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:42,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10558 states. [2024-10-11 03:47:42,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10558 to 10028. [2024-10-11 03:47:42,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10028 states, 10027 states have (on average 1.3399820484691334) internal successors, (13436), 10027 states have internal predecessors, (13436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10028 states to 10028 states and 13436 transitions. [2024-10-11 03:47:42,349 INFO L78 Accepts]: Start accepts. Automaton has 10028 states and 13436 transitions. Word has length 98 [2024-10-11 03:47:42,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:42,349 INFO L471 AbstractCegarLoop]: Abstraction has 10028 states and 13436 transitions. [2024-10-11 03:47:42,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand 10028 states and 13436 transitions. [2024-10-11 03:47:42,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 03:47:42,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:42,350 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] [2024-10-11 03:47:42,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 03:47:42,351 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:42,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:42,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1861913153, now seen corresponding path program 1 times [2024-10-11 03:47:42,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:42,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186153851] [2024-10-11 03:47:42,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:42,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:42,585 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:47:42,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:42,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186153851] [2024-10-11 03:47:42,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186153851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:42,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:42,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:47:42,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931202989] [2024-10-11 03:47:42,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:42,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:47:42,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:42,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:47:42,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:47:42,587 INFO L87 Difference]: Start difference. First operand 10028 states and 13436 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:42,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:42,639 INFO L93 Difference]: Finished difference Result 10270 states and 13757 transitions. [2024-10-11 03:47:42,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:47:42,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-11 03:47:42,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:42,657 INFO L225 Difference]: With dead ends: 10270 [2024-10-11 03:47:42,658 INFO L226 Difference]: Without dead ends: 10268 [2024-10-11 03:47:42,662 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:47:42,663 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:42,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 751 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:42,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10268 states. [2024-10-11 03:47:42,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10268 to 10268. [2024-10-11 03:47:42,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10268 states, 10267 states have (on average 1.3226843284308951) internal successors, (13580), 10267 states have internal predecessors, (13580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:42,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10268 states to 10268 states and 13580 transitions. [2024-10-11 03:47:42,845 INFO L78 Accepts]: Start accepts. Automaton has 10268 states and 13580 transitions. Word has length 99 [2024-10-11 03:47:42,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:42,846 INFO L471 AbstractCegarLoop]: Abstraction has 10268 states and 13580 transitions. [2024-10-11 03:47:42,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:42,846 INFO L276 IsEmpty]: Start isEmpty. Operand 10268 states and 13580 transitions. [2024-10-11 03:47:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 03:47:42,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:42,847 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] [2024-10-11 03:47:42,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-11 03:47:42,848 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:42,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:42,848 INFO L85 PathProgramCache]: Analyzing trace with hash -6167163, now seen corresponding path program 1 times [2024-10-11 03:47:42,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:42,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929993069] [2024-10-11 03:47:42,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:42,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:42,903 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:47:42,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:42,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929993069] [2024-10-11 03:47:42,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929993069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:42,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:42,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:47:42,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607548502] [2024-10-11 03:47:42,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:42,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:47:42,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:42,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:47:42,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:47:42,906 INFO L87 Difference]: Start difference. First operand 10268 states and 13580 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:42,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:42,967 INFO L93 Difference]: Finished difference Result 20784 states and 27510 transitions. [2024-10-11 03:47:42,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:47:42,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-11 03:47:42,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:42,988 INFO L225 Difference]: With dead ends: 20784 [2024-10-11 03:47:42,988 INFO L226 Difference]: Without dead ends: 10590 [2024-10-11 03:47:43,001 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:47:43,002 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 86 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:43,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 278 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:43,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10590 states. [2024-10-11 03:47:43,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10590 to 10588. [2024-10-11 03:47:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10588 states, 10587 states have (on average 1.3057523377727402) internal successors, (13824), 10587 states have internal predecessors, (13824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10588 states to 10588 states and 13824 transitions. [2024-10-11 03:47:43,136 INFO L78 Accepts]: Start accepts. Automaton has 10588 states and 13824 transitions. Word has length 99 [2024-10-11 03:47:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:43,136 INFO L471 AbstractCegarLoop]: Abstraction has 10588 states and 13824 transitions. [2024-10-11 03:47:43,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 10588 states and 13824 transitions. [2024-10-11 03:47:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 03:47:43,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:43,139 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] [2024-10-11 03:47:43,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-11 03:47:43,140 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:43,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1453084349, now seen corresponding path program 1 times [2024-10-11 03:47:43,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:43,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452710096] [2024-10-11 03:47:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:43,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:43,608 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:47:43,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:43,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452710096] [2024-10-11 03:47:43,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452710096] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:47:43,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542429411] [2024-10-11 03:47:43,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:43,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:47:43,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:47:43,611 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:47:43,612 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:47:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:43,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 03:47:43,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:47:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:47:44,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:47:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:47:46,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542429411] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:47:46,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:47:46,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2024-10-11 03:47:46,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003928008] [2024-10-11 03:47:46,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:47:46,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 03:47:46,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:46,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 03:47:46,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2024-10-11 03:47:46,235 INFO L87 Difference]: Start difference. First operand 10588 states and 13824 transitions. Second operand has 30 states, 30 states have (on average 11.2) internal successors, (336), 29 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:50,593 INFO L93 Difference]: Finished difference Result 99160 states and 129549 transitions. [2024-10-11 03:47:50,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2024-10-11 03:47:50,593 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 11.2) internal successors, (336), 29 states have internal predecessors, (336), 0 states have call successors, (0), 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 126 [2024-10-11 03:47:50,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:50,737 INFO L225 Difference]: With dead ends: 99160 [2024-10-11 03:47:50,738 INFO L226 Difference]: Without dead ends: 88646 [2024-10-11 03:47:50,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7026 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3251, Invalid=18211, Unknown=0, NotChecked=0, Total=21462 [2024-10-11 03:47:50,772 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 3969 mSDsluCounter, 2824 mSDsCounter, 0 mSdLazyCounter, 2817 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3969 SdHoareTripleChecker+Valid, 2992 SdHoareTripleChecker+Invalid, 2844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:50,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3969 Valid, 2992 Invalid, 2844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2817 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:47:50,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88646 states. [2024-10-11 03:47:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88646 to 54988. [2024-10-11 03:47:51,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54988 states, 54987 states have (on average 1.2964155163947841) internal successors, (71286), 54987 states have internal predecessors, (71286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:51,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54988 states to 54988 states and 71286 transitions. [2024-10-11 03:47:51,733 INFO L78 Accepts]: Start accepts. Automaton has 54988 states and 71286 transitions. Word has length 126 [2024-10-11 03:47:51,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:51,734 INFO L471 AbstractCegarLoop]: Abstraction has 54988 states and 71286 transitions. [2024-10-11 03:47:51,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.2) internal successors, (336), 29 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 54988 states and 71286 transitions. [2024-10-11 03:47:51,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 03:47:51,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:51,742 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] [2024-10-11 03:47:51,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:47:51,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-10-11 03:47:51,943 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:51,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:51,944 INFO L85 PathProgramCache]: Analyzing trace with hash -292705955, now seen corresponding path program 1 times [2024-10-11 03:47:51,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:51,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515995736] [2024-10-11 03:47:51,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:51,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:52,188 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 03:47:52,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:52,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515995736] [2024-10-11 03:47:52,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515995736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:52,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:52,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:47:52,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162821380] [2024-10-11 03:47:52,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:52,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:47:52,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:52,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:47:52,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:47:52,190 INFO L87 Difference]: Start difference. First operand 54988 states and 71286 transitions. Second operand has 8 states, 8 states have (on average 14.625) 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:47:52,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:52,977 INFO L93 Difference]: Finished difference Result 166069 states and 214949 transitions. [2024-10-11 03:47:52,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:47:52,978 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.625) 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 127 [2024-10-11 03:47:52,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:53,406 INFO L225 Difference]: With dead ends: 166069 [2024-10-11 03:47:53,406 INFO L226 Difference]: Without dead ends: 111175 [2024-10-11 03:47:53,462 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:47:53,463 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 465 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:53,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 583 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:47:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111175 states. [2024-10-11 03:47:54,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111175 to 54988. [2024-10-11 03:47:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54988 states, 54987 states have (on average 1.2963791441613473) internal successors, (71284), 54987 states have internal predecessors, (71284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54988 states to 54988 states and 71284 transitions. [2024-10-11 03:47:54,603 INFO L78 Accepts]: Start accepts. Automaton has 54988 states and 71284 transitions. Word has length 127 [2024-10-11 03:47:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:54,604 INFO L471 AbstractCegarLoop]: Abstraction has 54988 states and 71284 transitions. [2024-10-11 03:47:54,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) 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:47:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 54988 states and 71284 transitions. [2024-10-11 03:47:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 03:47:54,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:54,616 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] [2024-10-11 03:47:54,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-11 03:47:54,616 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:54,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:54,617 INFO L85 PathProgramCache]: Analyzing trace with hash 527070712, now seen corresponding path program 1 times [2024-10-11 03:47:54,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:54,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473062199] [2024-10-11 03:47:54,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:54,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:47:55,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:55,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473062199] [2024-10-11 03:47:55,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473062199] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:47:55,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636800729] [2024-10-11 03:47:55,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:55,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:47:55,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:47:55,392 INFO L229 MonitoredProcess]: Starting monitored process 3 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:47:55,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:47:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:55,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 03:47:55,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:47:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:47:56,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:47:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:47:57,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636800729] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:47:57,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:47:57,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 30 [2024-10-11 03:47:57,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428868256] [2024-10-11 03:47:57,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:47:57,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 03:47:57,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:57,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 03:47:57,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2024-10-11 03:47:57,744 INFO L87 Difference]: Start difference. First operand 54988 states and 71284 transitions. Second operand has 31 states, 31 states have (on average 10.483870967741936) internal successors, (325), 30 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:09,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:09,147 INFO L93 Difference]: Finished difference Result 406832 states and 530678 transitions. [2024-10-11 03:48:09,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2024-10-11 03:48:09,147 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 10.483870967741936) internal successors, (325), 30 states have internal predecessors, (325), 0 states have call successors, (0), 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 129 [2024-10-11 03:48:09,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:10,088 INFO L225 Difference]: With dead ends: 406832 [2024-10-11 03:48:10,088 INFO L226 Difference]: Without dead ends: 351950 [2024-10-11 03:48:10,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20642 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=7062, Invalid=48398, Unknown=0, NotChecked=0, Total=55460 [2024-10-11 03:48:10,235 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 5946 mSDsluCounter, 5435 mSDsCounter, 0 mSdLazyCounter, 6328 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5946 SdHoareTripleChecker+Valid, 5787 SdHoareTripleChecker+Invalid, 6450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 6328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:10,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5946 Valid, 5787 Invalid, 6450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 6328 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 03:48:10,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351950 states. [2024-10-11 03:48:13,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351950 to 169985. [2024-10-11 03:48:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169985 states, 169984 states have (on average 1.2984575018825302) internal successors, (220717), 169984 states have internal predecessors, (220717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169985 states to 169985 states and 220717 transitions. [2024-10-11 03:48:13,804 INFO L78 Accepts]: Start accepts. Automaton has 169985 states and 220717 transitions. Word has length 129 [2024-10-11 03:48:13,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:13,804 INFO L471 AbstractCegarLoop]: Abstraction has 169985 states and 220717 transitions. [2024-10-11 03:48:13,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 10.483870967741936) internal successors, (325), 30 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 169985 states and 220717 transitions. [2024-10-11 03:48:13,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 03:48:13,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:13,828 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:48:13,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 03:48:14,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:48:14,029 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:14,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:14,030 INFO L85 PathProgramCache]: Analyzing trace with hash 210535506, now seen corresponding path program 1 times [2024-10-11 03:48:14,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:14,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503264921] [2024-10-11 03:48:14,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:14,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:14,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:14,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503264921] [2024-10-11 03:48:14,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503264921] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:48:14,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595339207] [2024-10-11 03:48:14,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:14,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:48:14,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:48:14,969 INFO L229 MonitoredProcess]: Starting monitored process 4 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:48:14,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:48:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:15,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-10-11 03:48:15,245 INFO L278 TraceCheckSpWp]: Computing forward predicates...