./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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52cbb0c1391c9e840599beece58e1ecbc8d18028ef540ea98f759da7158f4609 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:56:51,675 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:56:51,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:56:51,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:56:51,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:56:51,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:56:51,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:56:51,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:56:51,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:56:51,799 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:56:51,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:56:51,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:56:51,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:56:51,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:56:51,802 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:56:51,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:56:51,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:56:51,805 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:56:51,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:56:51,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:56:51,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:56:51,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:56:51,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:56:51,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:56:51,807 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:56:51,808 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:56:51,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:56:51,809 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:56:51,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:56:51,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:56:51,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:56:51,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:56:51,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:56:51,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:56:51,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:56:51,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:56:51,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:56:51,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:56:51,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:56:51,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:56:51,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:56:51,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:56:51,813 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52cbb0c1391c9e840599beece58e1ecbc8d18028ef540ea98f759da7158f4609 [2024-11-19 22:56:52,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:56:52,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:56:52,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:56:52,093 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:56:52,093 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:56:52,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-19 22:56:53,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:56:54,007 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:56:54,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-19 22:56:54,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae73e8dc/c43a32bacf6a40bd81e132388e54e1c2/FLAG3a7324a20 [2024-11-19 22:56:54,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae73e8dc/c43a32bacf6a40bd81e132388e54e1c2 [2024-11-19 22:56:54,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:56:54,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:56:54,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:56:54,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:56:54,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:56:54,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:56:54" (1/1) ... [2024-11-19 22:56:54,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@397758d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:56:54, skipping insertion in model container [2024-11-19 22:56:54,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:56:54" (1/1) ... [2024-11-19 22:56:54,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:56:54,632 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13531,13544] [2024-11-19 22:56:54,671 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18011,18024] [2024-11-19 22:56:54,680 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19303,19316] [2024-11-19 22:56:54,686 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20061,20074] [2024-11-19 22:56:54,696 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21681,21694] [2024-11-19 22:56:54,706 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22439,22452] [2024-11-19 22:56:54,723 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23525,23538] [2024-11-19 22:56:54,761 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26064,26077] [2024-11-19 22:56:54,771 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26825,26838] [2024-11-19 22:56:54,788 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27914,27927] [2024-11-19 22:56:54,796 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29919,29932] [2024-11-19 22:56:54,824 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33842,33855] [2024-11-19 22:56:54,828 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34603,34616] [2024-11-19 22:56:54,833 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35696,35709] [2024-11-19 22:56:54,841 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37705,37718] [2024-11-19 22:56:54,863 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41308,41321] [2024-11-19 22:56:54,897 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48185,48198] [2024-11-19 22:56:54,903 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48946,48959] [2024-11-19 22:56:54,927 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[50035,50048] [2024-11-19 22:56:54,938 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[52040,52053] [2024-11-19 22:56:54,954 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[55429,55442] [2024-11-19 22:56:55,013 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61126,61139] [2024-11-19 22:56:55,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:56:55,312 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:56:55,354 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13531,13544] [2024-11-19 22:56:55,364 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18011,18024] [2024-11-19 22:56:55,368 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19303,19316] [2024-11-19 22:56:55,372 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20061,20074] [2024-11-19 22:56:55,378 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21681,21694] [2024-11-19 22:56:55,381 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22439,22452] [2024-11-19 22:56:55,385 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23525,23538] [2024-11-19 22:56:55,392 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26064,26077] [2024-11-19 22:56:55,395 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26825,26838] [2024-11-19 22:56:55,399 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27914,27927] [2024-11-19 22:56:55,405 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29919,29932] [2024-11-19 22:56:55,416 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33842,33855] [2024-11-19 22:56:55,419 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34603,34616] [2024-11-19 22:56:55,423 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35696,35709] [2024-11-19 22:56:55,429 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37705,37718] [2024-11-19 22:56:55,441 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41308,41321] [2024-11-19 22:56:55,463 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48185,48198] [2024-11-19 22:56:55,466 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48946,48959] [2024-11-19 22:56:55,470 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[50035,50048] [2024-11-19 22:56:55,475 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[52040,52053] [2024-11-19 22:56:55,484 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[55429,55442] [2024-11-19 22:56:55,498 WARN L250 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61126,61139] [2024-11-19 22:56:55,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:56:55,713 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:56:55,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:56:55 WrapperNode [2024-11-19 22:56:55,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:56:55,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:56:55,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:56:55,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:56:55,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:56:55" (1/1) ... [2024-11-19 22:56:55,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:56:55" (1/1) ... [2024-11-19 22:56:55,893 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6748 [2024-11-19 22:56:55,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:56:55,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:56:55,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:56:55,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:56:55,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:56:55" (1/1) ... [2024-11-19 22:56:55,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:56:55" (1/1) ... [2024-11-19 22:56:55,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:56:55" (1/1) ... [2024-11-19 22:56:55,986 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-11-19 22:56:55,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:56:55" (1/1) ... [2024-11-19 22:56:55,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:56:55" (1/1) ... [2024-11-19 22:56:56,037 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:56:55" (1/1) ... [2024-11-19 22:56:56,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:56:55" (1/1) ... [2024-11-19 22:56:56,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:56:55" (1/1) ... [2024-11-19 22:56:56,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:56:55" (1/1) ... [2024-11-19 22:56:56,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:56:56,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:56:56,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:56:56,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:56:56,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:56:55" (1/1) ... [2024-11-19 22:56:56,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:56:56,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:56:56,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 22:56:56,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 22:56:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:56:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:56:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:56:56,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:56:56,496 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:56:56,498 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:56:59,568 INFO L? ?]: Removed 1001 outVars from TransFormulas that were not future-live. [2024-11-19 22:56:59,569 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:56:59,609 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:56:59,609 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 22:56:59,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:56:59 BoogieIcfgContainer [2024-11-19 22:56:59,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:56:59,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:56:59,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:56:59,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:56:59,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:56:54" (1/3) ... [2024-11-19 22:56:59,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4306a5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:56:59, skipping insertion in model container [2024-11-19 22:56:59,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:56:55" (2/3) ... [2024-11-19 22:56:59,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4306a5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:56:59, skipping insertion in model container [2024-11-19 22:56:59,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:56:59" (3/3) ... [2024-11-19 22:56:59,623 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-19 22:56:59,640 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:56:59,640 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-19 22:56:59,747 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:56:59,755 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;@227d5aa3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:56:59,755 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-19 22:56:59,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 1124 states, 1101 states have (on average 1.8601271571298819) internal successors, (2048), 1123 states have internal predecessors, (2048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:59,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 22:56:59,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:59,798 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] [2024-11-19 22:56:59,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:56:59,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:59,806 INFO L85 PathProgramCache]: Analyzing trace with hash -845723877, now seen corresponding path program 1 times [2024-11-19 22:56:59,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:59,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854464560] [2024-11-19 22:56:59,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:59,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:00,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:00,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854464560] [2024-11-19 22:57:00,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854464560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:00,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:00,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:57:00,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968824251] [2024-11-19 22:57:00,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:00,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:57:00,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:00,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:57:00,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:57:00,530 INFO L87 Difference]: Start difference. First operand has 1124 states, 1101 states have (on average 1.8601271571298819) internal successors, (2048), 1123 states have internal predecessors, (2048), 0 states have call successors, (0), 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 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:01,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:01,254 INFO L93 Difference]: Finished difference Result 1702 states and 2998 transitions. [2024-11-19 22:57:01,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:57:01,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-19 22:57:01,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:01,274 INFO L225 Difference]: With dead ends: 1702 [2024-11-19 22:57:01,275 INFO L226 Difference]: Without dead ends: 868 [2024-11-19 22:57:01,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:57:01,287 INFO L432 NwaCegarLoop]: 1027 mSDtfsCounter, 4494 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4494 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:01,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4494 Valid, 1041 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 22:57:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2024-11-19 22:57:01,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2024-11-19 22:57:01,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 846 states have (on average 1.3215130023640662) internal successors, (1118), 867 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1118 transitions. [2024-11-19 22:57:01,381 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1118 transitions. Word has length 85 [2024-11-19 22:57:01,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:01,382 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1118 transitions. [2024-11-19 22:57:01,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1118 transitions. [2024-11-19 22:57:01,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 22:57:01,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:01,387 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] [2024-11-19 22:57:01,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:57:01,388 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:01,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:01,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1932230466, now seen corresponding path program 1 times [2024-11-19 22:57:01,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:01,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427108866] [2024-11-19 22:57:01,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:01,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:01,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:01,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427108866] [2024-11-19 22:57:01,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427108866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:01,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:01,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:57:01,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858488421] [2024-11-19 22:57:01,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:01,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:57:01,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:01,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:57:01,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:57:01,667 INFO L87 Difference]: Start difference. First operand 868 states and 1118 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:02,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:02,185 INFO L93 Difference]: Finished difference Result 1437 states and 1906 transitions. [2024-11-19 22:57:02,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:57:02,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-19 22:57:02,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:02,190 INFO L225 Difference]: With dead ends: 1437 [2024-11-19 22:57:02,190 INFO L226 Difference]: Without dead ends: 764 [2024-11-19 22:57:02,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:57:02,192 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 2881 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2881 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:02,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2881 Valid, 564 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:57:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2024-11-19 22:57:02,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2024-11-19 22:57:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 742 states have (on average 1.34366576819407) internal successors, (997), 763 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 997 transitions. [2024-11-19 22:57:02,217 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 997 transitions. Word has length 86 [2024-11-19 22:57:02,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:02,219 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 997 transitions. [2024-11-19 22:57:02,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 997 transitions. [2024-11-19 22:57:02,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-19 22:57:02,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:02,225 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] [2024-11-19 22:57:02,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:57:02,225 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:02,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:02,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1627866598, now seen corresponding path program 1 times [2024-11-19 22:57:02,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:02,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717479639] [2024-11-19 22:57:02,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:02,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:02,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:02,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717479639] [2024-11-19 22:57:02,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717479639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:02,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:02,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:57:02,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857781423] [2024-11-19 22:57:02,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:02,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:57:02,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:02,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:57:02,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:57:02,486 INFO L87 Difference]: Start difference. First operand 764 states and 997 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:02,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:02,959 INFO L93 Difference]: Finished difference Result 1333 states and 1784 transitions. [2024-11-19 22:57:02,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:57:02,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-19 22:57:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:02,963 INFO L225 Difference]: With dead ends: 1333 [2024-11-19 22:57:02,964 INFO L226 Difference]: Without dead ends: 700 [2024-11-19 22:57:02,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:57:02,967 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 2680 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2680 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:02,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2680 Valid, 532 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:57:02,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-19 22:57:02,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2024-11-19 22:57:02,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 678 states have (on average 1.3628318584070795) internal successors, (924), 699 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 924 transitions. [2024-11-19 22:57:02,986 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 924 transitions. Word has length 87 [2024-11-19 22:57:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:02,987 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 924 transitions. [2024-11-19 22:57:02,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:02,988 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 924 transitions. [2024-11-19 22:57:02,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-19 22:57:02,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:02,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] [2024-11-19 22:57:02,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:57:02,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:02,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:02,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2037300131, now seen corresponding path program 1 times [2024-11-19 22:57:02,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:02,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976280136] [2024-11-19 22:57:02,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:02,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:03,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:03,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:03,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976280136] [2024-11-19 22:57:03,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976280136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:03,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:03,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:57:03,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465759785] [2024-11-19 22:57:03,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:03,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:57:03,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:03,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:57:03,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:57:03,195 INFO L87 Difference]: Start difference. First operand 700 states and 924 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:03,624 INFO L93 Difference]: Finished difference Result 1269 states and 1710 transitions. [2024-11-19 22:57:03,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:57:03,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-19 22:57:03,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:03,629 INFO L225 Difference]: With dead ends: 1269 [2024-11-19 22:57:03,630 INFO L226 Difference]: Without dead ends: 659 [2024-11-19 22:57:03,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:57:03,631 INFO L432 NwaCegarLoop]: 495 mSDtfsCounter, 2568 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2568 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:03,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2568 Valid, 507 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:57:03,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-19 22:57:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2024-11-19 22:57:03,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 637 states have (on average 1.3783359497645211) internal successors, (878), 658 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 878 transitions. [2024-11-19 22:57:03,650 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 878 transitions. Word has length 88 [2024-11-19 22:57:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:03,650 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 878 transitions. [2024-11-19 22:57:03,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 878 transitions. [2024-11-19 22:57:03,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 22:57:03,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:03,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:57:03,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:57:03,653 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:03,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1730545767, now seen corresponding path program 1 times [2024-11-19 22:57:03,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:03,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987570048] [2024-11-19 22:57:03,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:03,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:03,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:03,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:03,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987570048] [2024-11-19 22:57:03,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987570048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:03,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:03,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:57:03,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554185770] [2024-11-19 22:57:03,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:03,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:57:03,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:03,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:57:03,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:57:03,837 INFO L87 Difference]: Start difference. First operand 659 states and 878 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:04,282 INFO L93 Difference]: Finished difference Result 1228 states and 1663 transitions. [2024-11-19 22:57:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:57:04,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-11-19 22:57:04,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:04,286 INFO L225 Difference]: With dead ends: 1228 [2024-11-19 22:57:04,286 INFO L226 Difference]: Without dead ends: 640 [2024-11-19 22:57:04,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:57:04,288 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 2489 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2489 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:04,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2489 Valid, 496 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:57:04,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-19 22:57:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2024-11-19 22:57:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 618 states have (on average 1.3851132686084142) internal successors, (856), 639 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 856 transitions. [2024-11-19 22:57:04,301 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 856 transitions. Word has length 89 [2024-11-19 22:57:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:04,302 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 856 transitions. [2024-11-19 22:57:04,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 856 transitions. [2024-11-19 22:57:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-19 22:57:04,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:04,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:57:04,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:57:04,305 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:04,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash -593456260, now seen corresponding path program 1 times [2024-11-19 22:57:04,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:04,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85874863] [2024-11-19 22:57:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:04,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:04,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:04,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85874863] [2024-11-19 22:57:04,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85874863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:04,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:04,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:57:04,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001872555] [2024-11-19 22:57:04,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:04,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:57:04,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:04,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:57:04,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:57:04,473 INFO L87 Difference]: Start difference. First operand 640 states and 856 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:04,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:04,998 INFO L93 Difference]: Finished difference Result 1209 states and 1640 transitions. [2024-11-19 22:57:04,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:57:04,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-19 22:57:04,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:05,001 INFO L225 Difference]: With dead ends: 1209 [2024-11-19 22:57:05,002 INFO L226 Difference]: Without dead ends: 635 [2024-11-19 22:57:05,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:57:05,003 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 2407 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2407 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:05,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2407 Valid, 421 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:57:05,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-19 22:57:05,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2024-11-19 22:57:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3849918433931485) internal successors, (849), 634 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:05,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 849 transitions. [2024-11-19 22:57:05,016 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 849 transitions. Word has length 90 [2024-11-19 22:57:05,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:05,017 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 849 transitions. [2024-11-19 22:57:05,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:05,017 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 849 transitions. [2024-11-19 22:57:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 22:57:05,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:05,019 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] [2024-11-19 22:57:05,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:57:05,019 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:05,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:05,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1183984296, now seen corresponding path program 1 times [2024-11-19 22:57:05,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:05,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544097894] [2024-11-19 22:57:05,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:05,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:05,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:05,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544097894] [2024-11-19 22:57:05,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544097894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:05,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:05,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 22:57:05,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480165327] [2024-11-19 22:57:05,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:05,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 22:57:05,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:05,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 22:57:05,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:57:05,576 INFO L87 Difference]: Start difference. First operand 635 states and 849 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:07,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:07,081 INFO L93 Difference]: Finished difference Result 1077 states and 1446 transitions. [2024-11-19 22:57:07,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 22:57:07,081 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-19 22:57:07,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:07,087 INFO L225 Difference]: With dead ends: 1077 [2024-11-19 22:57:07,087 INFO L226 Difference]: Without dead ends: 969 [2024-11-19 22:57:07,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:57:07,089 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 2217 mSDsluCounter, 2406 mSDsCounter, 0 mSdLazyCounter, 2301 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2217 SdHoareTripleChecker+Valid, 2877 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:07,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2217 Valid, 2877 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2301 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 22:57:07,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2024-11-19 22:57:07,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 635. [2024-11-19 22:57:07,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3833605220228384) internal successors, (848), 634 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 848 transitions. [2024-11-19 22:57:07,106 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 848 transitions. Word has length 91 [2024-11-19 22:57:07,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:07,106 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 848 transitions. [2024-11-19 22:57:07,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:07,106 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 848 transitions. [2024-11-19 22:57:07,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 22:57:07,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:07,108 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] [2024-11-19 22:57:07,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:57:07,108 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:07,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:07,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1592829524, now seen corresponding path program 1 times [2024-11-19 22:57:07,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:07,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795959918] [2024-11-19 22:57:07,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:07,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:07,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:07,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795959918] [2024-11-19 22:57:07,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795959918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:07,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:07,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:57:07,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93968467] [2024-11-19 22:57:07,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:07,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 22:57:07,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:07,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 22:57:07,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:57:07,615 INFO L87 Difference]: Start difference. First operand 635 states and 848 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:08,694 INFO L93 Difference]: Finished difference Result 1197 states and 1556 transitions. [2024-11-19 22:57:08,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 22:57:08,695 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-19 22:57:08,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:08,699 INFO L225 Difference]: With dead ends: 1197 [2024-11-19 22:57:08,700 INFO L226 Difference]: Without dead ends: 852 [2024-11-19 22:57:08,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-19 22:57:08,702 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 3928 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3928 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:08,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3928 Valid, 1383 Invalid, 1524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 22:57:08,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2024-11-19 22:57:08,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 635. [2024-11-19 22:57:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3817292006525286) internal successors, (847), 634 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 847 transitions. [2024-11-19 22:57:08,714 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 847 transitions. Word has length 91 [2024-11-19 22:57:08,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:08,714 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 847 transitions. [2024-11-19 22:57:08,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 847 transitions. [2024-11-19 22:57:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 22:57:08,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:08,716 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] [2024-11-19 22:57:08,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:57:08,716 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:08,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:08,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1428942257, now seen corresponding path program 1 times [2024-11-19 22:57:08,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:08,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869361037] [2024-11-19 22:57:08,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:08,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:09,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:09,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:09,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869361037] [2024-11-19 22:57:09,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869361037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:09,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:09,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:57:09,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129635136] [2024-11-19 22:57:09,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:09,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:57:09,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:09,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:57:09,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:57:09,207 INFO L87 Difference]: Start difference. First operand 635 states and 847 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:10,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:10,762 INFO L93 Difference]: Finished difference Result 1069 states and 1415 transitions. [2024-11-19 22:57:10,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 22:57:10,763 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-19 22:57:10,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:10,766 INFO L225 Difference]: With dead ends: 1069 [2024-11-19 22:57:10,767 INFO L226 Difference]: Without dead ends: 990 [2024-11-19 22:57:10,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2024-11-19 22:57:10,768 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 4328 mSDsluCounter, 2314 mSDsCounter, 0 mSdLazyCounter, 2650 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4328 SdHoareTripleChecker+Valid, 2758 SdHoareTripleChecker+Invalid, 2663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:10,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4328 Valid, 2758 Invalid, 2663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2650 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 22:57:10,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-11-19 22:57:10,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 654. [2024-11-19 22:57:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 632 states have (on average 1.384493670886076) internal successors, (875), 653 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:10,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 875 transitions. [2024-11-19 22:57:10,783 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 875 transitions. Word has length 91 [2024-11-19 22:57:10,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:10,783 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 875 transitions. [2024-11-19 22:57:10,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:10,784 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 875 transitions. [2024-11-19 22:57:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 22:57:10,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:10,785 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] [2024-11-19 22:57:10,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:57:10,786 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:10,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:10,786 INFO L85 PathProgramCache]: Analyzing trace with hash 539897447, now seen corresponding path program 1 times [2024-11-19 22:57:10,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:10,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906565525] [2024-11-19 22:57:10,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:10,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:11,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:11,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906565525] [2024-11-19 22:57:11,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906565525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:11,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:11,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:11,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422872614] [2024-11-19 22:57:11,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:11,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:11,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:11,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:11,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:11,216 INFO L87 Difference]: Start difference. First operand 654 states and 875 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:12,718 INFO L93 Difference]: Finished difference Result 1175 states and 1585 transitions. [2024-11-19 22:57:12,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:57:12,719 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-19 22:57:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:12,723 INFO L225 Difference]: With dead ends: 1175 [2024-11-19 22:57:12,723 INFO L226 Difference]: Without dead ends: 983 [2024-11-19 22:57:12,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:57:12,725 INFO L432 NwaCegarLoop]: 730 mSDtfsCounter, 3430 mSDsluCounter, 2905 mSDsCounter, 0 mSdLazyCounter, 2835 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3430 SdHoareTripleChecker+Valid, 3635 SdHoareTripleChecker+Invalid, 2841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:12,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3430 Valid, 3635 Invalid, 2841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2835 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 22:57:12,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2024-11-19 22:57:12,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 635. [2024-11-19 22:57:12,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3800978792822185) internal successors, (846), 634 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 846 transitions. [2024-11-19 22:57:12,739 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 846 transitions. Word has length 91 [2024-11-19 22:57:12,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:12,739 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 846 transitions. [2024-11-19 22:57:12,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 846 transitions. [2024-11-19 22:57:12,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 22:57:12,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:12,741 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] [2024-11-19 22:57:12,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 22:57:12,742 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:12,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:12,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1459275419, now seen corresponding path program 1 times [2024-11-19 22:57:12,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:12,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926788494] [2024-11-19 22:57:12,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:12,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:13,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:13,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926788494] [2024-11-19 22:57:13,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926788494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:13,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:13,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:13,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475048331] [2024-11-19 22:57:13,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:13,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:13,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:13,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:13,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:13,180 INFO L87 Difference]: Start difference. First operand 635 states and 846 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:14,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:14,221 INFO L93 Difference]: Finished difference Result 1102 states and 1489 transitions. [2024-11-19 22:57:14,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:57:14,222 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-19 22:57:14,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:14,225 INFO L225 Difference]: With dead ends: 1102 [2024-11-19 22:57:14,225 INFO L226 Difference]: Without dead ends: 979 [2024-11-19 22:57:14,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:57:14,226 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 4307 mSDsluCounter, 1887 mSDsCounter, 0 mSdLazyCounter, 1933 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4307 SdHoareTripleChecker+Valid, 2453 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:14,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4307 Valid, 2453 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1933 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 22:57:14,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-11-19 22:57:14,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 635. [2024-11-19 22:57:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3784665579119086) internal successors, (845), 634 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:14,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 845 transitions. [2024-11-19 22:57:14,239 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 845 transitions. Word has length 91 [2024-11-19 22:57:14,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:14,239 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 845 transitions. [2024-11-19 22:57:14,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:14,240 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 845 transitions. [2024-11-19 22:57:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:57:14,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:14,241 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] [2024-11-19 22:57:14,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 22:57:14,242 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:14,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:14,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1749979053, now seen corresponding path program 1 times [2024-11-19 22:57:14,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:14,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109933151] [2024-11-19 22:57:14,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:14,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:14,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:14,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109933151] [2024-11-19 22:57:14,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109933151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:14,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:14,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:14,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444116701] [2024-11-19 22:57:14,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:14,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:14,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:14,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:14,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:14,572 INFO L87 Difference]: Start difference. First operand 635 states and 845 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:15,577 INFO L93 Difference]: Finished difference Result 1205 states and 1610 transitions. [2024-11-19 22:57:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:57:15,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-19 22:57:15,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:15,580 INFO L225 Difference]: With dead ends: 1205 [2024-11-19 22:57:15,581 INFO L226 Difference]: Without dead ends: 983 [2024-11-19 22:57:15,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:57:15,583 INFO L432 NwaCegarLoop]: 677 mSDtfsCounter, 3473 mSDsluCounter, 2212 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3473 SdHoareTripleChecker+Valid, 2889 SdHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:15,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3473 Valid, 2889 Invalid, 2261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 22:57:15,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2024-11-19 22:57:15,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 635. [2024-11-19 22:57:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3768352365415988) internal successors, (844), 634 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 844 transitions. [2024-11-19 22:57:15,595 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 844 transitions. Word has length 93 [2024-11-19 22:57:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:15,596 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 844 transitions. [2024-11-19 22:57:15,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 844 transitions. [2024-11-19 22:57:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:57:15,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:15,597 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] [2024-11-19 22:57:15,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 22:57:15,598 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:15,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:15,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2068984294, now seen corresponding path program 1 times [2024-11-19 22:57:15,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:15,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440912329] [2024-11-19 22:57:15,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:15,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:15,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:15,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:15,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440912329] [2024-11-19 22:57:15,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440912329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:15,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:15,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:15,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125156754] [2024-11-19 22:57:15,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:15,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:15,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:15,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:15,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:15,941 INFO L87 Difference]: Start difference. First operand 635 states and 844 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:17,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:17,084 INFO L93 Difference]: Finished difference Result 1070 states and 1434 transitions. [2024-11-19 22:57:17,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:57:17,084 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-19 22:57:17,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:17,087 INFO L225 Difference]: With dead ends: 1070 [2024-11-19 22:57:17,088 INFO L226 Difference]: Without dead ends: 971 [2024-11-19 22:57:17,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:57:17,089 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 4542 mSDsluCounter, 1691 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4542 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 1780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:17,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4542 Valid, 2197 Invalid, 1780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 22:57:17,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2024-11-19 22:57:17,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 635. [2024-11-19 22:57:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3752039151712887) internal successors, (843), 634 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 843 transitions. [2024-11-19 22:57:17,099 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 843 transitions. Word has length 93 [2024-11-19 22:57:17,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:17,099 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 843 transitions. [2024-11-19 22:57:17,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:17,100 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 843 transitions. [2024-11-19 22:57:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:57:17,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:17,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:57:17,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 22:57:17,101 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:17,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:17,102 INFO L85 PathProgramCache]: Analyzing trace with hash 928092964, now seen corresponding path program 1 times [2024-11-19 22:57:17,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:17,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207919414] [2024-11-19 22:57:17,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:17,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:17,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:17,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207919414] [2024-11-19 22:57:17,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207919414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:17,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:17,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:17,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392620934] [2024-11-19 22:57:17,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:17,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:17,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:17,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:17,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:17,440 INFO L87 Difference]: Start difference. First operand 635 states and 843 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:18,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:18,639 INFO L93 Difference]: Finished difference Result 1117 states and 1498 transitions. [2024-11-19 22:57:18,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:57:18,640 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-19 22:57:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:18,644 INFO L225 Difference]: With dead ends: 1117 [2024-11-19 22:57:18,644 INFO L226 Difference]: Without dead ends: 979 [2024-11-19 22:57:18,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:57:18,645 INFO L432 NwaCegarLoop]: 732 mSDtfsCounter, 3369 mSDsluCounter, 2385 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3369 SdHoareTripleChecker+Valid, 3117 SdHoareTripleChecker+Invalid, 2390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:18,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3369 Valid, 3117 Invalid, 2390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 22:57:18,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-11-19 22:57:18,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 635. [2024-11-19 22:57:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3735725938009788) internal successors, (842), 634 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 842 transitions. [2024-11-19 22:57:18,656 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 842 transitions. Word has length 93 [2024-11-19 22:57:18,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:18,656 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 842 transitions. [2024-11-19 22:57:18,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:18,656 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 842 transitions. [2024-11-19 22:57:18,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:57:18,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:18,658 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] [2024-11-19 22:57:18,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 22:57:18,658 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:18,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:18,658 INFO L85 PathProgramCache]: Analyzing trace with hash 538302253, now seen corresponding path program 1 times [2024-11-19 22:57:18,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:18,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627597008] [2024-11-19 22:57:18,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:18,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:18,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:18,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627597008] [2024-11-19 22:57:18,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627597008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:18,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:18,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:18,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289003298] [2024-11-19 22:57:18,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:18,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:18,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:18,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:18,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:18,960 INFO L87 Difference]: Start difference. First operand 635 states and 842 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:19,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:19,975 INFO L93 Difference]: Finished difference Result 1070 states and 1433 transitions. [2024-11-19 22:57:19,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:57:19,976 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-19 22:57:19,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:19,978 INFO L225 Difference]: With dead ends: 1070 [2024-11-19 22:57:19,978 INFO L226 Difference]: Without dead ends: 971 [2024-11-19 22:57:19,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:57:19,979 INFO L432 NwaCegarLoop]: 552 mSDtfsCounter, 3657 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 1903 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3657 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 1910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:19,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3657 Valid, 2383 Invalid, 1910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1903 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 22:57:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2024-11-19 22:57:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 635. [2024-11-19 22:57:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3719412724306688) internal successors, (841), 634 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 841 transitions. [2024-11-19 22:57:19,990 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 841 transitions. Word has length 93 [2024-11-19 22:57:19,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:19,990 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 841 transitions. [2024-11-19 22:57:19,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:19,990 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 841 transitions. [2024-11-19 22:57:19,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:57:19,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:19,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:57:19,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 22:57:19,992 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:19,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:19,993 INFO L85 PathProgramCache]: Analyzing trace with hash -350742557, now seen corresponding path program 1 times [2024-11-19 22:57:19,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:19,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851414821] [2024-11-19 22:57:19,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:19,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:20,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:20,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851414821] [2024-11-19 22:57:20,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851414821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:20,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:20,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:20,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743561205] [2024-11-19 22:57:20,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:20,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:20,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:20,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:20,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:20,276 INFO L87 Difference]: Start difference. First operand 635 states and 841 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:21,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:21,392 INFO L93 Difference]: Finished difference Result 1117 states and 1498 transitions. [2024-11-19 22:57:21,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:57:21,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-19 22:57:21,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:21,395 INFO L225 Difference]: With dead ends: 1117 [2024-11-19 22:57:21,395 INFO L226 Difference]: Without dead ends: 979 [2024-11-19 22:57:21,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:57:21,396 INFO L432 NwaCegarLoop]: 677 mSDtfsCounter, 2293 mSDsluCounter, 2217 mSDsCounter, 0 mSdLazyCounter, 2211 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2293 SdHoareTripleChecker+Valid, 2894 SdHoareTripleChecker+Invalid, 2217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:21,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2293 Valid, 2894 Invalid, 2217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2211 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 22:57:21,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-11-19 22:57:21,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 635. [2024-11-19 22:57:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.370309951060359) internal successors, (840), 634 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 840 transitions. [2024-11-19 22:57:21,406 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 840 transitions. Word has length 93 [2024-11-19 22:57:21,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:21,406 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 840 transitions. [2024-11-19 22:57:21,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 840 transitions. [2024-11-19 22:57:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:57:21,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:21,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:57:21,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 22:57:21,409 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:21,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:21,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1779757049, now seen corresponding path program 1 times [2024-11-19 22:57:21,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:21,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370405843] [2024-11-19 22:57:21,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:21,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:21,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:21,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:21,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370405843] [2024-11-19 22:57:21,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370405843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:21,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:21,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:21,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442807445] [2024-11-19 22:57:21,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:21,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:21,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:21,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:21,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:21,821 INFO L87 Difference]: Start difference. First operand 635 states and 840 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:22,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:22,863 INFO L93 Difference]: Finished difference Result 1064 states and 1425 transitions. [2024-11-19 22:57:22,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:57:22,863 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-19 22:57:22,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:22,866 INFO L225 Difference]: With dead ends: 1064 [2024-11-19 22:57:22,866 INFO L226 Difference]: Without dead ends: 971 [2024-11-19 22:57:22,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:57:22,867 INFO L432 NwaCegarLoop]: 601 mSDtfsCounter, 2781 mSDsluCounter, 2238 mSDsCounter, 0 mSdLazyCounter, 2225 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2781 SdHoareTripleChecker+Valid, 2839 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:22,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2781 Valid, 2839 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2225 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 22:57:22,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2024-11-19 22:57:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 635. [2024-11-19 22:57:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3686786296900488) internal successors, (839), 634 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 839 transitions. [2024-11-19 22:57:22,877 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 839 transitions. Word has length 93 [2024-11-19 22:57:22,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:22,877 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 839 transitions. [2024-11-19 22:57:22,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:22,878 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 839 transitions. [2024-11-19 22:57:22,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:57:22,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:22,879 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] [2024-11-19 22:57:22,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 22:57:22,880 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:22,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:22,880 INFO L85 PathProgramCache]: Analyzing trace with hash 162924990, now seen corresponding path program 1 times [2024-11-19 22:57:22,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:22,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90288792] [2024-11-19 22:57:22,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:22,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:23,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:23,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90288792] [2024-11-19 22:57:23,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90288792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:23,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:23,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:23,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32313033] [2024-11-19 22:57:23,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:23,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:23,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:23,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:23,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:23,157 INFO L87 Difference]: Start difference. First operand 635 states and 839 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:24,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:24,075 INFO L93 Difference]: Finished difference Result 1041 states and 1382 transitions. [2024-11-19 22:57:24,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:57:24,075 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-19 22:57:24,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:24,077 INFO L225 Difference]: With dead ends: 1041 [2024-11-19 22:57:24,077 INFO L226 Difference]: Without dead ends: 955 [2024-11-19 22:57:24,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:57:24,082 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 3159 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3159 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:24,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3159 Valid, 2299 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 22:57:24,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-11-19 22:57:24,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 635. [2024-11-19 22:57:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.367047308319739) internal successors, (838), 634 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 838 transitions. [2024-11-19 22:57:24,092 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 838 transitions. Word has length 93 [2024-11-19 22:57:24,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:24,092 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 838 transitions. [2024-11-19 22:57:24,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 838 transitions. [2024-11-19 22:57:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:57:24,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:24,094 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-11-19 22:57:24,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 22:57:24,094 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:24,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:24,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1469844906, now seen corresponding path program 1 times [2024-11-19 22:57:24,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:24,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962949034] [2024-11-19 22:57:24,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:24,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:24,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:24,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:24,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962949034] [2024-11-19 22:57:24,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962949034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:24,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:24,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:24,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006986166] [2024-11-19 22:57:24,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:24,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:24,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:24,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:24,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:24,399 INFO L87 Difference]: Start difference. First operand 635 states and 838 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:25,392 INFO L93 Difference]: Finished difference Result 1041 states and 1381 transitions. [2024-11-19 22:57:25,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:57:25,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:25,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:25,395 INFO L225 Difference]: With dead ends: 1041 [2024-11-19 22:57:25,395 INFO L226 Difference]: Without dead ends: 955 [2024-11-19 22:57:25,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:57:25,396 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 2889 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 2019 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2889 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:25,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2889 Valid, 2553 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2019 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 22:57:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-11-19 22:57:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 635. [2024-11-19 22:57:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3654159869494291) internal successors, (837), 634 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:25,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 837 transitions. [2024-11-19 22:57:25,404 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 837 transitions. Word has length 95 [2024-11-19 22:57:25,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:25,405 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 837 transitions. [2024-11-19 22:57:25,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 837 transitions. [2024-11-19 22:57:25,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:57:25,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:25,407 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-11-19 22:57:25,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 22:57:25,407 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:25,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:25,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2020844490, now seen corresponding path program 1 times [2024-11-19 22:57:25,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:25,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414882626] [2024-11-19 22:57:25,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:25,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:25,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:25,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414882626] [2024-11-19 22:57:25,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414882626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:25,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:25,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:25,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117163473] [2024-11-19 22:57:25,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:25,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:25,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:25,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:25,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:25,669 INFO L87 Difference]: Start difference. First operand 635 states and 837 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:26,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:26,584 INFO L93 Difference]: Finished difference Result 1002 states and 1315 transitions. [2024-11-19 22:57:26,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:57:26,585 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:26,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:26,587 INFO L225 Difference]: With dead ends: 1002 [2024-11-19 22:57:26,587 INFO L226 Difference]: Without dead ends: 923 [2024-11-19 22:57:26,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:57:26,587 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 2239 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2239 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:26,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2239 Valid, 1939 Invalid, 1626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1620 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 22:57:26,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-19 22:57:26,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 635. [2024-11-19 22:57:26,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.363784665579119) internal successors, (836), 634 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:26,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 836 transitions. [2024-11-19 22:57:26,596 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 836 transitions. Word has length 95 [2024-11-19 22:57:26,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:26,597 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 836 transitions. [2024-11-19 22:57:26,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:26,597 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 836 transitions. [2024-11-19 22:57:26,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:57:26,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:26,598 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-11-19 22:57:26,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 22:57:26,599 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:26,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:26,599 INFO L85 PathProgramCache]: Analyzing trace with hash -108647388, now seen corresponding path program 1 times [2024-11-19 22:57:26,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:26,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028787339] [2024-11-19 22:57:26,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:26,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:27,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:27,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:27,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028787339] [2024-11-19 22:57:27,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028787339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:27,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:27,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:57:27,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287486637] [2024-11-19 22:57:27,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:27,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:57:27,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:27,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:57:27,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:57:27,090 INFO L87 Difference]: Start difference. First operand 635 states and 836 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 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-11-19 22:57:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:28,726 INFO L93 Difference]: Finished difference Result 1434 states and 1948 transitions. [2024-11-19 22:57:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 22:57:28,726 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 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-11-19 22:57:28,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:28,730 INFO L225 Difference]: With dead ends: 1434 [2024-11-19 22:57:28,730 INFO L226 Difference]: Without dead ends: 1281 [2024-11-19 22:57:28,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:57:28,731 INFO L432 NwaCegarLoop]: 697 mSDtfsCounter, 6494 mSDsluCounter, 2619 mSDsCounter, 0 mSdLazyCounter, 2680 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6494 SdHoareTripleChecker+Valid, 3316 SdHoareTripleChecker+Invalid, 2886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 2680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:28,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6494 Valid, 3316 Invalid, 2886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 2680 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 22:57:28,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2024-11-19 22:57:28,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 639. [2024-11-19 22:57:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.3614262560777959) internal successors, (840), 638 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:28,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 840 transitions. [2024-11-19 22:57:28,741 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 840 transitions. Word has length 95 [2024-11-19 22:57:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:28,742 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 840 transitions. [2024-11-19 22:57:28,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 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-11-19 22:57:28,742 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 840 transitions. [2024-11-19 22:57:28,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:57:28,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:28,743 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-11-19 22:57:28,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 22:57:28,744 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:28,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:28,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1920722797, now seen corresponding path program 1 times [2024-11-19 22:57:28,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:28,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338539858] [2024-11-19 22:57:28,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:28,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:29,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:29,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:29,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338539858] [2024-11-19 22:57:29,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338539858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:29,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:29,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:29,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077507593] [2024-11-19 22:57:29,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:29,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:29,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:29,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:29,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:29,056 INFO L87 Difference]: Start difference. First operand 639 states and 840 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:30,217 INFO L93 Difference]: Finished difference Result 1041 states and 1379 transitions. [2024-11-19 22:57:30,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:57:30,218 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:30,221 INFO L225 Difference]: With dead ends: 1041 [2024-11-19 22:57:30,221 INFO L226 Difference]: Without dead ends: 959 [2024-11-19 22:57:30,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:57:30,222 INFO L432 NwaCegarLoop]: 590 mSDtfsCounter, 3601 mSDsluCounter, 2407 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3601 SdHoareTripleChecker+Valid, 2997 SdHoareTripleChecker+Invalid, 2375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:30,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3601 Valid, 2997 Invalid, 2375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 22:57:30,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-11-19 22:57:30,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 639. [2024-11-19 22:57:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.359805510534846) internal successors, (839), 638 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 839 transitions. [2024-11-19 22:57:30,231 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 839 transitions. Word has length 95 [2024-11-19 22:57:30,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:30,232 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 839 transitions. [2024-11-19 22:57:30,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:30,232 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 839 transitions. [2024-11-19 22:57:30,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:57:30,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:30,233 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-11-19 22:57:30,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 22:57:30,234 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:30,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:30,234 INFO L85 PathProgramCache]: Analyzing trace with hash -523524958, now seen corresponding path program 1 times [2024-11-19 22:57:30,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:30,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014438596] [2024-11-19 22:57:30,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:30,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:30,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:30,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014438596] [2024-11-19 22:57:30,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014438596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:30,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:30,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:57:30,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511703015] [2024-11-19 22:57:30,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:30,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:57:30,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:30,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:57:30,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:57:30,834 INFO L87 Difference]: Start difference. First operand 639 states and 839 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 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-11-19 22:57:32,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:32,273 INFO L93 Difference]: Finished difference Result 1267 states and 1707 transitions. [2024-11-19 22:57:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 22:57:32,273 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 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-11-19 22:57:32,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:32,277 INFO L225 Difference]: With dead ends: 1267 [2024-11-19 22:57:32,278 INFO L226 Difference]: Without dead ends: 1181 [2024-11-19 22:57:32,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:57:32,279 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 5591 mSDsluCounter, 2139 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5591 SdHoareTripleChecker+Valid, 2726 SdHoareTripleChecker+Invalid, 2499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:32,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5591 Valid, 2726 Invalid, 2499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 22:57:32,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2024-11-19 22:57:32,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 643. [2024-11-19 22:57:32,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 621 states have (on average 1.357487922705314) internal successors, (843), 642 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:32,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 843 transitions. [2024-11-19 22:57:32,289 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 843 transitions. Word has length 95 [2024-11-19 22:57:32,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:32,290 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 843 transitions. [2024-11-19 22:57:32,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 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-11-19 22:57:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 843 transitions. [2024-11-19 22:57:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:57:32,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:32,292 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-11-19 22:57:32,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 22:57:32,292 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:32,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:32,293 INFO L85 PathProgramCache]: Analyzing trace with hash -891627133, now seen corresponding path program 1 times [2024-11-19 22:57:32,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:32,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304077309] [2024-11-19 22:57:32,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:32,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:32,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:32,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304077309] [2024-11-19 22:57:32,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304077309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:32,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:32,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:32,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344747580] [2024-11-19 22:57:32,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:32,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:32,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:32,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:32,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:32,631 INFO L87 Difference]: Start difference. First operand 643 states and 843 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:33,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:33,647 INFO L93 Difference]: Finished difference Result 1045 states and 1380 transitions. [2024-11-19 22:57:33,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:57:33,647 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:33,649 INFO L225 Difference]: With dead ends: 1045 [2024-11-19 22:57:33,649 INFO L226 Difference]: Without dead ends: 959 [2024-11-19 22:57:33,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:57:33,650 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 3610 mSDsluCounter, 2383 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3610 SdHoareTripleChecker+Valid, 2965 SdHoareTripleChecker+Invalid, 2340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:33,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3610 Valid, 2965 Invalid, 2340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 22:57:33,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-11-19 22:57:33,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 643. [2024-11-19 22:57:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 621 states have (on average 1.355877616747182) internal successors, (842), 642 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 842 transitions. [2024-11-19 22:57:33,658 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 842 transitions. Word has length 95 [2024-11-19 22:57:33,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:33,658 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 842 transitions. [2024-11-19 22:57:33,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 842 transitions. [2024-11-19 22:57:33,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:57:33,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:33,660 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-11-19 22:57:33,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 22:57:33,661 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:33,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:33,662 INFO L85 PathProgramCache]: Analyzing trace with hash -482781905, now seen corresponding path program 1 times [2024-11-19 22:57:33,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:33,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968722384] [2024-11-19 22:57:33,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:33,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:34,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-11-19 22:57:34,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:34,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968722384] [2024-11-19 22:57:34,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968722384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:34,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:34,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:57:34,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429404534] [2024-11-19 22:57:34,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:34,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:57:34,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:34,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:57:34,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:57:34,176 INFO L87 Difference]: Start difference. First operand 643 states and 842 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 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-11-19 22:57:35,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:35,695 INFO L93 Difference]: Finished difference Result 1349 states and 1822 transitions. [2024-11-19 22:57:35,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 22:57:35,696 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 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-11-19 22:57:35,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:35,700 INFO L225 Difference]: With dead ends: 1349 [2024-11-19 22:57:35,700 INFO L226 Difference]: Without dead ends: 1241 [2024-11-19 22:57:35,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:57:35,701 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 7405 mSDsluCounter, 2712 mSDsCounter, 0 mSdLazyCounter, 2668 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7405 SdHoareTripleChecker+Valid, 3299 SdHoareTripleChecker+Invalid, 2887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 2668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:35,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7405 Valid, 3299 Invalid, 2887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 2668 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 22:57:35,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2024-11-19 22:57:35,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 647. [2024-11-19 22:57:35,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 625 states have (on average 1.3536) internal successors, (846), 646 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:35,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 846 transitions. [2024-11-19 22:57:35,713 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 846 transitions. Word has length 95 [2024-11-19 22:57:35,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:35,713 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 846 transitions. [2024-11-19 22:57:35,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 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-11-19 22:57:35,713 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 846 transitions. [2024-11-19 22:57:35,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:57:35,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:35,715 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-11-19 22:57:35,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 22:57:35,715 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:35,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1112928597, now seen corresponding path program 1 times [2024-11-19 22:57:35,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:35,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269611452] [2024-11-19 22:57:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:35,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:36,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:36,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269611452] [2024-11-19 22:57:36,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269611452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:36,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:36,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:57:36,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166378187] [2024-11-19 22:57:36,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:36,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:57:36,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:36,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:57:36,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:57:36,193 INFO L87 Difference]: Start difference. First operand 647 states and 846 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 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-11-19 22:57:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:37,523 INFO L93 Difference]: Finished difference Result 1271 states and 1710 transitions. [2024-11-19 22:57:37,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 22:57:37,523 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 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-11-19 22:57:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:37,527 INFO L225 Difference]: With dead ends: 1271 [2024-11-19 22:57:37,527 INFO L226 Difference]: Without dead ends: 1185 [2024-11-19 22:57:37,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:57:37,528 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 7710 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7710 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 2230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:37,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7710 Valid, 2450 Invalid, 2230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1988 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 22:57:37,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2024-11-19 22:57:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 651. [2024-11-19 22:57:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 629 states have (on average 1.3513513513513513) internal successors, (850), 650 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 850 transitions. [2024-11-19 22:57:37,537 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 850 transitions. Word has length 95 [2024-11-19 22:57:37,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:37,537 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 850 transitions. [2024-11-19 22:57:37,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 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-11-19 22:57:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 850 transitions. [2024-11-19 22:57:37,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:57:37,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:37,539 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-11-19 22:57:37,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 22:57:37,540 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:37,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:37,540 INFO L85 PathProgramCache]: Analyzing trace with hash -738270563, now seen corresponding path program 1 times [2024-11-19 22:57:37,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:37,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350147660] [2024-11-19 22:57:37,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:37,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:37,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:37,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350147660] [2024-11-19 22:57:37,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350147660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:37,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:37,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:37,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953235621] [2024-11-19 22:57:37,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:37,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:37,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:37,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:37,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:37,829 INFO L87 Difference]: Start difference. First operand 651 states and 850 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:38,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:38,790 INFO L93 Difference]: Finished difference Result 1045 states and 1379 transitions. [2024-11-19 22:57:38,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:57:38,790 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:38,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:38,793 INFO L225 Difference]: With dead ends: 1045 [2024-11-19 22:57:38,793 INFO L226 Difference]: Without dead ends: 963 [2024-11-19 22:57:38,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:57:38,793 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 3712 mSDsluCounter, 2217 mSDsCounter, 0 mSdLazyCounter, 2124 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3712 SdHoareTripleChecker+Valid, 2743 SdHoareTripleChecker+Invalid, 2131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:38,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3712 Valid, 2743 Invalid, 2131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2124 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 22:57:38,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-19 22:57:38,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 651. [2024-11-19 22:57:38,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 629 states have (on average 1.3497615262321145) internal successors, (849), 650 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 849 transitions. [2024-11-19 22:57:38,799 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 849 transitions. Word has length 95 [2024-11-19 22:57:38,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:38,799 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 849 transitions. [2024-11-19 22:57:38,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:38,800 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 849 transitions. [2024-11-19 22:57:38,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:57:38,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:38,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 22:57:38,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 22:57:38,801 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:38,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:38,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1153671650, now seen corresponding path program 1 times [2024-11-19 22:57:38,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:38,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882517996] [2024-11-19 22:57:38,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:38,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:39,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:39,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882517996] [2024-11-19 22:57:39,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882517996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:39,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:39,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:39,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441014445] [2024-11-19 22:57:39,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:39,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:39,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:39,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:39,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:39,043 INFO L87 Difference]: Start difference. First operand 651 states and 849 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:39,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:39,994 INFO L93 Difference]: Finished difference Result 1091 states and 1440 transitions. [2024-11-19 22:57:39,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:57:39,998 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:39,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:40,004 INFO L225 Difference]: With dead ends: 1091 [2024-11-19 22:57:40,004 INFO L226 Difference]: Without dead ends: 983 [2024-11-19 22:57:40,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:57:40,005 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 2849 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2849 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 2135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:40,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2849 Valid, 2648 Invalid, 2135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2129 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 22:57:40,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2024-11-19 22:57:40,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 651. [2024-11-19 22:57:40,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 629 states have (on average 1.3481717011128775) internal successors, (848), 650 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:40,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 848 transitions. [2024-11-19 22:57:40,017 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 848 transitions. Word has length 95 [2024-11-19 22:57:40,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:40,018 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 848 transitions. [2024-11-19 22:57:40,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:40,018 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 848 transitions. [2024-11-19 22:57:40,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:57:40,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:40,020 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-11-19 22:57:40,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 22:57:40,020 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:40,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:40,020 INFO L85 PathProgramCache]: Analyzing trace with hash 744826422, now seen corresponding path program 1 times [2024-11-19 22:57:40,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:40,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999526440] [2024-11-19 22:57:40,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:40,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:40,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:40,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:40,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999526440] [2024-11-19 22:57:40,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999526440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:40,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:40,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:40,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784812407] [2024-11-19 22:57:40,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:40,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:40,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:40,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:40,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:40,296 INFO L87 Difference]: Start difference. First operand 651 states and 848 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:41,306 INFO L93 Difference]: Finished difference Result 1049 states and 1381 transitions. [2024-11-19 22:57:41,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:57:41,306 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:41,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:41,308 INFO L225 Difference]: With dead ends: 1049 [2024-11-19 22:57:41,308 INFO L226 Difference]: Without dead ends: 963 [2024-11-19 22:57:41,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:57:41,309 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 3565 mSDsluCounter, 2446 mSDsCounter, 0 mSdLazyCounter, 2355 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3565 SdHoareTripleChecker+Valid, 3049 SdHoareTripleChecker+Invalid, 2361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:41,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3565 Valid, 3049 Invalid, 2361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2355 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 22:57:41,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-19 22:57:41,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 651. [2024-11-19 22:57:41,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 629 states have (on average 1.3465818759936408) internal successors, (847), 650 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 847 transitions. [2024-11-19 22:57:41,320 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 847 transitions. Word has length 95 [2024-11-19 22:57:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:41,320 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 847 transitions. [2024-11-19 22:57:41,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 847 transitions. [2024-11-19 22:57:41,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:57:41,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:41,323 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-11-19 22:57:41,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 22:57:41,324 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:41,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:41,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1037319048, now seen corresponding path program 1 times [2024-11-19 22:57:41,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:41,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072433385] [2024-11-19 22:57:41,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:41,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:41,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:41,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072433385] [2024-11-19 22:57:41,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072433385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:41,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:41,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:41,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094028112] [2024-11-19 22:57:41,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:41,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:41,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:41,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:41,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:41,537 INFO L87 Difference]: Start difference. First operand 651 states and 847 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:42,338 INFO L93 Difference]: Finished difference Result 1015 states and 1322 transitions. [2024-11-19 22:57:42,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:57:42,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:42,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:42,340 INFO L225 Difference]: With dead ends: 1015 [2024-11-19 22:57:42,340 INFO L226 Difference]: Without dead ends: 939 [2024-11-19 22:57:42,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:57:42,341 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 3241 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 1691 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3241 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:42,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3241 Valid, 2048 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1691 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 22:57:42,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2024-11-19 22:57:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 651. [2024-11-19 22:57:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 629 states have (on average 1.3449920508744038) internal successors, (846), 650 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 846 transitions. [2024-11-19 22:57:42,348 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 846 transitions. Word has length 95 [2024-11-19 22:57:42,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:42,348 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 846 transitions. [2024-11-19 22:57:42,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 846 transitions. [2024-11-19 22:57:42,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:57:42,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 22:57:42,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 22:57:42,350 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:42,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:42,350 INFO L85 PathProgramCache]: Analyzing trace with hash -359034935, now seen corresponding path program 1 times [2024-11-19 22:57:42,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:42,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597419773] [2024-11-19 22:57:42,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:42,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:42,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:42,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597419773] [2024-11-19 22:57:42,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597419773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:42,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:42,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:42,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057739548] [2024-11-19 22:57:42,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:42,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:42,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:42,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:42,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:42,617 INFO L87 Difference]: Start difference. First operand 651 states and 846 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:43,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:43,477 INFO L93 Difference]: Finished difference Result 1043 states and 1372 transitions. [2024-11-19 22:57:43,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:57:43,477 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:43,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:43,479 INFO L225 Difference]: With dead ends: 1043 [2024-11-19 22:57:43,479 INFO L226 Difference]: Without dead ends: 963 [2024-11-19 22:57:43,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:57:43,480 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 3618 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3618 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:43,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3618 Valid, 2344 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 22:57:43,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-19 22:57:43,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 651. [2024-11-19 22:57:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 629 states have (on average 1.343402225755167) internal successors, (845), 650 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 845 transitions. [2024-11-19 22:57:43,488 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 845 transitions. Word has length 95 [2024-11-19 22:57:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:43,488 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 845 transitions. [2024-11-19 22:57:43,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 845 transitions. [2024-11-19 22:57:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:57:43,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:43,490 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-11-19 22:57:43,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 22:57:43,490 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:43,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:43,490 INFO L85 PathProgramCache]: Analyzing trace with hash 933080142, now seen corresponding path program 1 times [2024-11-19 22:57:43,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:43,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482402747] [2024-11-19 22:57:43,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:43,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:43,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:43,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:43,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482402747] [2024-11-19 22:57:43,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482402747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:43,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:43,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:43,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140150771] [2024-11-19 22:57:43,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:43,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:43,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:43,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:43,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:43,728 INFO L87 Difference]: Start difference. First operand 651 states and 845 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:44,663 INFO L93 Difference]: Finished difference Result 1082 states and 1424 transitions. [2024-11-19 22:57:44,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:57:44,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:44,666 INFO L225 Difference]: With dead ends: 1082 [2024-11-19 22:57:44,666 INFO L226 Difference]: Without dead ends: 983 [2024-11-19 22:57:44,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:57:44,667 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 2688 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2688 SdHoareTripleChecker+Valid, 2940 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:44,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2688 Valid, 2940 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 22:57:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2024-11-19 22:57:44,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 651. [2024-11-19 22:57:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 629 states have (on average 1.34181240063593) internal successors, (844), 650 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 844 transitions. [2024-11-19 22:57:44,675 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 844 transitions. Word has length 95 [2024-11-19 22:57:44,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:44,676 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 844 transitions. [2024-11-19 22:57:44,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:44,676 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 844 transitions. [2024-11-19 22:57:44,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:57:44,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:44,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, 1, 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-11-19 22:57:44,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 22:57:44,677 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:44,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:44,678 INFO L85 PathProgramCache]: Analyzing trace with hash -698776940, now seen corresponding path program 1 times [2024-11-19 22:57:44,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:44,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476124629] [2024-11-19 22:57:44,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:44,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:44,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:44,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476124629] [2024-11-19 22:57:44,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476124629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:44,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:44,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:44,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915145916] [2024-11-19 22:57:44,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:44,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:44,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:44,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:44,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:44,956 INFO L87 Difference]: Start difference. First operand 651 states and 844 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:46,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:46,071 INFO L93 Difference]: Finished difference Result 1045 states and 1372 transitions. [2024-11-19 22:57:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:57:46,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:46,073 INFO L225 Difference]: With dead ends: 1045 [2024-11-19 22:57:46,073 INFO L226 Difference]: Without dead ends: 963 [2024-11-19 22:57:46,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:57:46,074 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 3614 mSDsluCounter, 2334 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3614 SdHoareTripleChecker+Valid, 2899 SdHoareTripleChecker+Invalid, 2224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:46,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3614 Valid, 2899 Invalid, 2224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2217 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 22:57:46,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-19 22:57:46,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 651. [2024-11-19 22:57:46,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 629 states have (on average 1.3402225755166932) internal successors, (843), 650 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 843 transitions. [2024-11-19 22:57:46,084 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 843 transitions. Word has length 95 [2024-11-19 22:57:46,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:46,085 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 843 transitions. [2024-11-19 22:57:46,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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-11-19 22:57:46,085 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 843 transitions. [2024-11-19 22:57:46,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 22:57:46,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:46,086 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-11-19 22:57:46,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 22:57:46,086 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:46,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:46,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1717932859, now seen corresponding path program 1 times [2024-11-19 22:57:46,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:46,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178320594] [2024-11-19 22:57:46,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:46,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:46,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:46,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178320594] [2024-11-19 22:57:46,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178320594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:46,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:46,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:46,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906313121] [2024-11-19 22:57:46,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:46,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:46,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:46,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:46,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:46,296 INFO L87 Difference]: Start difference. First operand 651 states and 843 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 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-11-19 22:57:47,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:47,191 INFO L93 Difference]: Finished difference Result 1049 states and 1374 transitions. [2024-11-19 22:57:47,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:57:47,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 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-11-19 22:57:47,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:47,193 INFO L225 Difference]: With dead ends: 1049 [2024-11-19 22:57:47,193 INFO L226 Difference]: Without dead ends: 963 [2024-11-19 22:57:47,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2024-11-19 22:57:47,194 INFO L432 NwaCegarLoop]: 570 mSDtfsCounter, 4034 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 1898 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4034 SdHoareTripleChecker+Valid, 2423 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:47,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4034 Valid, 2423 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1898 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 22:57:47,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-19 22:57:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 647. [2024-11-19 22:57:47,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 625 states have (on average 1.3408) internal successors, (838), 646 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:47,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 838 transitions. [2024-11-19 22:57:47,200 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 838 transitions. Word has length 96 [2024-11-19 22:57:47,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:47,200 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 838 transitions. [2024-11-19 22:57:47,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 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-11-19 22:57:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 838 transitions. [2024-11-19 22:57:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 22:57:47,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:47,201 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-11-19 22:57:47,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 22:57:47,202 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:47,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:47,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1514074373, now seen corresponding path program 1 times [2024-11-19 22:57:47,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:47,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524627745] [2024-11-19 22:57:47,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:47,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:47,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:47,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524627745] [2024-11-19 22:57:47,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524627745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:47,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:47,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:47,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635837747] [2024-11-19 22:57:47,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:47,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:47,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:47,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:47,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:47,390 INFO L87 Difference]: Start difference. First operand 647 states and 838 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 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-11-19 22:57:48,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:48,192 INFO L93 Difference]: Finished difference Result 940 states and 1204 transitions. [2024-11-19 22:57:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:57:48,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 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-11-19 22:57:48,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:48,194 INFO L225 Difference]: With dead ends: 940 [2024-11-19 22:57:48,194 INFO L226 Difference]: Without dead ends: 935 [2024-11-19 22:57:48,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:57:48,195 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 4146 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4146 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:48,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4146 Valid, 2123 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 22:57:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2024-11-19 22:57:48,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 647. [2024-11-19 22:57:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 625 states have (on average 1.3392) internal successors, (837), 646 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 837 transitions. [2024-11-19 22:57:48,202 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 837 transitions. Word has length 96 [2024-11-19 22:57:48,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:48,202 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 837 transitions. [2024-11-19 22:57:48,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 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-11-19 22:57:48,203 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 837 transitions. [2024-11-19 22:57:48,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 22:57:48,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:48,204 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-11-19 22:57:48,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 22:57:48,204 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:48,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:48,204 INFO L85 PathProgramCache]: Analyzing trace with hash 398122729, now seen corresponding path program 1 times [2024-11-19 22:57:48,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:48,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739778232] [2024-11-19 22:57:48,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:48,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:48,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:48,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:48,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739778232] [2024-11-19 22:57:48,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739778232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:48,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:48,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:48,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137169582] [2024-11-19 22:57:48,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:48,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:48,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:48,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:48,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:48,473 INFO L87 Difference]: Start difference. First operand 647 states and 837 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 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-11-19 22:57:49,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:49,431 INFO L93 Difference]: Finished difference Result 1087 states and 1420 transitions. [2024-11-19 22:57:49,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:57:49,431 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 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-11-19 22:57:49,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:49,432 INFO L225 Difference]: With dead ends: 1087 [2024-11-19 22:57:49,433 INFO L226 Difference]: Without dead ends: 979 [2024-11-19 22:57:49,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2024-11-19 22:57:49,433 INFO L432 NwaCegarLoop]: 597 mSDtfsCounter, 3962 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 1952 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3962 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:49,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3962 Valid, 2558 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1952 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 22:57:49,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-11-19 22:57:49,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 643. [2024-11-19 22:57:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 621 states have (on average 1.3397745571658615) internal successors, (832), 642 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 832 transitions. [2024-11-19 22:57:49,439 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 832 transitions. Word has length 96 [2024-11-19 22:57:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:49,440 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 832 transitions. [2024-11-19 22:57:49,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 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-11-19 22:57:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 832 transitions. [2024-11-19 22:57:49,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 22:57:49,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:49,441 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-11-19 22:57:49,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 22:57:49,441 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:49,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:49,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1445271913, now seen corresponding path program 1 times [2024-11-19 22:57:49,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:49,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672593781] [2024-11-19 22:57:49,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:49,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:49,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:49,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672593781] [2024-11-19 22:57:49,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672593781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:49,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:49,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:49,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109474557] [2024-11-19 22:57:49,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:49,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:49,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:49,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:49,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:49,646 INFO L87 Difference]: Start difference. First operand 643 states and 832 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 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-11-19 22:57:50,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:50,729 INFO L93 Difference]: Finished difference Result 1140 states and 1494 transitions. [2024-11-19 22:57:50,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:57:50,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 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-11-19 22:57:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:50,731 INFO L225 Difference]: With dead ends: 1140 [2024-11-19 22:57:50,731 INFO L226 Difference]: Without dead ends: 987 [2024-11-19 22:57:50,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:57:50,732 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 3309 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3309 SdHoareTripleChecker+Valid, 3096 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:50,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3309 Valid, 3096 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 22:57:50,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2024-11-19 22:57:50,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 639. [2024-11-19 22:57:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.340356564019449) internal successors, (827), 638 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 827 transitions. [2024-11-19 22:57:50,738 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 827 transitions. Word has length 96 [2024-11-19 22:57:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:50,739 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 827 transitions. [2024-11-19 22:57:50,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 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-11-19 22:57:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 827 transitions. [2024-11-19 22:57:50,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 22:57:50,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:50,740 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-11-19 22:57:50,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-19 22:57:50,740 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:50,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash 908385995, now seen corresponding path program 1 times [2024-11-19 22:57:50,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:50,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116313192] [2024-11-19 22:57:50,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:50,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:50,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:50,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116313192] [2024-11-19 22:57:50,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116313192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:50,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:50,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:50,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473656671] [2024-11-19 22:57:50,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:50,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:50,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:50,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:50,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:50,958 INFO L87 Difference]: Start difference. First operand 639 states and 827 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 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-11-19 22:57:51,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:51,839 INFO L93 Difference]: Finished difference Result 1041 states and 1362 transitions. [2024-11-19 22:57:51,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:57:51,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 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-11-19 22:57:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:51,841 INFO L225 Difference]: With dead ends: 1041 [2024-11-19 22:57:51,841 INFO L226 Difference]: Without dead ends: 955 [2024-11-19 22:57:51,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:57:51,841 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 2872 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2872 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:51,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2872 Valid, 2555 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1966 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 22:57:51,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-11-19 22:57:51,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 635. [2024-11-19 22:57:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3409461663947797) internal successors, (822), 634 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:51,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 822 transitions. [2024-11-19 22:57:51,848 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 822 transitions. Word has length 96 [2024-11-19 22:57:51,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:51,848 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 822 transitions. [2024-11-19 22:57:51,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 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-11-19 22:57:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 822 transitions. [2024-11-19 22:57:51,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 22:57:51,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:51,849 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-11-19 22:57:51,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-19 22:57:51,849 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:51,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:51,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1541256586, now seen corresponding path program 1 times [2024-11-19 22:57:51,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:51,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22748851] [2024-11-19 22:57:51,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:51,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:52,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:52,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22748851] [2024-11-19 22:57:52,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22748851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:52,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:52,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:52,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706267828] [2024-11-19 22:57:52,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:52,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:52,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:52,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:52,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:52,115 INFO L87 Difference]: Start difference. First operand 635 states and 822 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:57:53,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:53,097 INFO L93 Difference]: Finished difference Result 999 states and 1296 transitions. [2024-11-19 22:57:53,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:57:53,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:57:53,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:53,099 INFO L225 Difference]: With dead ends: 999 [2024-11-19 22:57:53,099 INFO L226 Difference]: Without dead ends: 923 [2024-11-19 22:57:53,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:57:53,099 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 3581 mSDsluCounter, 2233 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3581 SdHoareTripleChecker+Valid, 2802 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:53,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3581 Valid, 2802 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 22:57:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-19 22:57:53,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 635. [2024-11-19 22:57:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 613 states have (on average 1.3393148450244698) internal successors, (821), 634 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 821 transitions. [2024-11-19 22:57:53,107 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 821 transitions. Word has length 97 [2024-11-19 22:57:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:53,107 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 821 transitions. [2024-11-19 22:57:53,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:57:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 821 transitions. [2024-11-19 22:57:53,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 22:57:53,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:53,108 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-11-19 22:57:53,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-19 22:57:53,108 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:53,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:53,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1487727486, now seen corresponding path program 1 times [2024-11-19 22:57:53,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:53,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218403543] [2024-11-19 22:57:53,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:53,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:53,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:53,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:53,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218403543] [2024-11-19 22:57:53,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218403543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:53,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:53,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:57:53,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485695809] [2024-11-19 22:57:53,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:53,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:57:53,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:53,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:57:53,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:57:53,529 INFO L87 Difference]: Start difference. First operand 635 states and 821 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 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-11-19 22:57:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:54,871 INFO L93 Difference]: Finished difference Result 1184 states and 1564 transitions. [2024-11-19 22:57:54,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 22:57:54,871 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 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-11-19 22:57:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:54,873 INFO L225 Difference]: With dead ends: 1184 [2024-11-19 22:57:54,873 INFO L226 Difference]: Without dead ends: 1105 [2024-11-19 22:57:54,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:57:54,874 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 6071 mSDsluCounter, 2233 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6071 SdHoareTripleChecker+Valid, 2743 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:54,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6071 Valid, 2743 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2304 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 22:57:54,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2024-11-19 22:57:54,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 639. [2024-11-19 22:57:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.3371150729335495) internal successors, (825), 638 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:54,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 825 transitions. [2024-11-19 22:57:54,882 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 825 transitions. Word has length 97 [2024-11-19 22:57:54,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:54,882 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 825 transitions. [2024-11-19 22:57:54,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 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-11-19 22:57:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 825 transitions. [2024-11-19 22:57:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 22:57:54,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:54,884 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-11-19 22:57:54,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-19 22:57:54,884 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:54,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:54,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2052103235, now seen corresponding path program 1 times [2024-11-19 22:57:54,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:54,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678159937] [2024-11-19 22:57:54,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:54,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:55,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:55,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678159937] [2024-11-19 22:57:55,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678159937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:55,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:55,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:55,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160742323] [2024-11-19 22:57:55,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:55,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:55,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:55,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:55,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:55,121 INFO L87 Difference]: Start difference. First operand 639 states and 825 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:57:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:56,052 INFO L93 Difference]: Finished difference Result 1002 states and 1297 transitions. [2024-11-19 22:57:56,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:57:56,053 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:57:56,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:56,054 INFO L225 Difference]: With dead ends: 1002 [2024-11-19 22:57:56,054 INFO L226 Difference]: Without dead ends: 923 [2024-11-19 22:57:56,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:57:56,055 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 3675 mSDsluCounter, 2073 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3675 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:56,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3675 Valid, 2588 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2037 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 22:57:56,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-19 22:57:56,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 639. [2024-11-19 22:57:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.3354943273905997) internal successors, (824), 638 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 824 transitions. [2024-11-19 22:57:56,061 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 824 transitions. Word has length 97 [2024-11-19 22:57:56,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:56,062 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 824 transitions. [2024-11-19 22:57:56,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:57:56,062 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 824 transitions. [2024-11-19 22:57:56,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 22:57:56,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:56,063 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-11-19 22:57:56,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-19 22:57:56,063 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:56,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash -139906133, now seen corresponding path program 1 times [2024-11-19 22:57:56,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:56,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853241898] [2024-11-19 22:57:56,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:56,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:56,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:56,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:56,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853241898] [2024-11-19 22:57:56,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853241898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:56,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:56,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:56,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28228227] [2024-11-19 22:57:56,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:56,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:56,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:56,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:56,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:56,278 INFO L87 Difference]: Start difference. First operand 639 states and 824 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:57:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:57,139 INFO L93 Difference]: Finished difference Result 1050 states and 1366 transitions. [2024-11-19 22:57:57,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:57:57,139 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:57:57,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:57,140 INFO L225 Difference]: With dead ends: 1050 [2024-11-19 22:57:57,141 INFO L226 Difference]: Without dead ends: 959 [2024-11-19 22:57:57,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:57:57,141 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 2323 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2323 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:57,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2323 Valid, 2555 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 22:57:57,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-11-19 22:57:57,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 639. [2024-11-19 22:57:57,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.33387358184765) internal successors, (823), 638 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 823 transitions. [2024-11-19 22:57:57,148 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 823 transitions. Word has length 97 [2024-11-19 22:57:57,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:57,148 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 823 transitions. [2024-11-19 22:57:57,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:57:57,150 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 823 transitions. [2024-11-19 22:57:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 22:57:57,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:57,151 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-11-19 22:57:57,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-19 22:57:57,151 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:57,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:57,152 INFO L85 PathProgramCache]: Analyzing trace with hash -952539292, now seen corresponding path program 1 times [2024-11-19 22:57:57,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:57,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128267632] [2024-11-19 22:57:57,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:57,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:57,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:57,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128267632] [2024-11-19 22:57:57,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128267632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:57,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:57,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:57:57,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771889760] [2024-11-19 22:57:57,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:57,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:57:57,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:57,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:57:57,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:57:57,402 INFO L87 Difference]: Start difference. First operand 639 states and 823 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:57:58,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:57:58,450 INFO L93 Difference]: Finished difference Result 1050 states and 1364 transitions. [2024-11-19 22:57:58,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:57:58,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:57:58,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:57:58,452 INFO L225 Difference]: With dead ends: 1050 [2024-11-19 22:57:58,452 INFO L226 Difference]: Without dead ends: 959 [2024-11-19 22:57:58,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:57:58,453 INFO L432 NwaCegarLoop]: 606 mSDtfsCounter, 3504 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 2273 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3504 SdHoareTripleChecker+Valid, 3063 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 22:57:58,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3504 Valid, 3063 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2273 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 22:57:58,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-11-19 22:57:58,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 639. [2024-11-19 22:57:58,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.3322528363047001) internal successors, (822), 638 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:57:58,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 822 transitions. [2024-11-19 22:57:58,460 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 822 transitions. Word has length 97 [2024-11-19 22:57:58,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:57:58,461 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 822 transitions. [2024-11-19 22:57:58,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:57:58,461 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 822 transitions. [2024-11-19 22:57:58,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 22:57:58,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:57:58,462 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-11-19 22:57:58,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-19 22:57:58,463 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:57:58,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:57:58,463 INFO L85 PathProgramCache]: Analyzing trace with hash -557790964, now seen corresponding path program 1 times [2024-11-19 22:57:58,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:57:58,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543797075] [2024-11-19 22:57:58,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:57:58,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:57:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:57:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:57:58,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:57:58,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543797075] [2024-11-19 22:57:58,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543797075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:57:58,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:57:58,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:57:58,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412630993] [2024-11-19 22:57:58,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:57:58,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:57:58,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:57:58,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:57:58,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:57:58,814 INFO L87 Difference]: Start difference. First operand 639 states and 822 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 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-11-19 22:58:00,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:58:00,125 INFO L93 Difference]: Finished difference Result 1351 states and 1802 transitions. [2024-11-19 22:58:00,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 22:58:00,125 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 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-11-19 22:58:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:58:00,127 INFO L225 Difference]: With dead ends: 1351 [2024-11-19 22:58:00,127 INFO L226 Difference]: Without dead ends: 1237 [2024-11-19 22:58:00,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:58:00,128 INFO L432 NwaCegarLoop]: 641 mSDtfsCounter, 6972 mSDsluCounter, 2297 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6972 SdHoareTripleChecker+Valid, 2938 SdHoareTripleChecker+Invalid, 2440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:58:00,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6972 Valid, 2938 Invalid, 2440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 2234 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 22:58:00,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2024-11-19 22:58:00,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 643. [2024-11-19 22:58:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 621 states have (on average 1.3301127214170692) internal successors, (826), 642 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:58:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 826 transitions. [2024-11-19 22:58:00,133 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 826 transitions. Word has length 97 [2024-11-19 22:58:00,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:58:00,133 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 826 transitions. [2024-11-19 22:58:00,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 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-11-19 22:58:00,133 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 826 transitions. [2024-11-19 22:58:00,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 22:58:00,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:58:00,134 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-11-19 22:58:00,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-19 22:58:00,135 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:58:00,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:58:00,135 INFO L85 PathProgramCache]: Analyzing trace with hash 934856710, now seen corresponding path program 1 times [2024-11-19 22:58:00,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:58:00,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497293858] [2024-11-19 22:58:00,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:58:00,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:58:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:58:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:58:00,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:58:00,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497293858] [2024-11-19 22:58:00,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497293858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:58:00,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:58:00,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:58:00,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353562297] [2024-11-19 22:58:00,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:58:00,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:58:00,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:58:00,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:58:00,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:58:00,373 INFO L87 Difference]: Start difference. First operand 643 states and 826 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:58:01,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:58:01,319 INFO L93 Difference]: Finished difference Result 1001 states and 1293 transitions. [2024-11-19 22:58:01,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:58:01,320 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:58:01,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:58:01,321 INFO L225 Difference]: With dead ends: 1001 [2024-11-19 22:58:01,321 INFO L226 Difference]: Without dead ends: 927 [2024-11-19 22:58:01,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:58:01,322 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 3525 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 2252 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3525 SdHoareTripleChecker+Valid, 2906 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 22:58:01,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3525 Valid, 2906 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2252 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 22:58:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-11-19 22:58:01,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 643. [2024-11-19 22:58:01,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 621 states have (on average 1.328502415458937) internal successors, (825), 642 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:58:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 825 transitions. [2024-11-19 22:58:01,329 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 825 transitions. Word has length 97 [2024-11-19 22:58:01,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:58:01,330 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 825 transitions. [2024-11-19 22:58:01,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:58:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 825 transitions. [2024-11-19 22:58:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 22:58:01,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:58:01,331 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-11-19 22:58:01,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-19 22:58:01,332 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:58:01,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:58:01,332 INFO L85 PathProgramCache]: Analyzing trace with hash -965955861, now seen corresponding path program 1 times [2024-11-19 22:58:01,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:58:01,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587267108] [2024-11-19 22:58:01,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:58:01,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:58:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:58:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:58:01,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:58:01,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587267108] [2024-11-19 22:58:01,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587267108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:58:01,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:58:01,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:58:01,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133881649] [2024-11-19 22:58:01,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:58:01,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:58:01,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:58:01,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:58:01,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:58:01,554 INFO L87 Difference]: Start difference. First operand 643 states and 825 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:58:02,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:58:02,357 INFO L93 Difference]: Finished difference Result 1003 states and 1294 transitions. [2024-11-19 22:58:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:58:02,358 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:58:02,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:58:02,359 INFO L225 Difference]: With dead ends: 1003 [2024-11-19 22:58:02,359 INFO L226 Difference]: Without dead ends: 927 [2024-11-19 22:58:02,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:58:02,360 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 2040 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2040 SdHoareTripleChecker+Valid, 2232 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 22:58:02,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2040 Valid, 2232 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 22:58:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-11-19 22:58:02,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 643. [2024-11-19 22:58:02,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 621 states have (on average 1.326892109500805) internal successors, (824), 642 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:58:02,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 824 transitions. [2024-11-19 22:58:02,369 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 824 transitions. Word has length 97 [2024-11-19 22:58:02,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:58:02,369 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 824 transitions. [2024-11-19 22:58:02,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:58:02,369 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 824 transitions. [2024-11-19 22:58:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 22:58:02,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:58:02,370 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-11-19 22:58:02,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-19 22:58:02,371 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:58:02,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:58:02,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1614649937, now seen corresponding path program 1 times [2024-11-19 22:58:02,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:58:02,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11254314] [2024-11-19 22:58:02,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:58:02,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:58:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:58:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:58:02,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:58:02,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11254314] [2024-11-19 22:58:02,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11254314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:58:02,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:58:02,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:58:02,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297189892] [2024-11-19 22:58:02,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:58:02,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:58:02,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:58:02,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:58:02,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:58:02,624 INFO L87 Difference]: Start difference. First operand 643 states and 824 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:58:03,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:58:03,545 INFO L93 Difference]: Finished difference Result 1003 states and 1292 transitions. [2024-11-19 22:58:03,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:58:03,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:58:03,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:58:03,547 INFO L225 Difference]: With dead ends: 1003 [2024-11-19 22:58:03,547 INFO L226 Difference]: Without dead ends: 927 [2024-11-19 22:58:03,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:58:03,548 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 3614 mSDsluCounter, 2151 mSDsCounter, 0 mSdLazyCounter, 2058 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3614 SdHoareTripleChecker+Valid, 2692 SdHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 22:58:03,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3614 Valid, 2692 Invalid, 2065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2058 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 22:58:03,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-11-19 22:58:03,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 643. [2024-11-19 22:58:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 621 states have (on average 1.325281803542673) internal successors, (823), 642 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:58:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 823 transitions. [2024-11-19 22:58:03,555 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 823 transitions. Word has length 97 [2024-11-19 22:58:03,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:58:03,555 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 823 transitions. [2024-11-19 22:58:03,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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-11-19 22:58:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 823 transitions. [2024-11-19 22:58:03,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 22:58:03,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:58:03,556 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-11-19 22:58:03,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-19 22:58:03,556 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-11-19 22:58:03,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:58:03,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1414714454, now seen corresponding path program 1 times [2024-11-19 22:58:03,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:58:03,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770247161] [2024-11-19 22:58:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:58:03,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:58:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:58:03,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:58:03,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:58:03,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770247161] [2024-11-19 22:58:03,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770247161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:58:03,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:58:03,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:58:03,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041803149] [2024-11-19 22:58:03,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:58:03,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:58:03,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:58:03,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:58:03,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:58:03,726 INFO L87 Difference]: Start difference. First operand 643 states and 823 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 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)