./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.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 dbfd30746a885b9515f914ecf1282b7cce3374e505c2f59173500b59d4c3c5b9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:49:23,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:49:23,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:49:23,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:49:23,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:49:23,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:49:23,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:49:23,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:49:23,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:49:23,799 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:49:23,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:49:23,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:49:23,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:49:23,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:49:23,802 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:49:23,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:49:23,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:49:23,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:49:23,804 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:49:23,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:49:23,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:49:23,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:49:23,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:49:23,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:49:23,809 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:49:23,809 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:49:23,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:49:23,810 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:49:23,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:49:23,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:49:23,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:49:23,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:49:23,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:49:23,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:49:23,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:49:23,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:49:23,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:49:23,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:49:23,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:49:23,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:49:23,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:49:23,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:49:23,819 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 -> dbfd30746a885b9515f914ecf1282b7cce3374e505c2f59173500b59d4c3c5b9 [2024-10-24 01:49:24,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:49:24,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:49:24,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:49:24,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:49:24,133 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:49:24,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-24 01:49:25,719 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:49:26,062 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:49:26,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-24 01:49:26,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb1ca3b8/091ffe05d65d4d00b7e3eabc03941998/FLAGedf4dd1f5 [2024-10-24 01:49:26,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb1ca3b8/091ffe05d65d4d00b7e3eabc03941998 [2024-10-24 01:49:26,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:49:26,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:49:26,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:49:26,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:49:26,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:49:26,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:49:26" (1/1) ... [2024-10-24 01:49:26,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14313db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:49:26, skipping insertion in model container [2024-10-24 01:49:26,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:49:26" (1/1) ... [2024-10-24 01:49:26,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:49:26,603 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10929,10942] [2024-10-24 01:49:26,639 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14786,14799] [2024-10-24 01:49:26,654 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16007,16020] [2024-10-24 01:49:26,661 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16713,16726] [2024-10-24 01:49:26,673 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18257,18270] [2024-10-24 01:49:26,680 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18963,18976] [2024-10-24 01:49:26,690 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19992,20005] [2024-10-24 01:49:26,716 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22398,22411] [2024-10-24 01:49:26,728 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23107,23120] [2024-10-24 01:49:26,734 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24144,24157] [2024-10-24 01:49:26,746 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26040,26053] [2024-10-24 01:49:26,774 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29948,29961] [2024-10-24 01:49:26,785 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30657,30670] [2024-10-24 01:49:26,792 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31689,31702] [2024-10-24 01:49:26,805 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33580,33593] [2024-10-24 01:49:26,828 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36793,36806] [2024-10-24 01:49:27,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:49:27,024 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:49:27,079 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10929,10942] [2024-10-24 01:49:27,090 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14786,14799] [2024-10-24 01:49:27,097 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16007,16020] [2024-10-24 01:49:27,101 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16713,16726] [2024-10-24 01:49:27,109 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18257,18270] [2024-10-24 01:49:27,115 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18963,18976] [2024-10-24 01:49:27,119 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19992,20005] [2024-10-24 01:49:27,131 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22398,22411] [2024-10-24 01:49:27,136 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23107,23120] [2024-10-24 01:49:27,141 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24144,24157] [2024-10-24 01:49:27,148 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26040,26053] [2024-10-24 01:49:27,161 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29948,29961] [2024-10-24 01:49:27,164 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30657,30670] [2024-10-24 01:49:27,168 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31689,31702] [2024-10-24 01:49:27,175 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33580,33593] [2024-10-24 01:49:27,186 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36793,36806] [2024-10-24 01:49:27,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:49:27,303 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:49:27,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:49:27 WrapperNode [2024-10-24 01:49:27,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:49:27,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:49:27,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:49:27,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:49:27,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:49:27" (1/1) ... [2024-10-24 01:49:27,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:49:27" (1/1) ... [2024-10-24 01:49:27,448 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3579 [2024-10-24 01:49:27,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:49:27,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:49:27,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:49:27,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:49:27,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:49:27" (1/1) ... [2024-10-24 01:49:27,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:49:27" (1/1) ... [2024-10-24 01:49:27,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:49:27" (1/1) ... [2024-10-24 01:49:27,562 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 01:49:27,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:49:27" (1/1) ... [2024-10-24 01:49:27,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:49:27" (1/1) ... [2024-10-24 01:49:27,615 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:49:27" (1/1) ... [2024-10-24 01:49:27,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:49:27" (1/1) ... [2024-10-24 01:49:27,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:49:27" (1/1) ... [2024-10-24 01:49:27,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:49:27" (1/1) ... [2024-10-24 01:49:27,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:49:27,705 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:49:27,705 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:49:27,705 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:49:27,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:49:27" (1/1) ... [2024-10-24 01:49:27,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:49:27,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:49:27,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 01:49:27,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 01:49:27,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:49:27,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:49:27,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:49:27,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:49:27,987 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:49:27,989 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:49:29,950 INFO L? ?]: Removed 539 outVars from TransFormulas that were not future-live. [2024-10-24 01:49:29,951 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:49:30,024 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:49:30,028 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 01:49:30,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:49:30 BoogieIcfgContainer [2024-10-24 01:49:30,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:49:30,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:49:30,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:49:30,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:49:30,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:49:26" (1/3) ... [2024-10-24 01:49:30,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6351d9e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:49:30, skipping insertion in model container [2024-10-24 01:49:30,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:49:27" (2/3) ... [2024-10-24 01:49:30,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6351d9e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:49:30, skipping insertion in model container [2024-10-24 01:49:30,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:49:30" (3/3) ... [2024-10-24 01:49:30,037 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-24 01:49:30,054 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:49:30,054 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-24 01:49:30,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:49:30,158 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;@69241b9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:49:30,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-24 01:49:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 624 states, 607 states have (on average 1.8533772652388798) internal successors, (1125), 623 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:30,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-24 01:49:30,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:30,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:30,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:30,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:30,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1484817577, now seen corresponding path program 1 times [2024-10-24 01:49:30,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:30,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691490726] [2024-10-24 01:49:30,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:30,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:30,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:30,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691490726] [2024-10-24 01:49:30,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691490726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:30,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:30,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:49:30,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544669641] [2024-10-24 01:49:30,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:30,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:49:30,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:30,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:49:30,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:49:30,884 INFO L87 Difference]: Start difference. First operand has 624 states, 607 states have (on average 1.8533772652388798) internal successors, (1125), 623 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:31,381 INFO L93 Difference]: Finished difference Result 966 states and 1681 transitions. [2024-10-24 01:49:31,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:49:31,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-24 01:49:31,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:31,401 INFO L225 Difference]: With dead ends: 966 [2024-10-24 01:49:31,402 INFO L226 Difference]: Without dead ends: 506 [2024-10-24 01:49:31,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:49:31,412 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 2529 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2529 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:31,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2529 Valid, 618 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:49:31,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-10-24 01:49:31,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2024-10-24 01:49:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 490 states have (on average 1.3061224489795917) internal successors, (640), 505 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 640 transitions. [2024-10-24 01:49:31,483 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 640 transitions. Word has length 70 [2024-10-24 01:49:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:31,484 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 640 transitions. [2024-10-24 01:49:31,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 640 transitions. [2024-10-24 01:49:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-24 01:49:31,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:31,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:31,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:49:31,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:31,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:31,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1062417945, now seen corresponding path program 1 times [2024-10-24 01:49:31,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:31,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406589384] [2024-10-24 01:49:31,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:31,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:31,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:31,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406589384] [2024-10-24 01:49:31,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406589384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:31,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:31,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:49:31,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925781039] [2024-10-24 01:49:31,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:31,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:49:31,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:31,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:49:31,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:49:31,715 INFO L87 Difference]: Start difference. First operand 506 states and 640 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:32,071 INFO L93 Difference]: Finished difference Result 842 states and 1095 transitions. [2024-10-24 01:49:32,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:49:32,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-24 01:49:32,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:32,074 INFO L225 Difference]: With dead ends: 842 [2024-10-24 01:49:32,077 INFO L226 Difference]: Without dead ends: 454 [2024-10-24 01:49:32,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:49:32,083 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1657 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1657 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:32,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1657 Valid, 343 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:49:32,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-10-24 01:49:32,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2024-10-24 01:49:32,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 438 states have (on average 1.321917808219178) internal successors, (579), 453 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:32,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 579 transitions. [2024-10-24 01:49:32,114 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 579 transitions. Word has length 71 [2024-10-24 01:49:32,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:32,115 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 579 transitions. [2024-10-24 01:49:32,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:32,115 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 579 transitions. [2024-10-24 01:49:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 01:49:32,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:32,119 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:32,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:49:32,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:32,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1527977194, now seen corresponding path program 1 times [2024-10-24 01:49:32,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:32,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676699483] [2024-10-24 01:49:32,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:32,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:32,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:32,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:32,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676699483] [2024-10-24 01:49:32,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676699483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:32,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:32,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:49:32,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416636875] [2024-10-24 01:49:32,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:32,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:49:32,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:32,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:49:32,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:49:32,311 INFO L87 Difference]: Start difference. First operand 454 states and 579 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:32,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:32,610 INFO L93 Difference]: Finished difference Result 790 states and 1033 transitions. [2024-10-24 01:49:32,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:49:32,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-10-24 01:49:32,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:32,612 INFO L225 Difference]: With dead ends: 790 [2024-10-24 01:49:32,613 INFO L226 Difference]: Without dead ends: 416 [2024-10-24 01:49:32,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:49:32,616 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 1555 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:32,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 319 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:49:32,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-10-24 01:49:32,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-10-24 01:49:32,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 400 states have (on average 1.34) internal successors, (536), 415 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:32,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 536 transitions. [2024-10-24 01:49:32,628 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 536 transitions. Word has length 72 [2024-10-24 01:49:32,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:32,628 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 536 transitions. [2024-10-24 01:49:32,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 536 transitions. [2024-10-24 01:49:32,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 01:49:32,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:32,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:32,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:49:32,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:32,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:32,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1740804882, now seen corresponding path program 1 times [2024-10-24 01:49:32,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:32,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031663042] [2024-10-24 01:49:32,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:32,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:32,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:32,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:32,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031663042] [2024-10-24 01:49:32,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031663042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:32,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:32,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:49:32,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530789045] [2024-10-24 01:49:32,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:32,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:49:32,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:32,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:49:32,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:49:32,820 INFO L87 Difference]: Start difference. First operand 416 states and 536 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:33,213 INFO L93 Difference]: Finished difference Result 965 states and 1273 transitions. [2024-10-24 01:49:33,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:49:33,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-24 01:49:33,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:33,216 INFO L225 Difference]: With dead ends: 965 [2024-10-24 01:49:33,216 INFO L226 Difference]: Without dead ends: 607 [2024-10-24 01:49:33,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:49:33,218 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 2057 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2057 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:33,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2057 Valid, 466 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:49:33,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-10-24 01:49:33,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 547. [2024-10-24 01:49:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.39924670433145) internal successors, (743), 546 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 743 transitions. [2024-10-24 01:49:33,243 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 743 transitions. Word has length 73 [2024-10-24 01:49:33,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:33,243 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 743 transitions. [2024-10-24 01:49:33,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:33,245 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 743 transitions. [2024-10-24 01:49:33,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 01:49:33,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:33,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:33,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:49:33,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:33,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:33,249 INFO L85 PathProgramCache]: Analyzing trace with hash -759675733, now seen corresponding path program 1 times [2024-10-24 01:49:33,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:33,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125688170] [2024-10-24 01:49:33,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:33,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:33,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:33,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125688170] [2024-10-24 01:49:33,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125688170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:33,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:33,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:49:33,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096422765] [2024-10-24 01:49:33,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:33,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:49:33,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:33,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:49:33,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:49:33,415 INFO L87 Difference]: Start difference. First operand 547 states and 743 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:33,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:33,729 INFO L93 Difference]: Finished difference Result 1036 states and 1427 transitions. [2024-10-24 01:49:33,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:49:33,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-24 01:49:33,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:33,734 INFO L225 Difference]: With dead ends: 1036 [2024-10-24 01:49:33,735 INFO L226 Difference]: Without dead ends: 542 [2024-10-24 01:49:33,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:49:33,736 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 1414 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:33,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 280 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:49:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-10-24 01:49:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2024-10-24 01:49:33,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.397338403041825) internal successors, (735), 541 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 735 transitions. [2024-10-24 01:49:33,756 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 735 transitions. Word has length 74 [2024-10-24 01:49:33,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:33,757 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 735 transitions. [2024-10-24 01:49:33,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 735 transitions. [2024-10-24 01:49:33,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 01:49:33,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:33,762 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] [2024-10-24 01:49:33,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:49:33,763 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:33,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:33,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1130154961, now seen corresponding path program 1 times [2024-10-24 01:49:33,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:33,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66723325] [2024-10-24 01:49:33,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:33,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:34,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:34,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:34,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66723325] [2024-10-24 01:49:34,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66723325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:34,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:34,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:49:34,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204518588] [2024-10-24 01:49:34,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:34,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:49:34,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:34,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:49:34,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:49:34,162 INFO L87 Difference]: Start difference. First operand 542 states and 735 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:34,831 INFO L93 Difference]: Finished difference Result 1044 states and 1397 transitions. [2024-10-24 01:49:34,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:49:34,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-24 01:49:34,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:34,835 INFO L225 Difference]: With dead ends: 1044 [2024-10-24 01:49:34,835 INFO L226 Difference]: Without dead ends: 770 [2024-10-24 01:49:34,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:49:34,837 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 1763 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1763 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:34,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1763 Valid, 893 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:49:34,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-10-24 01:49:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 542. [2024-10-24 01:49:34,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3954372623574145) internal successors, (734), 541 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 734 transitions. [2024-10-24 01:49:34,853 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 734 transitions. Word has length 75 [2024-10-24 01:49:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:34,853 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 734 transitions. [2024-10-24 01:49:34,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 734 transitions. [2024-10-24 01:49:34,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 01:49:34,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:34,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:34,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:49:34,856 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:34,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:34,856 INFO L85 PathProgramCache]: Analyzing trace with hash 496363608, now seen corresponding path program 1 times [2024-10-24 01:49:34,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:34,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123722478] [2024-10-24 01:49:34,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:34,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:35,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:35,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123722478] [2024-10-24 01:49:35,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123722478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:35,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:35,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:35,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775501035] [2024-10-24 01:49:35,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:35,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:35,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:35,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:35,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:35,234 INFO L87 Difference]: Start difference. First operand 542 states and 734 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:35,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:35,933 INFO L93 Difference]: Finished difference Result 800 states and 1107 transitions. [2024-10-24 01:49:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:49:35,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-24 01:49:35,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:35,936 INFO L225 Difference]: With dead ends: 800 [2024-10-24 01:49:35,936 INFO L226 Difference]: Without dead ends: 610 [2024-10-24 01:49:35,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:49:35,937 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 1534 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:35,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 1258 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:49:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-10-24 01:49:35,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 542. [2024-10-24 01:49:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3935361216730038) internal successors, (733), 541 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 733 transitions. [2024-10-24 01:49:35,950 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 733 transitions. Word has length 75 [2024-10-24 01:49:35,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:35,950 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 733 transitions. [2024-10-24 01:49:35,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 733 transitions. [2024-10-24 01:49:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 01:49:35,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:35,952 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] [2024-10-24 01:49:35,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:49:35,953 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:35,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:35,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1385408418, now seen corresponding path program 1 times [2024-10-24 01:49:35,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:35,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854279497] [2024-10-24 01:49:35,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:35,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:36,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:36,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854279497] [2024-10-24 01:49:36,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854279497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:36,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:36,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:36,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507404149] [2024-10-24 01:49:36,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:36,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:36,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:36,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:36,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:36,270 INFO L87 Difference]: Start difference. First operand 542 states and 733 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:37,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:37,104 INFO L93 Difference]: Finished difference Result 1020 states and 1409 transitions. [2024-10-24 01:49:37,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:49:37,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-24 01:49:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:37,108 INFO L225 Difference]: With dead ends: 1020 [2024-10-24 01:49:37,109 INFO L226 Difference]: Without dead ends: 869 [2024-10-24 01:49:37,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:49:37,111 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 1764 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1764 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:37,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1764 Valid, 1599 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:49:37,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2024-10-24 01:49:37,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 542. [2024-10-24 01:49:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.391634980988593) internal successors, (732), 541 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 732 transitions. [2024-10-24 01:49:37,129 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 732 transitions. Word has length 75 [2024-10-24 01:49:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:37,130 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 732 transitions. [2024-10-24 01:49:37,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 732 transitions. [2024-10-24 01:49:37,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:49:37,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:37,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:37,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:49:37,132 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:37,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:37,135 INFO L85 PathProgramCache]: Analyzing trace with hash -821108329, now seen corresponding path program 1 times [2024-10-24 01:49:37,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:37,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061900999] [2024-10-24 01:49:37,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:37,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:37,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:37,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061900999] [2024-10-24 01:49:37,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061900999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:37,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:37,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:37,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291473804] [2024-10-24 01:49:37,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:37,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:37,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:37,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:37,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:37,505 INFO L87 Difference]: Start difference. First operand 542 states and 732 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:38,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:38,341 INFO L93 Difference]: Finished difference Result 1029 states and 1417 transitions. [2024-10-24 01:49:38,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:49:38,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-24 01:49:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:38,344 INFO L225 Difference]: With dead ends: 1029 [2024-10-24 01:49:38,345 INFO L226 Difference]: Without dead ends: 869 [2024-10-24 01:49:38,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:49:38,348 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 1032 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:38,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 1838 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:49:38,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2024-10-24 01:49:38,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 542. [2024-10-24 01:49:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3897338403041826) internal successors, (731), 541 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 731 transitions. [2024-10-24 01:49:38,362 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 731 transitions. Word has length 77 [2024-10-24 01:49:38,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:38,362 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 731 transitions. [2024-10-24 01:49:38,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 731 transitions. [2024-10-24 01:49:38,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:49:38,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:38,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:38,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:49:38,364 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:38,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:38,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1229953557, now seen corresponding path program 1 times [2024-10-24 01:49:38,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:38,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209301265] [2024-10-24 01:49:38,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:38,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:38,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:38,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209301265] [2024-10-24 01:49:38,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209301265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:38,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:38,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:38,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033221176] [2024-10-24 01:49:38,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:38,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:38,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:38,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:38,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:38,746 INFO L87 Difference]: Start difference. First operand 542 states and 731 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:39,522 INFO L93 Difference]: Finished difference Result 983 states and 1348 transitions. [2024-10-24 01:49:39,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:49:39,523 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-24 01:49:39,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:39,526 INFO L225 Difference]: With dead ends: 983 [2024-10-24 01:49:39,527 INFO L226 Difference]: Without dead ends: 845 [2024-10-24 01:49:39,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:49:39,528 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 1912 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1912 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:39,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1912 Valid, 1396 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:49:39,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-10-24 01:49:39,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 542. [2024-10-24 01:49:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3878326996197718) internal successors, (730), 541 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 730 transitions. [2024-10-24 01:49:39,541 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 730 transitions. Word has length 77 [2024-10-24 01:49:39,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:39,541 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 730 transitions. [2024-10-24 01:49:39,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:39,542 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 730 transitions. [2024-10-24 01:49:39,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:49:39,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:39,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:39,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:49:39,544 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:39,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:39,544 INFO L85 PathProgramCache]: Analyzing trace with hash -861851382, now seen corresponding path program 1 times [2024-10-24 01:49:39,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:39,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908851488] [2024-10-24 01:49:39,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:39,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:40,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:40,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:40,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908851488] [2024-10-24 01:49:40,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908851488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:40,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:40,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:49:40,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954072594] [2024-10-24 01:49:40,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:40,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:49:40,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:40,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:49:40,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:49:40,114 INFO L87 Difference]: Start difference. First operand 542 states and 730 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:41,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:41,361 INFO L93 Difference]: Finished difference Result 1383 states and 1938 transitions. [2024-10-24 01:49:41,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 01:49:41,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-24 01:49:41,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:41,367 INFO L225 Difference]: With dead ends: 1383 [2024-10-24 01:49:41,367 INFO L226 Difference]: Without dead ends: 1245 [2024-10-24 01:49:41,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-24 01:49:41,369 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 4170 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4170 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:41,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4170 Valid, 1782 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 01:49:41,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2024-10-24 01:49:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 546. [2024-10-24 01:49:41,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 530 states have (on average 1.3849056603773584) internal successors, (734), 545 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 734 transitions. [2024-10-24 01:49:41,386 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 734 transitions. Word has length 77 [2024-10-24 01:49:41,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:41,387 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 734 transitions. [2024-10-24 01:49:41,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 734 transitions. [2024-10-24 01:49:41,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:49:41,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:41,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:41,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:49:41,389 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:41,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:41,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1582421198, now seen corresponding path program 1 times [2024-10-24 01:49:41,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:41,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037531555] [2024-10-24 01:49:41,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:41,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:41,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:41,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037531555] [2024-10-24 01:49:41,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037531555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:41,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:41,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:41,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738498633] [2024-10-24 01:49:41,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:41,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:41,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:41,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:41,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:41,727 INFO L87 Difference]: Start difference. First operand 546 states and 734 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:42,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:42,340 INFO L93 Difference]: Finished difference Result 979 states and 1342 transitions. [2024-10-24 01:49:42,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:49:42,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-24 01:49:42,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:42,344 INFO L225 Difference]: With dead ends: 979 [2024-10-24 01:49:42,344 INFO L226 Difference]: Without dead ends: 845 [2024-10-24 01:49:42,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:49:42,345 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 1938 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1938 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:42,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1938 Valid, 1364 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:49:42,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-10-24 01:49:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 546. [2024-10-24 01:49:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 530 states have (on average 1.3830188679245283) internal successors, (733), 545 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 733 transitions. [2024-10-24 01:49:42,358 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 733 transitions. Word has length 77 [2024-10-24 01:49:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:42,358 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 733 transitions. [2024-10-24 01:49:42,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 733 transitions. [2024-10-24 01:49:42,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:49:42,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:42,360 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:42,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:49:42,361 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:42,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:42,361 INFO L85 PathProgramCache]: Analyzing trace with hash 981154930, now seen corresponding path program 1 times [2024-10-24 01:49:42,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:42,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514583857] [2024-10-24 01:49:42,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:42,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:42,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:42,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514583857] [2024-10-24 01:49:42,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514583857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:42,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:42,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:42,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337376579] [2024-10-24 01:49:42,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:42,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:42,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:42,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:42,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:42,644 INFO L87 Difference]: Start difference. First operand 546 states and 733 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:43,296 INFO L93 Difference]: Finished difference Result 870 states and 1194 transitions. [2024-10-24 01:49:43,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:49:43,297 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-24 01:49:43,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:43,300 INFO L225 Difference]: With dead ends: 870 [2024-10-24 01:49:43,300 INFO L226 Difference]: Without dead ends: 614 [2024-10-24 01:49:43,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:49:43,302 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 1517 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:43,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1255 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:49:43,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-10-24 01:49:43,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 546. [2024-10-24 01:49:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 530 states have (on average 1.379245283018868) internal successors, (731), 545 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:43,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 731 transitions. [2024-10-24 01:49:43,319 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 731 transitions. Word has length 77 [2024-10-24 01:49:43,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:43,320 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 731 transitions. [2024-10-24 01:49:43,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:43,320 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 731 transitions. [2024-10-24 01:49:43,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:49:43,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:43,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:43,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:49:43,322 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:43,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:43,323 INFO L85 PathProgramCache]: Analyzing trace with hash -817405268, now seen corresponding path program 1 times [2024-10-24 01:49:43,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:43,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994535381] [2024-10-24 01:49:43,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:43,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:43,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:43,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994535381] [2024-10-24 01:49:43,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994535381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:43,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:43,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:43,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322649719] [2024-10-24 01:49:43,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:43,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:43,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:43,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:43,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:43,668 INFO L87 Difference]: Start difference. First operand 546 states and 731 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:44,384 INFO L93 Difference]: Finished difference Result 989 states and 1351 transitions. [2024-10-24 01:49:44,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:49:44,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-24 01:49:44,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:44,388 INFO L225 Difference]: With dead ends: 989 [2024-10-24 01:49:44,388 INFO L226 Difference]: Without dead ends: 845 [2024-10-24 01:49:44,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:49:44,390 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 1930 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:44,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 1364 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:49:44,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-10-24 01:49:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 546. [2024-10-24 01:49:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 530 states have (on average 1.3754716981132076) internal successors, (729), 545 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 729 transitions. [2024-10-24 01:49:44,403 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 729 transitions. Word has length 77 [2024-10-24 01:49:44,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:44,403 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 729 transitions. [2024-10-24 01:49:44,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:44,404 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 729 transitions. [2024-10-24 01:49:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:49:44,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:44,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:44,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:49:44,405 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:44,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:44,406 INFO L85 PathProgramCache]: Analyzing trace with hash -408560040, now seen corresponding path program 1 times [2024-10-24 01:49:44,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:44,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822179343] [2024-10-24 01:49:44,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:44,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:44,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:44,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822179343] [2024-10-24 01:49:44,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822179343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:44,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:44,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:44,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097831090] [2024-10-24 01:49:44,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:44,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:44,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:44,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:44,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:44,646 INFO L87 Difference]: Start difference. First operand 546 states and 729 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:45,451 INFO L93 Difference]: Finished difference Result 1043 states and 1426 transitions. [2024-10-24 01:49:45,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:49:45,454 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-24 01:49:45,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:45,457 INFO L225 Difference]: With dead ends: 1043 [2024-10-24 01:49:45,457 INFO L226 Difference]: Without dead ends: 873 [2024-10-24 01:49:45,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:49:45,458 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 1537 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:45,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 1863 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:49:45,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-10-24 01:49:45,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 546. [2024-10-24 01:49:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 530 states have (on average 1.3716981132075472) internal successors, (727), 545 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 727 transitions. [2024-10-24 01:49:45,472 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 727 transitions. Word has length 77 [2024-10-24 01:49:45,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:45,472 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 727 transitions. [2024-10-24 01:49:45,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:45,473 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 727 transitions. [2024-10-24 01:49:45,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:49:45,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:45,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:45,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:49:45,475 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:45,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:45,476 INFO L85 PathProgramCache]: Analyzing trace with hash -180251782, now seen corresponding path program 1 times [2024-10-24 01:49:45,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:45,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203522050] [2024-10-24 01:49:45,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:45,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:45,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:45,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203522050] [2024-10-24 01:49:45,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203522050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:45,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:45,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:45,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623849385] [2024-10-24 01:49:45,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:45,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:45,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:45,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:45,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:45,777 INFO L87 Difference]: Start difference. First operand 546 states and 727 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:46,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:46,422 INFO L93 Difference]: Finished difference Result 830 states and 1101 transitions. [2024-10-24 01:49:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:49:46,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-24 01:49:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:46,426 INFO L225 Difference]: With dead ends: 830 [2024-10-24 01:49:46,426 INFO L226 Difference]: Without dead ends: 825 [2024-10-24 01:49:46,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:49:46,427 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 1951 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1951 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:46,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1951 Valid, 1250 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:49:46,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-24 01:49:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 546. [2024-10-24 01:49:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 530 states have (on average 1.369811320754717) internal successors, (726), 545 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 726 transitions. [2024-10-24 01:49:46,442 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 726 transitions. Word has length 78 [2024-10-24 01:49:46,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:46,442 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 726 transitions. [2024-10-24 01:49:46,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 726 transitions. [2024-10-24 01:49:46,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:49:46,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:46,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:46,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:49:46,444 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:46,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:46,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1887565433, now seen corresponding path program 1 times [2024-10-24 01:49:46,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:46,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782721753] [2024-10-24 01:49:46,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:46,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:46,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:46,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782721753] [2024-10-24 01:49:46,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782721753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:46,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:46,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:46,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038713933] [2024-10-24 01:49:46,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:46,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:46,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:46,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:46,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:46,769 INFO L87 Difference]: Start difference. First operand 546 states and 726 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:47,553 INFO L93 Difference]: Finished difference Result 953 states and 1287 transitions. [2024-10-24 01:49:47,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:49:47,553 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:49:47,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:47,556 INFO L225 Difference]: With dead ends: 953 [2024-10-24 01:49:47,556 INFO L226 Difference]: Without dead ends: 825 [2024-10-24 01:49:47,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:49:47,558 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 1560 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:47,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 1755 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:49:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-24 01:49:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 546. [2024-10-24 01:49:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 530 states have (on average 1.3679245283018868) internal successors, (725), 545 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 725 transitions. [2024-10-24 01:49:47,569 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 725 transitions. Word has length 79 [2024-10-24 01:49:47,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:47,569 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 725 transitions. [2024-10-24 01:49:47,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 725 transitions. [2024-10-24 01:49:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:49:47,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:47,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:47,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:49:47,571 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:47,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:47,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1141656959, now seen corresponding path program 1 times [2024-10-24 01:49:47,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:47,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346507004] [2024-10-24 01:49:47,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:47,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:47,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:47,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:47,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346507004] [2024-10-24 01:49:47,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346507004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:47,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:47,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:47,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630897490] [2024-10-24 01:49:47,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:47,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:47,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:47,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:47,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:47,813 INFO L87 Difference]: Start difference. First operand 546 states and 725 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:48,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:48,505 INFO L93 Difference]: Finished difference Result 956 states and 1289 transitions. [2024-10-24 01:49:48,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:49:48,505 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:49:48,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:48,507 INFO L225 Difference]: With dead ends: 956 [2024-10-24 01:49:48,507 INFO L226 Difference]: Without dead ends: 825 [2024-10-24 01:49:48,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:49:48,508 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 1943 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1943 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:48,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1943 Valid, 1238 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:49:48,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-24 01:49:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 546. [2024-10-24 01:49:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 530 states have (on average 1.3660377358490565) internal successors, (724), 545 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 724 transitions. [2024-10-24 01:49:48,521 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 724 transitions. Word has length 79 [2024-10-24 01:49:48,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:48,521 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 724 transitions. [2024-10-24 01:49:48,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:48,522 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 724 transitions. [2024-10-24 01:49:48,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:49:48,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:48,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:48,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:49:48,523 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:48,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:48,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1896793534, now seen corresponding path program 1 times [2024-10-24 01:49:48,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:48,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394177848] [2024-10-24 01:49:48,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:48,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:48,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:48,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394177848] [2024-10-24 01:49:48,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394177848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:48,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:48,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:48,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180761620] [2024-10-24 01:49:48,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:48,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:48,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:48,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:48,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:48,822 INFO L87 Difference]: Start difference. First operand 546 states and 724 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:49,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:49,494 INFO L93 Difference]: Finished difference Result 956 states and 1287 transitions. [2024-10-24 01:49:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:49:49,494 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:49:49,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:49,497 INFO L225 Difference]: With dead ends: 956 [2024-10-24 01:49:49,497 INFO L226 Difference]: Without dead ends: 825 [2024-10-24 01:49:49,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:49:49,498 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 1554 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:49,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 1557 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:49:49,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-24 01:49:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 546. [2024-10-24 01:49:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 530 states have (on average 1.3641509433962264) internal successors, (723), 545 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 723 transitions. [2024-10-24 01:49:49,507 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 723 transitions. Word has length 79 [2024-10-24 01:49:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:49,508 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 723 transitions. [2024-10-24 01:49:49,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:49,508 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 723 transitions. [2024-10-24 01:49:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:49:49,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:49,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:49,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:49:49,509 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:49,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:49,510 INFO L85 PathProgramCache]: Analyzing trace with hash -485976660, now seen corresponding path program 1 times [2024-10-24 01:49:49,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:49,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183314582] [2024-10-24 01:49:49,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:49,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:50,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:50,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183314582] [2024-10-24 01:49:50,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183314582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:50,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:50,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:49:50,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093652765] [2024-10-24 01:49:50,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:50,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:49:50,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:50,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:49:50,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:49:50,062 INFO L87 Difference]: Start difference. First operand 546 states and 723 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:51,428 INFO L93 Difference]: Finished difference Result 1388 states and 1929 transitions. [2024-10-24 01:49:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 01:49:51,429 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:49:51,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:51,433 INFO L225 Difference]: With dead ends: 1388 [2024-10-24 01:49:51,433 INFO L226 Difference]: Without dead ends: 1245 [2024-10-24 01:49:51,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-24 01:49:51,435 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 3488 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3488 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:51,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3488 Valid, 1750 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 01:49:51,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2024-10-24 01:49:51,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 550. [2024-10-24 01:49:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.3614232209737829) internal successors, (727), 549 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 727 transitions. [2024-10-24 01:49:51,448 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 727 transitions. Word has length 79 [2024-10-24 01:49:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:51,448 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 727 transitions. [2024-10-24 01:49:51,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:51,449 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 727 transitions. [2024-10-24 01:49:51,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:49:51,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:51,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:51,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:49:51,450 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:51,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:51,451 INFO L85 PathProgramCache]: Analyzing trace with hash -328806928, now seen corresponding path program 1 times [2024-10-24 01:49:51,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:51,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017833253] [2024-10-24 01:49:51,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:51,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:51,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:51,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017833253] [2024-10-24 01:49:51,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017833253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:51,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:51,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:51,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493073321] [2024-10-24 01:49:51,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:51,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:51,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:51,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:51,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:51,757 INFO L87 Difference]: Start difference. First operand 550 states and 727 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:52,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:52,537 INFO L93 Difference]: Finished difference Result 957 states and 1287 transitions. [2024-10-24 01:49:52,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:49:52,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:49:52,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:52,540 INFO L225 Difference]: With dead ends: 957 [2024-10-24 01:49:52,540 INFO L226 Difference]: Without dead ends: 829 [2024-10-24 01:49:52,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:49:52,541 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 1551 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:52,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 1774 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:49:52,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-24 01:49:52,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 550. [2024-10-24 01:49:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.3595505617977528) internal successors, (726), 549 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 726 transitions. [2024-10-24 01:49:52,553 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 726 transitions. Word has length 79 [2024-10-24 01:49:52,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:52,553 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 726 transitions. [2024-10-24 01:49:52,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:52,554 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 726 transitions. [2024-10-24 01:49:52,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:49:52,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:52,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:52,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 01:49:52,555 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:52,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:52,556 INFO L85 PathProgramCache]: Analyzing trace with hash 319887148, now seen corresponding path program 1 times [2024-10-24 01:49:52,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:52,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293466013] [2024-10-24 01:49:52,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:52,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:52,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:52,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293466013] [2024-10-24 01:49:52,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293466013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:52,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:52,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:52,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582441620] [2024-10-24 01:49:52,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:52,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:52,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:52,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:52,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:52,790 INFO L87 Difference]: Start difference. First operand 550 states and 726 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:53,439 INFO L93 Difference]: Finished difference Result 957 states and 1286 transitions. [2024-10-24 01:49:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:49:53,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:49:53,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:53,441 INFO L225 Difference]: With dead ends: 957 [2024-10-24 01:49:53,441 INFO L226 Difference]: Without dead ends: 829 [2024-10-24 01:49:53,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:49:53,442 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 1935 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1935 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:53,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1935 Valid, 1238 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:49:53,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-24 01:49:53,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 550. [2024-10-24 01:49:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.357677902621723) internal successors, (725), 549 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 725 transitions. [2024-10-24 01:49:53,469 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 725 transitions. Word has length 79 [2024-10-24 01:49:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:53,470 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 725 transitions. [2024-10-24 01:49:53,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:53,470 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 725 transitions. [2024-10-24 01:49:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:49:53,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:53,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:53,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 01:49:53,472 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:53,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:53,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1334706002, now seen corresponding path program 1 times [2024-10-24 01:49:53,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:53,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454573410] [2024-10-24 01:49:53,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:53,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:53,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:53,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454573410] [2024-10-24 01:49:53,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454573410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:53,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:53,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:53,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220448531] [2024-10-24 01:49:53,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:53,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:53,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:53,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:53,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:53,715 INFO L87 Difference]: Start difference. First operand 550 states and 725 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:54,318 INFO L93 Difference]: Finished difference Result 955 states and 1282 transitions. [2024-10-24 01:49:54,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:49:54,318 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:49:54,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:54,321 INFO L225 Difference]: With dead ends: 955 [2024-10-24 01:49:54,321 INFO L226 Difference]: Without dead ends: 829 [2024-10-24 01:49:54,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:49:54,322 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 1081 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:54,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 1410 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:49:54,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-24 01:49:54,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 550. [2024-10-24 01:49:54,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.3558052434456929) internal successors, (724), 549 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:54,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 724 transitions. [2024-10-24 01:49:54,333 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 724 transitions. Word has length 79 [2024-10-24 01:49:54,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:54,333 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 724 transitions. [2024-10-24 01:49:54,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:54,334 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 724 transitions. [2024-10-24 01:49:54,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:49:54,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:54,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:54,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 01:49:54,336 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:54,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:54,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1154349460, now seen corresponding path program 1 times [2024-10-24 01:49:54,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:54,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075958596] [2024-10-24 01:49:54,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:54,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:54,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:54,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075958596] [2024-10-24 01:49:54,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075958596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:54,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:54,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:54,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441628778] [2024-10-24 01:49:54,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:54,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:54,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:54,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:54,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:54,570 INFO L87 Difference]: Start difference. First operand 550 states and 724 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:55,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:55,175 INFO L93 Difference]: Finished difference Result 995 states and 1343 transitions. [2024-10-24 01:49:55,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:49:55,176 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:49:55,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:55,178 INFO L225 Difference]: With dead ends: 995 [2024-10-24 01:49:55,178 INFO L226 Difference]: Without dead ends: 845 [2024-10-24 01:49:55,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:49:55,179 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 1832 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1832 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:55,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1832 Valid, 1456 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:49:55,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-10-24 01:49:55,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 550. [2024-10-24 01:49:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.352059925093633) internal successors, (722), 549 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:55,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 722 transitions. [2024-10-24 01:49:55,188 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 722 transitions. Word has length 79 [2024-10-24 01:49:55,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:55,189 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 722 transitions. [2024-10-24 01:49:55,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:55,189 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 722 transitions. [2024-10-24 01:49:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:49:55,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:55,190 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:55,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 01:49:55,191 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:55,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:55,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1228420734, now seen corresponding path program 1 times [2024-10-24 01:49:55,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:55,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225285593] [2024-10-24 01:49:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:55,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:55,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:55,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:55,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225285593] [2024-10-24 01:49:55,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225285593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:55,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:55,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:55,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393593791] [2024-10-24 01:49:55,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:55,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:55,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:55,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:55,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:55,494 INFO L87 Difference]: Start difference. First operand 550 states and 722 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:56,092 INFO L93 Difference]: Finished difference Result 963 states and 1288 transitions. [2024-10-24 01:49:56,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:49:56,093 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:49:56,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:56,096 INFO L225 Difference]: With dead ends: 963 [2024-10-24 01:49:56,096 INFO L226 Difference]: Without dead ends: 829 [2024-10-24 01:49:56,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:49:56,097 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1537 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:56,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 1612 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:49:56,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-24 01:49:56,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 550. [2024-10-24 01:49:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.348314606741573) internal successors, (720), 549 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 720 transitions. [2024-10-24 01:49:56,106 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 720 transitions. Word has length 79 [2024-10-24 01:49:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:56,106 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 720 transitions. [2024-10-24 01:49:56,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 720 transitions. [2024-10-24 01:49:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:49:56,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:56,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] [2024-10-24 01:49:56,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 01:49:56,108 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:56,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:56,109 INFO L85 PathProgramCache]: Analyzing trace with hash -327266232, now seen corresponding path program 1 times [2024-10-24 01:49:56,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:56,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281457243] [2024-10-24 01:49:56,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:56,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:56,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:56,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281457243] [2024-10-24 01:49:56,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281457243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:56,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:56,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:56,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099646359] [2024-10-24 01:49:56,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:56,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:56,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:56,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:56,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:56,359 INFO L87 Difference]: Start difference. First operand 550 states and 720 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:56,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:56,917 INFO L93 Difference]: Finished difference Result 1071 states and 1439 transitions. [2024-10-24 01:49:56,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:49:56,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:49:56,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:56,925 INFO L225 Difference]: With dead ends: 1071 [2024-10-24 01:49:56,925 INFO L226 Difference]: Without dead ends: 881 [2024-10-24 01:49:56,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:49:56,926 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 1099 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:56,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 1678 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:49:56,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-10-24 01:49:56,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 550. [2024-10-24 01:49:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.344569288389513) internal successors, (718), 549 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:56,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 718 transitions. [2024-10-24 01:49:56,940 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 718 transitions. Word has length 79 [2024-10-24 01:49:56,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:56,940 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 718 transitions. [2024-10-24 01:49:56,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:56,941 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 718 transitions. [2024-10-24 01:49:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:49:56,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:56,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:56,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 01:49:56,942 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:56,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:56,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1076267745, now seen corresponding path program 1 times [2024-10-24 01:49:56,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:56,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090115540] [2024-10-24 01:49:56,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:56,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:57,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:57,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090115540] [2024-10-24 01:49:57,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090115540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:57,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:57,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:57,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266002747] [2024-10-24 01:49:57,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:57,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:57,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:57,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:57,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:57,204 INFO L87 Difference]: Start difference. First operand 550 states and 718 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:57,783 INFO L93 Difference]: Finished difference Result 834 states and 1089 transitions. [2024-10-24 01:49:57,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:49:57,783 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:49:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:57,785 INFO L225 Difference]: With dead ends: 834 [2024-10-24 01:49:57,785 INFO L226 Difference]: Without dead ends: 829 [2024-10-24 01:49:57,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:49:57,786 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1530 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:57,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1530 Valid, 1612 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:49:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-24 01:49:57,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 550. [2024-10-24 01:49:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.3408239700374531) internal successors, (716), 549 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 716 transitions. [2024-10-24 01:49:57,795 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 716 transitions. Word has length 79 [2024-10-24 01:49:57,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:57,795 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 716 transitions. [2024-10-24 01:49:57,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 716 transitions. [2024-10-24 01:49:57,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:49:57,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:57,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:57,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 01:49:57,797 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:57,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:57,798 INFO L85 PathProgramCache]: Analyzing trace with hash 835929357, now seen corresponding path program 1 times [2024-10-24 01:49:57,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:57,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747046597] [2024-10-24 01:49:57,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:57,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:58,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:58,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:58,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747046597] [2024-10-24 01:49:58,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747046597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:58,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:58,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:58,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612141285] [2024-10-24 01:49:58,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:58,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:58,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:58,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:58,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:58,033 INFO L87 Difference]: Start difference. First operand 550 states and 716 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:58,589 INFO L93 Difference]: Finished difference Result 862 states and 1131 transitions. [2024-10-24 01:49:58,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:49:58,589 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:49:58,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:58,592 INFO L225 Difference]: With dead ends: 862 [2024-10-24 01:49:58,592 INFO L226 Difference]: Without dead ends: 845 [2024-10-24 01:49:58,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:49:58,593 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 1722 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1722 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:58,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1722 Valid, 1565 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:49:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-10-24 01:49:58,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 550. [2024-10-24 01:49:58,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.3370786516853932) internal successors, (714), 549 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 714 transitions. [2024-10-24 01:49:58,603 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 714 transitions. Word has length 79 [2024-10-24 01:49:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:58,603 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 714 transitions. [2024-10-24 01:49:58,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:58,604 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 714 transitions. [2024-10-24 01:49:58,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:49:58,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:58,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:58,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 01:49:58,605 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:58,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:58,606 INFO L85 PathProgramCache]: Analyzing trace with hash -565396271, now seen corresponding path program 1 times [2024-10-24 01:49:58,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:58,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179515126] [2024-10-24 01:49:58,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:58,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:58,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:58,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:58,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179515126] [2024-10-24 01:49:58,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179515126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:58,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:58,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:49:58,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196736847] [2024-10-24 01:49:58,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:58,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:49:58,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:58,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:49:58,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:49:58,853 INFO L87 Difference]: Start difference. First operand 550 states and 714 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:49:59,409 INFO L93 Difference]: Finished difference Result 959 states and 1275 transitions. [2024-10-24 01:49:59,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:49:59,409 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:49:59,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:49:59,411 INFO L225 Difference]: With dead ends: 959 [2024-10-24 01:49:59,411 INFO L226 Difference]: Without dead ends: 829 [2024-10-24 01:49:59,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:49:59,412 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 1523 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:49:59,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1665 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:49:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-24 01:49:59,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 550. [2024-10-24 01:49:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.3333333333333333) internal successors, (712), 549 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 712 transitions. [2024-10-24 01:49:59,435 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 712 transitions. Word has length 79 [2024-10-24 01:49:59,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:49:59,436 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 712 transitions. [2024-10-24 01:49:59,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:49:59,436 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 712 transitions. [2024-10-24 01:49:59,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:49:59,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:49:59,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:49:59,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-24 01:49:59,437 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:49:59,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:49:59,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1831404320, now seen corresponding path program 1 times [2024-10-24 01:49:59,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:49:59,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044265771] [2024-10-24 01:49:59,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:49:59,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:49:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:49:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:49:59,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:49:59,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044265771] [2024-10-24 01:49:59,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044265771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:49:59,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:49:59,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:49:59,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701962964] [2024-10-24 01:49:59,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:49:59,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:49:59,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:49:59,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:49:59,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:49:59,862 INFO L87 Difference]: Start difference. First operand 550 states and 712 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:00,768 INFO L93 Difference]: Finished difference Result 1154 states and 1555 transitions. [2024-10-24 01:50:00,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 01:50:00,769 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:50:00,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:00,771 INFO L225 Difference]: With dead ends: 1154 [2024-10-24 01:50:00,772 INFO L226 Difference]: Without dead ends: 1149 [2024-10-24 01:50:00,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-24 01:50:00,773 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 4042 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4042 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:00,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4042 Valid, 1387 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:50:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2024-10-24 01:50:00,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 558. [2024-10-24 01:50:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 542 states have (on average 1.3284132841328413) internal successors, (720), 557 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 720 transitions. [2024-10-24 01:50:00,781 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 720 transitions. Word has length 79 [2024-10-24 01:50:00,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:00,781 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 720 transitions. [2024-10-24 01:50:00,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:00,781 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 720 transitions. [2024-10-24 01:50:00,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:50:00,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:00,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:00,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-24 01:50:00,783 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:00,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:00,783 INFO L85 PathProgramCache]: Analyzing trace with hash -134038314, now seen corresponding path program 1 times [2024-10-24 01:50:00,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:00,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382132449] [2024-10-24 01:50:00,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:00,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:00,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:00,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:00,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382132449] [2024-10-24 01:50:01,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382132449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:01,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:01,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:01,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606908896] [2024-10-24 01:50:01,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:01,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:01,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:01,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:01,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:01,001 INFO L87 Difference]: Start difference. First operand 558 states and 720 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:01,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:01,531 INFO L93 Difference]: Finished difference Result 996 states and 1324 transitions. [2024-10-24 01:50:01,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:50:01,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-24 01:50:01,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:01,533 INFO L225 Difference]: With dead ends: 996 [2024-10-24 01:50:01,534 INFO L226 Difference]: Without dead ends: 853 [2024-10-24 01:50:01,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:50:01,534 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 1110 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:01,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1617 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:50:01,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-10-24 01:50:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 554. [2024-10-24 01:50:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 538 states have (on average 1.328996282527881) internal successors, (715), 553 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:01,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 715 transitions. [2024-10-24 01:50:01,543 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 715 transitions. Word has length 80 [2024-10-24 01:50:01,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:01,544 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 715 transitions. [2024-10-24 01:50:01,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 715 transitions. [2024-10-24 01:50:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:50:01,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:01,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:01,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-24 01:50:01,546 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:01,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:01,546 INFO L85 PathProgramCache]: Analyzing trace with hash -234721971, now seen corresponding path program 1 times [2024-10-24 01:50:01,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:01,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806301596] [2024-10-24 01:50:01,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:01,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:01,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:01,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806301596] [2024-10-24 01:50:01,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806301596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:01,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:01,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:01,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765690569] [2024-10-24 01:50:01,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:01,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:01,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:01,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:01,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:01,783 INFO L87 Difference]: Start difference. First operand 554 states and 715 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:02,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:02,487 INFO L93 Difference]: Finished difference Result 991 states and 1317 transitions. [2024-10-24 01:50:02,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:50:02,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-24 01:50:02,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:02,490 INFO L225 Difference]: With dead ends: 991 [2024-10-24 01:50:02,490 INFO L226 Difference]: Without dead ends: 853 [2024-10-24 01:50:02,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2024-10-24 01:50:02,491 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 1651 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:02,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 1649 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:50:02,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-10-24 01:50:02,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 550. [2024-10-24 01:50:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.3295880149812733) internal successors, (710), 549 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 710 transitions. [2024-10-24 01:50:02,500 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 710 transitions. Word has length 80 [2024-10-24 01:50:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:02,500 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 710 transitions. [2024-10-24 01:50:02,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 710 transitions. [2024-10-24 01:50:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:50:02,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:02,502 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:02,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-24 01:50:02,502 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:02,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:02,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1205126979, now seen corresponding path program 1 times [2024-10-24 01:50:02,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:02,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278001793] [2024-10-24 01:50:02,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:02,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:02,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:02,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278001793] [2024-10-24 01:50:02,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278001793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:02,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:02,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:02,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434848198] [2024-10-24 01:50:02,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:02,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:02,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:02,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:02,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:02,717 INFO L87 Difference]: Start difference. First operand 550 states and 710 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:03,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:03,237 INFO L93 Difference]: Finished difference Result 826 states and 1071 transitions. [2024-10-24 01:50:03,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:50:03,238 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-24 01:50:03,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:03,241 INFO L225 Difference]: With dead ends: 826 [2024-10-24 01:50:03,241 INFO L226 Difference]: Without dead ends: 821 [2024-10-24 01:50:03,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:50:03,242 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 1174 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:03,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 1426 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:50:03,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-10-24 01:50:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 542. [2024-10-24 01:50:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3307984790874525) internal successors, (700), 541 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 700 transitions. [2024-10-24 01:50:03,250 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 700 transitions. Word has length 80 [2024-10-24 01:50:03,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:03,250 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 700 transitions. [2024-10-24 01:50:03,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:03,250 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 700 transitions. [2024-10-24 01:50:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:50:03,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:03,251 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:03,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-24 01:50:03,252 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:03,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:03,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1961223322, now seen corresponding path program 1 times [2024-10-24 01:50:03,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:03,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863370656] [2024-10-24 01:50:03,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:03,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:03,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:03,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863370656] [2024-10-24 01:50:03,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863370656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:03,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:03,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 01:50:03,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433189640] [2024-10-24 01:50:03,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:03,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 01:50:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:03,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 01:50:03,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 01:50:03,747 INFO L87 Difference]: Start difference. First operand 542 states and 700 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:04,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:04,084 INFO L93 Difference]: Finished difference Result 860 states and 1142 transitions. [2024-10-24 01:50:04,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 01:50:04,085 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-24 01:50:04,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:04,087 INFO L225 Difference]: With dead ends: 860 [2024-10-24 01:50:04,087 INFO L226 Difference]: Without dead ends: 617 [2024-10-24 01:50:04,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:50:04,088 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 1569 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:04,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 1148 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:04,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-10-24 01:50:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 425. [2024-10-24 01:50:04,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 414 states have (on average 1.3357487922705313) internal successors, (553), 424 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:04,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 553 transitions. [2024-10-24 01:50:04,095 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 553 transitions. Word has length 81 [2024-10-24 01:50:04,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:04,095 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 553 transitions. [2024-10-24 01:50:04,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 553 transitions. [2024-10-24 01:50:04,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:50:04,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:04,096 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:04,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-24 01:50:04,097 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:04,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:04,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1832785083, now seen corresponding path program 1 times [2024-10-24 01:50:04,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:04,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939181041] [2024-10-24 01:50:04,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:04,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:04,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:04,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939181041] [2024-10-24 01:50:04,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939181041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:04,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:04,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 01:50:04,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110887904] [2024-10-24 01:50:04,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:04,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:50:04,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:04,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:50:04,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:50:04,653 INFO L87 Difference]: Start difference. First operand 425 states and 553 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:05,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:05,301 INFO L93 Difference]: Finished difference Result 767 states and 1037 transitions. [2024-10-24 01:50:05,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:50:05,302 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-24 01:50:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:05,303 INFO L225 Difference]: With dead ends: 767 [2024-10-24 01:50:05,303 INFO L226 Difference]: Without dead ends: 635 [2024-10-24 01:50:05,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-24 01:50:05,304 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1816 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1816 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:05,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1816 Valid, 1616 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:50:05,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-10-24 01:50:05,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 413. [2024-10-24 01:50:05,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 403 states have (on average 1.3300248138957815) internal successors, (536), 412 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:05,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 536 transitions. [2024-10-24 01:50:05,313 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 536 transitions. Word has length 81 [2024-10-24 01:50:05,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:05,313 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 536 transitions. [2024-10-24 01:50:05,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:05,314 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 536 transitions. [2024-10-24 01:50:05,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:50:05,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:05,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:05,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-24 01:50:05,315 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:05,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:05,316 INFO L85 PathProgramCache]: Analyzing trace with hash 52267935, now seen corresponding path program 1 times [2024-10-24 01:50:05,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:05,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700534405] [2024-10-24 01:50:05,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:05,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:05,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:05,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:05,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700534405] [2024-10-24 01:50:05,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700534405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:05,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:05,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 01:50:05,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946812041] [2024-10-24 01:50:05,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:05,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:50:05,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:05,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:50:05,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:50:05,791 INFO L87 Difference]: Start difference. First operand 413 states and 536 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:06,335 INFO L93 Difference]: Finished difference Result 743 states and 1015 transitions. [2024-10-24 01:50:06,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:50:06,336 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-24 01:50:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:06,337 INFO L225 Difference]: With dead ends: 743 [2024-10-24 01:50:06,337 INFO L226 Difference]: Without dead ends: 575 [2024-10-24 01:50:06,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-24 01:50:06,338 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 1399 mSDsluCounter, 2066 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 2442 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:06,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1399 Valid, 2442 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-10-24 01:50:06,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 371. [2024-10-24 01:50:06,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 363 states have (on average 1.3278236914600552) internal successors, (482), 370 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:06,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 482 transitions. [2024-10-24 01:50:06,369 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 482 transitions. Word has length 81 [2024-10-24 01:50:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:06,369 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 482 transitions. [2024-10-24 01:50:06,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 482 transitions. [2024-10-24 01:50:06,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:50:06,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:06,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] [2024-10-24 01:50:06,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-24 01:50:06,371 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:06,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:06,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1340490679, now seen corresponding path program 1 times [2024-10-24 01:50:06,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:06,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943160467] [2024-10-24 01:50:06,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:06,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:08,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:08,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943160467] [2024-10-24 01:50:08,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943160467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:08,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:08,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-10-24 01:50:08,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529611802] [2024-10-24 01:50:08,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:08,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-24 01:50:08,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:08,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-24 01:50:08,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2024-10-24 01:50:08,167 INFO L87 Difference]: Start difference. First operand 371 states and 482 transitions. Second operand has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 28 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:10,349 INFO L93 Difference]: Finished difference Result 713 states and 968 transitions. [2024-10-24 01:50:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-24 01:50:10,349 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 28 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-24 01:50:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:10,351 INFO L225 Difference]: With dead ends: 713 [2024-10-24 01:50:10,351 INFO L226 Difference]: Without dead ends: 583 [2024-10-24 01:50:10,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=404, Invalid=2248, Unknown=0, NotChecked=0, Total=2652 [2024-10-24 01:50:10,352 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 1018 mSDsluCounter, 3851 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 4090 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:10,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 4090 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 01:50:10,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-10-24 01:50:10,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 386. [2024-10-24 01:50:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 378 states have (on average 1.3306878306878307) internal successors, (503), 385 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 503 transitions. [2024-10-24 01:50:10,361 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 503 transitions. Word has length 81 [2024-10-24 01:50:10,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:10,362 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 503 transitions. [2024-10-24 01:50:10,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 28 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 503 transitions. [2024-10-24 01:50:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:50:10,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:10,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:10,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-24 01:50:10,363 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:10,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:10,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1064681092, now seen corresponding path program 1 times [2024-10-24 01:50:10,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:10,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815270218] [2024-10-24 01:50:10,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:10,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:11,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:11,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815270218] [2024-10-24 01:50:11,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815270218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:11,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:11,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-10-24 01:50:11,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492969039] [2024-10-24 01:50:11,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:11,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 01:50:11,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:11,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 01:50:11,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2024-10-24 01:50:11,611 INFO L87 Difference]: Start difference. First operand 386 states and 503 transitions. Second operand has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:13,150 INFO L93 Difference]: Finished difference Result 757 states and 1028 transitions. [2024-10-24 01:50:13,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 01:50:13,151 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-24 01:50:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:13,152 INFO L225 Difference]: With dead ends: 757 [2024-10-24 01:50:13,152 INFO L226 Difference]: Without dead ends: 597 [2024-10-24 01:50:13,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=274, Invalid=1286, Unknown=0, NotChecked=0, Total=1560 [2024-10-24 01:50:13,153 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 804 mSDsluCounter, 3749 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 4045 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:13,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 4045 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:50:13,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-10-24 01:50:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 392. [2024-10-24 01:50:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.3255208333333333) internal successors, (509), 391 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 509 transitions. [2024-10-24 01:50:13,160 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 509 transitions. Word has length 81 [2024-10-24 01:50:13,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:13,160 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 509 transitions. [2024-10-24 01:50:13,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 509 transitions. [2024-10-24 01:50:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:50:13,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:13,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:13,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-24 01:50:13,162 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:13,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:13,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1002840708, now seen corresponding path program 1 times [2024-10-24 01:50:13,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:13,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309768612] [2024-10-24 01:50:13,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:13,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:13,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:13,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:13,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309768612] [2024-10-24 01:50:13,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309768612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:13,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:13,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 01:50:13,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918130699] [2024-10-24 01:50:13,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:13,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:50:13,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:13,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:50:13,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:50:13,570 INFO L87 Difference]: Start difference. First operand 392 states and 509 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:13,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:13,971 INFO L93 Difference]: Finished difference Result 717 states and 980 transitions. [2024-10-24 01:50:13,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:50:13,971 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-24 01:50:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:13,972 INFO L225 Difference]: With dead ends: 717 [2024-10-24 01:50:13,972 INFO L226 Difference]: Without dead ends: 549 [2024-10-24 01:50:13,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-24 01:50:13,973 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 1224 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:13,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 2000 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-10-24 01:50:13,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 350. [2024-10-24 01:50:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 343 states have (on average 1.3236151603498543) internal successors, (454), 349 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 454 transitions. [2024-10-24 01:50:13,978 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 454 transitions. Word has length 81 [2024-10-24 01:50:13,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:13,979 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 454 transitions. [2024-10-24 01:50:13,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:13,979 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 454 transitions. [2024-10-24 01:50:13,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 01:50:13,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:13,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:13,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-24 01:50:13,980 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:13,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:13,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1580070937, now seen corresponding path program 1 times [2024-10-24 01:50:13,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:13,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340638438] [2024-10-24 01:50:13,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:13,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:14,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:14,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340638438] [2024-10-24 01:50:14,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340638438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:14,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:14,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 01:50:14,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872556462] [2024-10-24 01:50:14,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:14,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 01:50:14,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:14,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 01:50:14,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:50:14,765 INFO L87 Difference]: Start difference. First operand 350 states and 454 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:16,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:16,079 INFO L93 Difference]: Finished difference Result 828 states and 1126 transitions. [2024-10-24 01:50:16,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 01:50:16,080 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-24 01:50:16,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:16,081 INFO L225 Difference]: With dead ends: 828 [2024-10-24 01:50:16,081 INFO L226 Difference]: Without dead ends: 698 [2024-10-24 01:50:16,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2024-10-24 01:50:16,081 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 1974 mSDsluCounter, 1798 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1974 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:16,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1974 Valid, 2039 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:50:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-24 01:50:16,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 344. [2024-10-24 01:50:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 337 states have (on average 1.317507418397626) internal successors, (444), 343 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 444 transitions. [2024-10-24 01:50:16,087 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 444 transitions. Word has length 82 [2024-10-24 01:50:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:16,087 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 444 transitions. [2024-10-24 01:50:16,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 444 transitions. [2024-10-24 01:50:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 01:50:16,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:16,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:16,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-24 01:50:16,088 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:16,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:16,089 INFO L85 PathProgramCache]: Analyzing trace with hash -814304105, now seen corresponding path program 1 times [2024-10-24 01:50:16,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:16,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856497069] [2024-10-24 01:50:16,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:16,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:17,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:17,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856497069] [2024-10-24 01:50:17,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856497069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:17,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:17,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-24 01:50:17,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755472029] [2024-10-24 01:50:17,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:17,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 01:50:17,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:17,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 01:50:17,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2024-10-24 01:50:17,409 INFO L87 Difference]: Start difference. First operand 344 states and 444 transitions. Second operand has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:18,908 INFO L93 Difference]: Finished difference Result 501 states and 673 transitions. [2024-10-24 01:50:18,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 01:50:18,908 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-24 01:50:18,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:18,909 INFO L225 Difference]: With dead ends: 501 [2024-10-24 01:50:18,909 INFO L226 Difference]: Without dead ends: 371 [2024-10-24 01:50:18,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2024-10-24 01:50:18,910 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 521 mSDsluCounter, 2836 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 3023 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:18,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 3023 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:50:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-24 01:50:18,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 345. [2024-10-24 01:50:18,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 338 states have (on average 1.316568047337278) internal successors, (445), 344 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 445 transitions. [2024-10-24 01:50:18,914 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 445 transitions. Word has length 82 [2024-10-24 01:50:18,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:18,914 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 445 transitions. [2024-10-24 01:50:18,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:18,914 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 445 transitions. [2024-10-24 01:50:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 01:50:18,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:18,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:18,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-24 01:50:18,915 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:18,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash -678951119, now seen corresponding path program 1 times [2024-10-24 01:50:18,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:18,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603086061] [2024-10-24 01:50:18,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:18,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:19,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:19,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603086061] [2024-10-24 01:50:19,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603086061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:19,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:19,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:19,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789591122] [2024-10-24 01:50:19,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:19,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:19,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:19,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:19,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:19,166 INFO L87 Difference]: Start difference. First operand 345 states and 445 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:19,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:19,518 INFO L93 Difference]: Finished difference Result 532 states and 701 transitions. [2024-10-24 01:50:19,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:50:19,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-24 01:50:19,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:19,519 INFO L225 Difference]: With dead ends: 532 [2024-10-24 01:50:19,519 INFO L226 Difference]: Without dead ends: 525 [2024-10-24 01:50:19,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:50:19,520 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 799 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:19,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 817 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:50:19,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-10-24 01:50:19,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 345. [2024-10-24 01:50:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 338 states have (on average 1.3106508875739644) internal successors, (443), 344 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 443 transitions. [2024-10-24 01:50:19,523 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 443 transitions. Word has length 82 [2024-10-24 01:50:19,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:19,524 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 443 transitions. [2024-10-24 01:50:19,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:19,524 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 443 transitions. [2024-10-24 01:50:19,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 01:50:19,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:19,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:19,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-24 01:50:19,525 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:19,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:19,525 INFO L85 PathProgramCache]: Analyzing trace with hash -748534451, now seen corresponding path program 1 times [2024-10-24 01:50:19,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:19,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819178621] [2024-10-24 01:50:19,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:19,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:19,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:19,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819178621] [2024-10-24 01:50:19,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819178621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:19,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:19,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:50:19,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079041065] [2024-10-24 01:50:19,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:19,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:50:19,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:19,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:50:19,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:19,900 INFO L87 Difference]: Start difference. First operand 345 states and 443 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:20,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:20,672 INFO L93 Difference]: Finished difference Result 1119 states and 1559 transitions. [2024-10-24 01:50:20,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 01:50:20,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-24 01:50:20,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:20,674 INFO L225 Difference]: With dead ends: 1119 [2024-10-24 01:50:20,674 INFO L226 Difference]: Without dead ends: 963 [2024-10-24 01:50:20,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2024-10-24 01:50:20,674 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 2086 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2086 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:20,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2086 Valid, 1156 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:20,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-10-24 01:50:20,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 357. [2024-10-24 01:50:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 350 states have (on average 1.3) internal successors, (455), 356 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:20,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 455 transitions. [2024-10-24 01:50:20,680 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 455 transitions. Word has length 82 [2024-10-24 01:50:20,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:20,680 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 455 transitions. [2024-10-24 01:50:20,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:20,680 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 455 transitions. [2024-10-24 01:50:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 01:50:20,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:20,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:20,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-24 01:50:20,681 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:20,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:20,682 INFO L85 PathProgramCache]: Analyzing trace with hash -689786806, now seen corresponding path program 1 times [2024-10-24 01:50:20,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:20,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623960639] [2024-10-24 01:50:20,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:20,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:21,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:21,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623960639] [2024-10-24 01:50:21,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623960639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:21,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:21,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 01:50:21,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728859810] [2024-10-24 01:50:21,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:21,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 01:50:21,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:21,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 01:50:21,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:50:21,177 INFO L87 Difference]: Start difference. First operand 357 states and 455 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:21,824 INFO L93 Difference]: Finished difference Result 999 states and 1376 transitions. [2024-10-24 01:50:21,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 01:50:21,824 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-24 01:50:21,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:21,825 INFO L225 Difference]: With dead ends: 999 [2024-10-24 01:50:21,825 INFO L226 Difference]: Without dead ends: 853 [2024-10-24 01:50:21,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-24 01:50:21,826 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 1793 mSDsluCounter, 1855 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1793 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:21,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1793 Valid, 2099 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:21,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-10-24 01:50:21,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 321. [2024-10-24 01:50:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 316 states have (on average 1.3006329113924051) internal successors, (411), 320 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 411 transitions. [2024-10-24 01:50:21,832 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 411 transitions. Word has length 82 [2024-10-24 01:50:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:21,832 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 411 transitions. [2024-10-24 01:50:21,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 411 transitions. [2024-10-24 01:50:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 01:50:21,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:21,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:21,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-24 01:50:21,834 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:21,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:21,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1693741357, now seen corresponding path program 1 times [2024-10-24 01:50:21,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:21,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117778853] [2024-10-24 01:50:21,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:21,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:22,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:22,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:22,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117778853] [2024-10-24 01:50:22,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117778853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:22,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:22,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 01:50:22,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859735117] [2024-10-24 01:50:22,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:22,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 01:50:22,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:22,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 01:50:22,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:50:22,329 INFO L87 Difference]: Start difference. First operand 321 states and 411 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:22,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:22,811 INFO L93 Difference]: Finished difference Result 637 states and 866 transitions. [2024-10-24 01:50:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:50:22,812 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-24 01:50:22,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:22,812 INFO L225 Difference]: With dead ends: 637 [2024-10-24 01:50:22,812 INFO L226 Difference]: Without dead ends: 451 [2024-10-24 01:50:22,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2024-10-24 01:50:22,813 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 466 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 2627 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:22,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 2627 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-10-24 01:50:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 261. [2024-10-24 01:50:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 259 states have (on average 1.308880308880309) internal successors, (339), 260 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 339 transitions. [2024-10-24 01:50:22,817 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 339 transitions. Word has length 82 [2024-10-24 01:50:22,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:22,817 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 339 transitions. [2024-10-24 01:50:22,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 339 transitions. [2024-10-24 01:50:22,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 01:50:22,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:22,818 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:22,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-24 01:50:22,818 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:22,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:22,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1172303981, now seen corresponding path program 1 times [2024-10-24 01:50:22,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:22,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117443169] [2024-10-24 01:50:22,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:22,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:23,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:23,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:23,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117443169] [2024-10-24 01:50:23,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117443169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:23,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:23,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:23,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530375452] [2024-10-24 01:50:23,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:23,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:23,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:23,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:23,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:23,022 INFO L87 Difference]: Start difference. First operand 261 states and 339 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:23,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:23,342 INFO L93 Difference]: Finished difference Result 583 states and 801 transitions. [2024-10-24 01:50:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:50:23,342 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-10-24 01:50:23,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:23,343 INFO L225 Difference]: With dead ends: 583 [2024-10-24 01:50:23,343 INFO L226 Difference]: Without dead ends: 427 [2024-10-24 01:50:23,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:50:23,344 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 411 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:23,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 762 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:23,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-10-24 01:50:23,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 253. [2024-10-24 01:50:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 251 states have (on average 1.3107569721115537) internal successors, (329), 252 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:23,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 329 transitions. [2024-10-24 01:50:23,348 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 329 transitions. Word has length 83 [2024-10-24 01:50:23,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:23,348 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 329 transitions. [2024-10-24 01:50:23,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:23,348 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 329 transitions. [2024-10-24 01:50:23,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 01:50:23,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:23,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] [2024-10-24 01:50:23,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-24 01:50:23,349 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:23,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:23,349 INFO L85 PathProgramCache]: Analyzing trace with hash -633529937, now seen corresponding path program 1 times [2024-10-24 01:50:23,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:23,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946657124] [2024-10-24 01:50:23,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:23,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:24,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:24,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946657124] [2024-10-24 01:50:24,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946657124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:24,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:24,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-10-24 01:50:24,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882303842] [2024-10-24 01:50:24,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:24,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 01:50:24,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:24,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 01:50:24,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2024-10-24 01:50:24,352 INFO L87 Difference]: Start difference. First operand 253 states and 329 transitions. Second operand has 26 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:25,717 INFO L93 Difference]: Finished difference Result 410 states and 554 transitions. [2024-10-24 01:50:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-24 01:50:25,718 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-10-24 01:50:25,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:25,718 INFO L225 Difference]: With dead ends: 410 [2024-10-24 01:50:25,718 INFO L226 Difference]: Without dead ends: 271 [2024-10-24 01:50:25,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=303, Invalid=1859, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 01:50:25,719 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 485 mSDsluCounter, 2334 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:25,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 2477 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:50:25,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-24 01:50:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2024-10-24 01:50:25,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 267 states have (on average 1.303370786516854) internal successors, (348), 268 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 348 transitions. [2024-10-24 01:50:25,722 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 348 transitions. Word has length 84 [2024-10-24 01:50:25,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:25,722 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 348 transitions. [2024-10-24 01:50:25,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:25,722 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 348 transitions. [2024-10-24 01:50:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 01:50:25,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:25,723 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-10-24 01:50:25,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-24 01:50:25,723 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:25,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:25,723 INFO L85 PathProgramCache]: Analyzing trace with hash 362850175, now seen corresponding path program 1 times [2024-10-24 01:50:25,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:25,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035647260] [2024-10-24 01:50:25,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:25,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:26,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:26,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035647260] [2024-10-24 01:50:26,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035647260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:26,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:26,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 01:50:26,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565863990] [2024-10-24 01:50:26,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:26,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 01:50:26,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:26,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 01:50:26,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:50:26,361 INFO L87 Difference]: Start difference. First operand 269 states and 348 transitions. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 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-10-24 01:50:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:27,336 INFO L93 Difference]: Finished difference Result 573 states and 784 transitions. [2024-10-24 01:50:27,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 01:50:27,337 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 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-10-24 01:50:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:27,338 INFO L225 Difference]: With dead ends: 573 [2024-10-24 01:50:27,338 INFO L226 Difference]: Without dead ends: 567 [2024-10-24 01:50:27,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=201, Invalid=669, Unknown=0, NotChecked=0, Total=870 [2024-10-24 01:50:27,339 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 1090 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:27,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 2473 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:50:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-10-24 01:50:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 269. [2024-10-24 01:50:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 267 states have (on average 1.299625468164794) internal successors, (347), 268 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 347 transitions. [2024-10-24 01:50:27,343 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 347 transitions. Word has length 85 [2024-10-24 01:50:27,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:27,344 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 347 transitions. [2024-10-24 01:50:27,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 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-10-24 01:50:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 347 transitions. [2024-10-24 01:50:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 01:50:27,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:27,345 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-10-24 01:50:27,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-24 01:50:27,345 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:27,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:27,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1543734065, now seen corresponding path program 1 times [2024-10-24 01:50:27,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:27,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580114084] [2024-10-24 01:50:27,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:27,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:27,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:27,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580114084] [2024-10-24 01:50:27,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580114084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:27,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:27,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 01:50:27,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015654927] [2024-10-24 01:50:27,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:27,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:50:27,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:27,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:50:27,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:50:27,739 INFO L87 Difference]: Start difference. First operand 269 states and 347 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 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-10-24 01:50:28,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:28,116 INFO L93 Difference]: Finished difference Result 421 states and 568 transitions. [2024-10-24 01:50:28,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:50:28,116 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 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-10-24 01:50:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:28,117 INFO L225 Difference]: With dead ends: 421 [2024-10-24 01:50:28,117 INFO L226 Difference]: Without dead ends: 415 [2024-10-24 01:50:28,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-24 01:50:28,118 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 682 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:28,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1526 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-24 01:50:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 262. [2024-10-24 01:50:28,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:28,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 340 transitions. [2024-10-24 01:50:28,121 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 340 transitions. Word has length 85 [2024-10-24 01:50:28,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:28,121 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 340 transitions. [2024-10-24 01:50:28,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 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-10-24 01:50:28,121 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 340 transitions. [2024-10-24 01:50:28,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 01:50:28,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:28,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:28,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-24 01:50:28,122 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:28,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:28,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1137760319, now seen corresponding path program 1 times [2024-10-24 01:50:28,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:28,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338959295] [2024-10-24 01:50:28,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:28,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:28,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:28,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:28,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338959295] [2024-10-24 01:50:28,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338959295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:28,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:28,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:28,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661528373] [2024-10-24 01:50:28,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:28,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:28,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:28,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:28,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:28,229 INFO L87 Difference]: Start difference. First operand 262 states and 340 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:28,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:28,356 INFO L93 Difference]: Finished difference Result 1522 states and 2240 transitions. [2024-10-24 01:50:28,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:50:28,356 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-24 01:50:28,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:28,358 INFO L225 Difference]: With dead ends: 1522 [2024-10-24 01:50:28,358 INFO L226 Difference]: Without dead ends: 1396 [2024-10-24 01:50:28,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-24 01:50:28,359 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1497 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:28,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1540 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-10-24 01:50:28,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 386. [2024-10-24 01:50:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.3636363636363635) internal successors, (525), 385 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 525 transitions. [2024-10-24 01:50:28,366 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 525 transitions. Word has length 111 [2024-10-24 01:50:28,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:28,366 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 525 transitions. [2024-10-24 01:50:28,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:28,367 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 525 transitions. [2024-10-24 01:50:28,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 01:50:28,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:28,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:28,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-24 01:50:28,368 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:28,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:28,368 INFO L85 PathProgramCache]: Analyzing trace with hash 306859352, now seen corresponding path program 1 times [2024-10-24 01:50:28,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:28,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646824742] [2024-10-24 01:50:28,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:28,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:28,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:28,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646824742] [2024-10-24 01:50:28,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646824742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:28,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:28,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:28,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852659629] [2024-10-24 01:50:28,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:28,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:28,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:28,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:28,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:28,487 INFO L87 Difference]: Start difference. First operand 386 states and 525 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:28,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:28,576 INFO L93 Difference]: Finished difference Result 1762 states and 2586 transitions. [2024-10-24 01:50:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:50:28,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-24 01:50:28,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:28,579 INFO L225 Difference]: With dead ends: 1762 [2024-10-24 01:50:28,579 INFO L226 Difference]: Without dead ends: 1512 [2024-10-24 01:50:28,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:28,580 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 1197 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:28,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 945 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:28,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-24 01:50:28,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 634. [2024-10-24 01:50:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 1.4170616113744077) internal successors, (897), 633 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:28,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 897 transitions. [2024-10-24 01:50:28,591 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 897 transitions. Word has length 113 [2024-10-24 01:50:28,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:28,591 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 897 transitions. [2024-10-24 01:50:28,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 897 transitions. [2024-10-24 01:50:28,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 01:50:28,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:28,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:28,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-24 01:50:28,593 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:28,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:28,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2032245473, now seen corresponding path program 1 times [2024-10-24 01:50:28,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:28,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584535408] [2024-10-24 01:50:28,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:28,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:28,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:28,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584535408] [2024-10-24 01:50:28,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584535408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:28,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:28,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:28,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168696732] [2024-10-24 01:50:28,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:28,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:28,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:28,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:28,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:28,808 INFO L87 Difference]: Start difference. First operand 634 states and 897 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:28,906 INFO L93 Difference]: Finished difference Result 1134 states and 1645 transitions. [2024-10-24 01:50:28,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:50:28,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-24 01:50:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:28,908 INFO L225 Difference]: With dead ends: 1134 [2024-10-24 01:50:28,908 INFO L226 Difference]: Without dead ends: 636 [2024-10-24 01:50:28,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-24 01:50:28,909 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 252 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:28,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 552 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:50:28,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-10-24 01:50:28,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 634. [2024-10-24 01:50:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 1.410742496050553) internal successors, (893), 633 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:28,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 893 transitions. [2024-10-24 01:50:28,917 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 893 transitions. Word has length 113 [2024-10-24 01:50:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:28,917 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 893 transitions. [2024-10-24 01:50:28,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:28,919 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 893 transitions. [2024-10-24 01:50:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 01:50:28,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:28,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:28,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-10-24 01:50:28,921 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:28,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:28,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1292505152, now seen corresponding path program 1 times [2024-10-24 01:50:28,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:28,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702507714] [2024-10-24 01:50:28,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:28,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:28,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:28,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:28,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702507714] [2024-10-24 01:50:28,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702507714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:28,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:28,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:50:28,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861585119] [2024-10-24 01:50:28,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:28,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:50:28,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:28,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:50:28,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:28,980 INFO L87 Difference]: Start difference. First operand 634 states and 893 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:29,001 INFO L93 Difference]: Finished difference Result 1578 states and 2291 transitions. [2024-10-24 01:50:29,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:50:29,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-24 01:50:29,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:29,003 INFO L225 Difference]: With dead ends: 1578 [2024-10-24 01:50:29,003 INFO L226 Difference]: Without dead ends: 1080 [2024-10-24 01:50:29,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:29,004 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 112 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:29,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 306 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:50:29,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2024-10-24 01:50:29,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1070. [2024-10-24 01:50:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 1069 states have (on average 1.420954162768943) internal successors, (1519), 1069 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:29,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1519 transitions. [2024-10-24 01:50:29,017 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1519 transitions. Word has length 113 [2024-10-24 01:50:29,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:29,017 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1519 transitions. [2024-10-24 01:50:29,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:29,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1519 transitions. [2024-10-24 01:50:29,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 01:50:29,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:29,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-10-24 01:50:29,020 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:29,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:29,020 INFO L85 PathProgramCache]: Analyzing trace with hash 385060138, now seen corresponding path program 1 times [2024-10-24 01:50:29,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:29,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614747101] [2024-10-24 01:50:29,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:29,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:29,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:29,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614747101] [2024-10-24 01:50:29,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614747101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:29,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:29,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:29,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843438648] [2024-10-24 01:50:29,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:29,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:29,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:29,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:29,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:29,151 INFO L87 Difference]: Start difference. First operand 1070 states and 1519 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:29,260 INFO L93 Difference]: Finished difference Result 3646 states and 5295 transitions. [2024-10-24 01:50:29,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:50:29,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-24 01:50:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:29,267 INFO L225 Difference]: With dead ends: 3646 [2024-10-24 01:50:29,267 INFO L226 Difference]: Without dead ends: 3178 [2024-10-24 01:50:29,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:29,269 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1118 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:29,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 1020 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:29,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2024-10-24 01:50:29,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 1770. [2024-10-24 01:50:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1769 states have (on average 1.4364047484454494) internal successors, (2541), 1769 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2541 transitions. [2024-10-24 01:50:29,299 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2541 transitions. Word has length 113 [2024-10-24 01:50:29,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:29,299 INFO L471 AbstractCegarLoop]: Abstraction has 1770 states and 2541 transitions. [2024-10-24 01:50:29,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:29,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2541 transitions. [2024-10-24 01:50:29,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 01:50:29,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:29,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:29,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-24 01:50:29,302 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:29,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:29,302 INFO L85 PathProgramCache]: Analyzing trace with hash -734359452, now seen corresponding path program 1 times [2024-10-24 01:50:29,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:29,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350764568] [2024-10-24 01:50:29,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:29,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:29,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:29,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:29,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350764568] [2024-10-24 01:50:29,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350764568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:29,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:29,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:29,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019052838] [2024-10-24 01:50:29,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:29,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:29,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:29,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:29,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:29,453 INFO L87 Difference]: Start difference. First operand 1770 states and 2541 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:29,575 INFO L93 Difference]: Finished difference Result 4112 states and 5977 transitions. [2024-10-24 01:50:29,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:50:29,575 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-24 01:50:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:29,581 INFO L225 Difference]: With dead ends: 4112 [2024-10-24 01:50:29,581 INFO L226 Difference]: Without dead ends: 3644 [2024-10-24 01:50:29,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:29,583 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1013 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:29,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 1068 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:29,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2024-10-24 01:50:29,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 2236. [2024-10-24 01:50:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 2235 states have (on average 1.4420581655480984) internal successors, (3223), 2235 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 3223 transitions. [2024-10-24 01:50:29,617 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 3223 transitions. Word has length 113 [2024-10-24 01:50:29,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:29,617 INFO L471 AbstractCegarLoop]: Abstraction has 2236 states and 3223 transitions. [2024-10-24 01:50:29,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:29,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 3223 transitions. [2024-10-24 01:50:29,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 01:50:29,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:29,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:29,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-10-24 01:50:29,621 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:29,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:29,622 INFO L85 PathProgramCache]: Analyzing trace with hash -601785570, now seen corresponding path program 1 times [2024-10-24 01:50:29,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:29,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782825807] [2024-10-24 01:50:29,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:29,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat