/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 02:25:27,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 02:25:27,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 02:25:27,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 02:25:27,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 02:25:27,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 02:25:27,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 02:25:27,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 02:25:27,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 02:25:27,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 02:25:27,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 02:25:27,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 02:25:27,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 02:25:27,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 02:25:27,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 02:25:27,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 02:25:27,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 02:25:27,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 02:25:27,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 02:25:27,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 02:25:27,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 02:25:27,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 02:25:27,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 02:25:27,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 02:25:27,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 02:25:27,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 02:25:27,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 02:25:27,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 02:25:27,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 02:25:27,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 02:25:27,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 02:25:27,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 02:25:27,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 02:25:27,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 02:25:27,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 02:25:27,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 02:25:27,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 02:25:27,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 02:25:27,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 02:25:27,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 02:25:27,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 02:25:27,229 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-01-31 02:25:27,257 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 02:25:27,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 02:25:27,257 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-31 02:25:27,258 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-31 02:25:27,258 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-31 02:25:27,258 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-31 02:25:27,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-31 02:25:27,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-31 02:25:27,259 INFO L138 SettingsManager]: * Use SBE=true [2022-01-31 02:25:27,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 02:25:27,260 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 02:25:27,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 02:25:27,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 02:25:27,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 02:25:27,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 02:25:27,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 02:25:27,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 02:25:27,261 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 02:25:27,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 02:25:27,261 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 02:25:27,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 02:25:27,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 02:25:27,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 02:25:27,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 02:25:27,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 02:25:27,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 02:25:27,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-31 02:25:27,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-31 02:25:27,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 02:25:27,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-31 02:25:27,263 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-31 02:25:27,263 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-31 02:25:27,263 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 02:25:27,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 02:25:27,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 02:25:27,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 02:25:27,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 02:25:27,471 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 02:25:27,471 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 02:25:27,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-01-31 02:25:27,525 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f498d5b/1fa7af5e8ff649cb9e385a72ca266854/FLAG6243bd2c8 [2022-01-31 02:25:27,882 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 02:25:27,882 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-01-31 02:25:27,903 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f498d5b/1fa7af5e8ff649cb9e385a72ca266854/FLAG6243bd2c8 [2022-01-31 02:25:28,267 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f498d5b/1fa7af5e8ff649cb9e385a72ca266854 [2022-01-31 02:25:28,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 02:25:28,270 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 02:25:28,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 02:25:28,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 02:25:28,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 02:25:28,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 02:25:28" (1/1) ... [2022-01-31 02:25:28,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28401feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:28, skipping insertion in model container [2022-01-31 02:25:28,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 02:25:28" (1/1) ... [2022-01-31 02:25:28,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 02:25:28,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 02:25:28,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-01-31 02:25:28,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-01-31 02:25:28,479 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-01-31 02:25:28,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-01-31 02:25:28,483 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-01-31 02:25:28,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-01-31 02:25:28,486 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-01-31 02:25:28,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-01-31 02:25:28,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-01-31 02:25:28,491 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-01-31 02:25:28,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-01-31 02:25:28,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-01-31 02:25:28,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-01-31 02:25:28,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-01-31 02:25:28,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-01-31 02:25:28,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-01-31 02:25:28,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-01-31 02:25:28,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-01-31 02:25:28,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 02:25:28,513 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 02:25:28,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-01-31 02:25:28,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-01-31 02:25:28,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-01-31 02:25:28,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-01-31 02:25:28,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-01-31 02:25:28,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-01-31 02:25:28,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-01-31 02:25:28,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-01-31 02:25:28,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-01-31 02:25:28,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-01-31 02:25:28,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-01-31 02:25:28,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-01-31 02:25:28,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-01-31 02:25:28,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-01-31 02:25:28,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-01-31 02:25:28,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-01-31 02:25:28,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-01-31 02:25:28,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-01-31 02:25:28,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 02:25:28,584 INFO L208 MainTranslator]: Completed translation [2022-01-31 02:25:28,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:28 WrapperNode [2022-01-31 02:25:28,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 02:25:28,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 02:25:28,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 02:25:28,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 02:25:28,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:28" (1/1) ... [2022-01-31 02:25:28,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:28" (1/1) ... [2022-01-31 02:25:28,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:28" (1/1) ... [2022-01-31 02:25:28,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:28" (1/1) ... [2022-01-31 02:25:28,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:28" (1/1) ... [2022-01-31 02:25:28,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:28" (1/1) ... [2022-01-31 02:25:28,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:28" (1/1) ... [2022-01-31 02:25:28,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 02:25:28,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 02:25:28,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 02:25:28,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 02:25:28,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:28" (1/1) ... [2022-01-31 02:25:28,637 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 02:25:28,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 02:25:28,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 02:25:28,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 02:25:28,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 02:25:28,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 02:25:28,683 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 02:25:28,683 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 02:25:28,683 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 02:25:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 02:25:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 02:25:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 02:25:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 02:25:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 02:25:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 02:25:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 02:25:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 02:25:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 02:25:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 02:25:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 02:25:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 02:25:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 02:25:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 02:25:28,752 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 02:25:28,753 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 02:25:28,966 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 02:25:28,972 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 02:25:28,972 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-31 02:25:28,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:25:28 BoogieIcfgContainer [2022-01-31 02:25:28,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 02:25:28,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 02:25:28,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 02:25:28,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 02:25:28,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 02:25:28" (1/3) ... [2022-01-31 02:25:28,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22133c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:25:28, skipping insertion in model container [2022-01-31 02:25:28,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:28" (2/3) ... [2022-01-31 02:25:28,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22133c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:25:28, skipping insertion in model container [2022-01-31 02:25:28,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:25:28" (3/3) ... [2022-01-31 02:25:28,980 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2022-01-31 02:25:28,983 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-31 02:25:28,984 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-01-31 02:25:29,019 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 02:25:29,025 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 02:25:29,025 INFO L340 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-01-31 02:25:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 02:25:29,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 02:25:29,044 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:29,045 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:29,045 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:29,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:29,051 INFO L85 PathProgramCache]: Analyzing trace with hash 129930232, now seen corresponding path program 1 times [2022-01-31 02:25:29,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:29,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862111205] [2022-01-31 02:25:29,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:29,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:29,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:29,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:29,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862111205] [2022-01-31 02:25:29,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862111205] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:29,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:29,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 02:25:29,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077072423] [2022-01-31 02:25:29,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:29,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 02:25:29,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:29,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 02:25:29,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 02:25:29,380 INFO L87 Difference]: Start difference. First operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:29,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:29,507 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2022-01-31 02:25:29,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 02:25:29,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 02:25:29,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:29,519 INFO L225 Difference]: With dead ends: 93 [2022-01-31 02:25:29,519 INFO L226 Difference]: Without dead ends: 80 [2022-01-31 02:25:29,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:25:29,530 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 170 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:29,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 105 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-31 02:25:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-01-31 02:25:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-01-31 02:25:29,583 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2022-01-31 02:25:29,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:29,583 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-01-31 02:25:29,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:29,584 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-01-31 02:25:29,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 02:25:29,585 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:29,585 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:29,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 02:25:29,586 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:29,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:29,590 INFO L85 PathProgramCache]: Analyzing trace with hash -267127005, now seen corresponding path program 1 times [2022-01-31 02:25:29,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:29,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246679514] [2022-01-31 02:25:29,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:29,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:29,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:29,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:29,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:29,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246679514] [2022-01-31 02:25:29,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246679514] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:29,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:29,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 02:25:29,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136770299] [2022-01-31 02:25:29,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:29,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:29,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:29,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:29,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:29,722 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:29,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:29,864 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-01-31 02:25:29,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:25:29,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-01-31 02:25:29,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:29,868 INFO L225 Difference]: With dead ends: 80 [2022-01-31 02:25:29,868 INFO L226 Difference]: Without dead ends: 78 [2022-01-31 02:25:29,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-31 02:25:29,870 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 319 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:29,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 74 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:29,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-31 02:25:29,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-01-31 02:25:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-01-31 02:25:29,889 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2022-01-31 02:25:29,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:29,889 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-01-31 02:25:29,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-01-31 02:25:29,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 02:25:29,890 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:29,890 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:29,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 02:25:29,891 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:29,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:29,891 INFO L85 PathProgramCache]: Analyzing trace with hash 989082342, now seen corresponding path program 1 times [2022-01-31 02:25:29,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:29,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008349649] [2022-01-31 02:25:29,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:29,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:29,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:29,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:29,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008349649] [2022-01-31 02:25:29,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008349649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:29,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:29,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 02:25:29,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956431269] [2022-01-31 02:25:29,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:29,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 02:25:29,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:29,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 02:25:29,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:25:29,959 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:30,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:30,092 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-01-31 02:25:30,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:25:30,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-01-31 02:25:30,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:30,094 INFO L225 Difference]: With dead ends: 101 [2022-01-31 02:25:30,094 INFO L226 Difference]: Without dead ends: 99 [2022-01-31 02:25:30,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 02:25:30,095 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 207 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:30,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 78 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:30,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-01-31 02:25:30,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2022-01-31 02:25:30,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:30,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-01-31 02:25:30,103 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2022-01-31 02:25:30,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:30,103 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-01-31 02:25:30,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:30,103 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-01-31 02:25:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 02:25:30,104 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:30,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:30,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 02:25:30,104 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:30,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:30,105 INFO L85 PathProgramCache]: Analyzing trace with hash 596784644, now seen corresponding path program 1 times [2022-01-31 02:25:30,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:30,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796217485] [2022-01-31 02:25:30,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:30,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:30,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:30,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:30,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796217485] [2022-01-31 02:25:30,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796217485] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:30,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:30,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:30,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181947195] [2022-01-31 02:25:30,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:30,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:30,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:30,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:30,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:30,170 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:30,267 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-01-31 02:25:30,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:25:30,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-01-31 02:25:30,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:30,269 INFO L225 Difference]: With dead ends: 76 [2022-01-31 02:25:30,269 INFO L226 Difference]: Without dead ends: 74 [2022-01-31 02:25:30,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-31 02:25:30,270 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 234 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:30,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 70 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:30,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-01-31 02:25:30,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-01-31 02:25:30,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-01-31 02:25:30,288 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2022-01-31 02:25:30,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:30,289 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-01-31 02:25:30,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:30,289 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-01-31 02:25:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 02:25:30,290 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:30,290 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:30,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 02:25:30,290 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:30,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:30,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1944836287, now seen corresponding path program 1 times [2022-01-31 02:25:30,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:30,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036847344] [2022-01-31 02:25:30,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:30,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:30,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:30,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:30,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036847344] [2022-01-31 02:25:30,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036847344] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:30,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:30,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:30,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028854552] [2022-01-31 02:25:30,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:30,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:30,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:30,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:30,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:30,396 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:30,724 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-01-31 02:25:30,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 02:25:30,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-01-31 02:25:30,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:30,726 INFO L225 Difference]: With dead ends: 141 [2022-01-31 02:25:30,726 INFO L226 Difference]: Without dead ends: 139 [2022-01-31 02:25:30,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-31 02:25:30,727 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 235 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:30,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 125 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 02:25:30,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-01-31 02:25:30,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2022-01-31 02:25:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-01-31 02:25:30,735 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2022-01-31 02:25:30,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:30,735 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-01-31 02:25:30,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-01-31 02:25:30,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 02:25:30,736 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:30,737 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:30,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 02:25:30,737 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:30,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:30,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1948570096, now seen corresponding path program 1 times [2022-01-31 02:25:30,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:30,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751720220] [2022-01-31 02:25:30,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:30,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:30,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:30,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:30,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751720220] [2022-01-31 02:25:30,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751720220] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:30,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:30,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:30,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773737273] [2022-01-31 02:25:30,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:30,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:30,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:30,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:30,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:30,799 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:31,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:31,028 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2022-01-31 02:25:31,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 02:25:31,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-01-31 02:25:31,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:31,029 INFO L225 Difference]: With dead ends: 108 [2022-01-31 02:25:31,029 INFO L226 Difference]: Without dead ends: 106 [2022-01-31 02:25:31,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-31 02:25:31,051 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 220 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:31,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 81 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:31,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-01-31 02:25:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2022-01-31 02:25:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-01-31 02:25:31,058 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2022-01-31 02:25:31,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:31,058 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-01-31 02:25:31,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-01-31 02:25:31,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-31 02:25:31,059 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:31,059 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:31,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 02:25:31,060 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:31,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:31,060 INFO L85 PathProgramCache]: Analyzing trace with hash 160385998, now seen corresponding path program 1 times [2022-01-31 02:25:31,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:31,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750033651] [2022-01-31 02:25:31,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:31,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:31,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:31,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:31,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750033651] [2022-01-31 02:25:31,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750033651] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:31,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:31,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:31,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264125743] [2022-01-31 02:25:31,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:31,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:31,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:31,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:31,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:31,126 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:31,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:31,288 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2022-01-31 02:25:31,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:25:31,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-01-31 02:25:31,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:31,289 INFO L225 Difference]: With dead ends: 121 [2022-01-31 02:25:31,289 INFO L226 Difference]: Without dead ends: 119 [2022-01-31 02:25:31,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-31 02:25:31,290 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 215 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:31,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 104 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-01-31 02:25:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2022-01-31 02:25:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-01-31 02:25:31,296 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2022-01-31 02:25:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:31,296 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-01-31 02:25:31,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-01-31 02:25:31,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-31 02:25:31,297 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:31,297 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:31,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 02:25:31,297 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:31,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:31,298 INFO L85 PathProgramCache]: Analyzing trace with hash 276133967, now seen corresponding path program 1 times [2022-01-31 02:25:31,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:31,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451894695] [2022-01-31 02:25:31,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:31,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:31,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:31,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:31,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:31,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451894695] [2022-01-31 02:25:31,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451894695] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:31,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:31,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:31,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785914722] [2022-01-31 02:25:31,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:31,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:31,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:31,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:31,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:31,360 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:31,484 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-01-31 02:25:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:25:31,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-01-31 02:25:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:31,485 INFO L225 Difference]: With dead ends: 77 [2022-01-31 02:25:31,485 INFO L226 Difference]: Without dead ends: 75 [2022-01-31 02:25:31,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-31 02:25:31,487 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 197 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:31,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 70 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:31,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-31 02:25:31,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-01-31 02:25:31,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-01-31 02:25:31,497 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2022-01-31 02:25:31,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:31,497 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-01-31 02:25:31,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-01-31 02:25:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 02:25:31,502 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:31,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:31,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 02:25:31,503 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:31,503 INFO L85 PathProgramCache]: Analyzing trace with hash -923129547, now seen corresponding path program 1 times [2022-01-31 02:25:31,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:31,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395395100] [2022-01-31 02:25:31,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:31,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:31,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:31,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:31,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395395100] [2022-01-31 02:25:31,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395395100] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:31,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:31,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 02:25:31,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438009140] [2022-01-31 02:25:31,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:31,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 02:25:31,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:31,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 02:25:31,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 02:25:31,562 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:31,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:31,640 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-01-31 02:25:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 02:25:31,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-01-31 02:25:31,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:31,642 INFO L225 Difference]: With dead ends: 115 [2022-01-31 02:25:31,642 INFO L226 Difference]: Without dead ends: 75 [2022-01-31 02:25:31,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:25:31,644 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:31,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 78 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:31,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-31 02:25:31,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-01-31 02:25:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-01-31 02:25:31,651 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2022-01-31 02:25:31,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:31,651 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-01-31 02:25:31,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-01-31 02:25:31,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 02:25:31,653 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:31,653 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:31,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 02:25:31,654 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:31,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:31,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1988983653, now seen corresponding path program 1 times [2022-01-31 02:25:31,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:31,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93882458] [2022-01-31 02:25:31,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:31,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:31,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:31,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:31,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:31,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93882458] [2022-01-31 02:25:31,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93882458] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:31,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:31,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:31,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998623604] [2022-01-31 02:25:31,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:31,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:31,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:31,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:31,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:31,719 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:31,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:31,814 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-01-31 02:25:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:25:31,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-01-31 02:25:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:31,815 INFO L225 Difference]: With dead ends: 76 [2022-01-31 02:25:31,815 INFO L226 Difference]: Without dead ends: 74 [2022-01-31 02:25:31,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-01-31 02:25:31,816 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 183 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:31,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 62 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:31,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-01-31 02:25:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-01-31 02:25:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-01-31 02:25:31,822 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2022-01-31 02:25:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:31,823 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-01-31 02:25:31,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-01-31 02:25:31,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 02:25:31,825 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:31,826 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:31,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 02:25:31,826 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:31,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:31,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2054875672, now seen corresponding path program 1 times [2022-01-31 02:25:31,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:31,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525265796] [2022-01-31 02:25:31,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:31,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:31,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 02:25:31,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:31,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525265796] [2022-01-31 02:25:31,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525265796] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 02:25:31,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840586143] [2022-01-31 02:25:31,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:31,908 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 02:25:31,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 02:25:31,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 02:25:31,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-31 02:25:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:31,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 02:25:31,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 02:25:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 02:25:32,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 02:25:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 02:25:32,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840586143] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 02:25:32,219 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 02:25:32,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-01-31 02:25:32,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839979647] [2022-01-31 02:25:32,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 02:25:32,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:32,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:32,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:32,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:32,220 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:32,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:32,397 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-01-31 02:25:32,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:25:32,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-01-31 02:25:32,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:32,398 INFO L225 Difference]: With dead ends: 111 [2022-01-31 02:25:32,398 INFO L226 Difference]: Without dead ends: 109 [2022-01-31 02:25:32,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-31 02:25:32,399 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 146 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:32,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 97 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:32,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-31 02:25:32,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2022-01-31 02:25:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-01-31 02:25:32,404 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2022-01-31 02:25:32,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:32,404 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-01-31 02:25:32,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-01-31 02:25:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 02:25:32,405 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:32,405 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:32,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-31 02:25:32,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-31 02:25:32,620 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:32,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1528947946, now seen corresponding path program 1 times [2022-01-31 02:25:32,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:32,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335271451] [2022-01-31 02:25:32,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:32,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:32,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:32,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:32,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335271451] [2022-01-31 02:25:32,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335271451] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:32,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:32,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:32,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883678698] [2022-01-31 02:25:32,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:32,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:32,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:32,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:32,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:32,674 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:32,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:32,763 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-01-31 02:25:32,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:25:32,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-01-31 02:25:32,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:32,764 INFO L225 Difference]: With dead ends: 70 [2022-01-31 02:25:32,764 INFO L226 Difference]: Without dead ends: 68 [2022-01-31 02:25:32,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-31 02:25:32,766 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 170 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:32,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 60 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:32,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-31 02:25:32,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-01-31 02:25:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-01-31 02:25:32,771 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2022-01-31 02:25:32,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:32,771 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-01-31 02:25:32,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:32,772 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-01-31 02:25:32,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 02:25:32,772 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:32,772 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:32,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 02:25:32,773 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:32,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash -726812143, now seen corresponding path program 1 times [2022-01-31 02:25:32,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:32,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663877243] [2022-01-31 02:25:32,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:32,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:32,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 02:25:32,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:32,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663877243] [2022-01-31 02:25:32,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663877243] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 02:25:32,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279450605] [2022-01-31 02:25:32,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:32,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 02:25:32,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 02:25:32,834 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 02:25:32,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-31 02:25:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:32,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 02:25:32,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 02:25:32,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 02:25:32,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 02:25:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 02:25:33,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279450605] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 02:25:33,049 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 02:25:33,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-01-31 02:25:33,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449336104] [2022-01-31 02:25:33,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 02:25:33,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:33,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:33,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:33,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:33,050 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:33,141 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-01-31 02:25:33,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:25:33,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-01-31 02:25:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:33,142 INFO L225 Difference]: With dead ends: 69 [2022-01-31 02:25:33,142 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 02:25:33,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-31 02:25:33,143 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 166 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:33,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 61 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:33,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 02:25:33,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-01-31 02:25:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-01-31 02:25:33,146 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2022-01-31 02:25:33,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:33,146 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-01-31 02:25:33,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:33,147 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-01-31 02:25:33,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 02:25:33,147 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:33,147 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:33,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 02:25:33,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-31 02:25:33,362 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:33,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:33,362 INFO L85 PathProgramCache]: Analyzing trace with hash -756981884, now seen corresponding path program 1 times [2022-01-31 02:25:33,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:33,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545611859] [2022-01-31 02:25:33,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:33,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:33,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:33,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:33,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545611859] [2022-01-31 02:25:33,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545611859] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:33,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:33,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:33,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720975391] [2022-01-31 02:25:33,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:33,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:33,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:33,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:33,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:33,426 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:33,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:33,525 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-01-31 02:25:33,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:25:33,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-01-31 02:25:33,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:33,526 INFO L225 Difference]: With dead ends: 63 [2022-01-31 02:25:33,526 INFO L226 Difference]: Without dead ends: 61 [2022-01-31 02:25:33,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-01-31 02:25:33,527 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 149 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:33,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 54 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:33,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-31 02:25:33,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-01-31 02:25:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-01-31 02:25:33,531 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2022-01-31 02:25:33,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:33,531 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-01-31 02:25:33,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-01-31 02:25:33,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 02:25:33,531 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:33,531 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:33,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 02:25:33,532 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:33,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:33,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1991598751, now seen corresponding path program 1 times [2022-01-31 02:25:33,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:33,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218363745] [2022-01-31 02:25:33,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:33,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:33,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:33,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:33,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:33,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218363745] [2022-01-31 02:25:33,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218363745] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:33,607 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:33,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 02:25:33,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56536223] [2022-01-31 02:25:33,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:33,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:33,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:33,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:33,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:33,608 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:33,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:33,732 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-01-31 02:25:33,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:25:33,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-01-31 02:25:33,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:33,733 INFO L225 Difference]: With dead ends: 71 [2022-01-31 02:25:33,733 INFO L226 Difference]: Without dead ends: 69 [2022-01-31 02:25:33,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-31 02:25:33,734 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 153 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:33,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 62 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:33,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-31 02:25:33,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-01-31 02:25:33,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-01-31 02:25:33,737 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2022-01-31 02:25:33,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:33,738 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-01-31 02:25:33,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:33,738 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-01-31 02:25:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 02:25:33,738 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:33,738 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:33,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 02:25:33,738 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:33,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:33,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1037071699, now seen corresponding path program 1 times [2022-01-31 02:25:33,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:33,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739453752] [2022-01-31 02:25:33,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:33,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:33,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:33,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:33,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739453752] [2022-01-31 02:25:33,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739453752] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:33,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:33,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:33,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168035768] [2022-01-31 02:25:33,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:33,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:33,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:33,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:33,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:33,795 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:33,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:33,983 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-01-31 02:25:33,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 02:25:33,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-01-31 02:25:33,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:33,985 INFO L225 Difference]: With dead ends: 91 [2022-01-31 02:25:33,985 INFO L226 Difference]: Without dead ends: 89 [2022-01-31 02:25:33,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-01-31 02:25:33,985 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 178 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:33,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 60 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:33,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-31 02:25:33,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2022-01-31 02:25:33,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:33,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-01-31 02:25:33,989 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2022-01-31 02:25:33,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:33,989 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-01-31 02:25:33,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-01-31 02:25:33,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 02:25:33,990 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:33,990 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:33,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 02:25:33,990 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:33,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:33,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2084448405, now seen corresponding path program 1 times [2022-01-31 02:25:33,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:33,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424739536] [2022-01-31 02:25:33,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:33,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:34,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:34,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:34,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424739536] [2022-01-31 02:25:34,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424739536] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:34,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:34,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:34,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369333273] [2022-01-31 02:25:34,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:34,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:34,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:34,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:34,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:34,051 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:34,184 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-01-31 02:25:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:25:34,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-01-31 02:25:34,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:34,185 INFO L225 Difference]: With dead ends: 61 [2022-01-31 02:25:34,185 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 02:25:34,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-31 02:25:34,185 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 110 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:34,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 67 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:34,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 02:25:34,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-01-31 02:25:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-01-31 02:25:34,190 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2022-01-31 02:25:34,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:34,190 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-01-31 02:25:34,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-01-31 02:25:34,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 02:25:34,190 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:34,190 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:34,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 02:25:34,191 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:34,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:34,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1700057906, now seen corresponding path program 1 times [2022-01-31 02:25:34,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:34,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807559150] [2022-01-31 02:25:34,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:34,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:34,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:34,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:34,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:34,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807559150] [2022-01-31 02:25:34,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807559150] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:34,227 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:34,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 02:25:34,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336954236] [2022-01-31 02:25:34,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:34,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 02:25:34,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:34,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 02:25:34,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:25:34,228 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:34,331 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-01-31 02:25:34,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:25:34,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-01-31 02:25:34,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:34,332 INFO L225 Difference]: With dead ends: 70 [2022-01-31 02:25:34,332 INFO L226 Difference]: Without dead ends: 68 [2022-01-31 02:25:34,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 02:25:34,333 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:34,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 77 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:34,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-31 02:25:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2022-01-31 02:25:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:34,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-01-31 02:25:34,337 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2022-01-31 02:25:34,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:34,338 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-01-31 02:25:34,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-01-31 02:25:34,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 02:25:34,338 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:34,338 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:34,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 02:25:34,338 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:34,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:34,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1162184327, now seen corresponding path program 1 times [2022-01-31 02:25:34,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:34,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863323819] [2022-01-31 02:25:34,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:34,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:34,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:34,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:34,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863323819] [2022-01-31 02:25:34,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863323819] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:34,378 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:34,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:34,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211340799] [2022-01-31 02:25:34,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:34,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:34,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:34,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:34,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:34,379 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:34,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:34,499 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-01-31 02:25:34,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:25:34,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-01-31 02:25:34,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:34,500 INFO L225 Difference]: With dead ends: 66 [2022-01-31 02:25:34,500 INFO L226 Difference]: Without dead ends: 64 [2022-01-31 02:25:34,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 02:25:34,501 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 91 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:34,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 74 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:34,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-31 02:25:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-01-31 02:25:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-01-31 02:25:34,506 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2022-01-31 02:25:34,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:34,506 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-01-31 02:25:34,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:34,506 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-01-31 02:25:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 02:25:34,506 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:34,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:34,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 02:25:34,507 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:34,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:34,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1667972556, now seen corresponding path program 1 times [2022-01-31 02:25:34,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:34,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386629417] [2022-01-31 02:25:34,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:34,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:34,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:34,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:34,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386629417] [2022-01-31 02:25:34,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386629417] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:34,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:34,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:34,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846153492] [2022-01-31 02:25:34,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:34,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:34,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:34,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:34,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:34,556 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:34,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:34,765 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-01-31 02:25:34,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 02:25:34,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-01-31 02:25:34,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:34,766 INFO L225 Difference]: With dead ends: 88 [2022-01-31 02:25:34,766 INFO L226 Difference]: Without dead ends: 86 [2022-01-31 02:25:34,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-01-31 02:25:34,767 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 123 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:34,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 62 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:34,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-01-31 02:25:34,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2022-01-31 02:25:34,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:34,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2022-01-31 02:25:34,773 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2022-01-31 02:25:34,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:34,773 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-01-31 02:25:34,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:34,773 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-01-31 02:25:34,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 02:25:34,774 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:34,774 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:34,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 02:25:34,774 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:34,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash 651621684, now seen corresponding path program 1 times [2022-01-31 02:25:34,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:34,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195919520] [2022-01-31 02:25:34,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:34,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:34,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:34,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:34,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195919520] [2022-01-31 02:25:34,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195919520] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 02:25:34,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75095605] [2022-01-31 02:25:34,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:34,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 02:25:34,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 02:25:34,833 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 02:25:34,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-31 02:25:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:34,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 02:25:34,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 02:25:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:34,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 02:25:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:35,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75095605] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 02:25:35,081 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 02:25:35,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-01-31 02:25:35,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317358444] [2022-01-31 02:25:35,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 02:25:35,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:35,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:35,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:35,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:35,084 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:35,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:35,177 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2022-01-31 02:25:35,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:25:35,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-01-31 02:25:35,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:35,178 INFO L225 Difference]: With dead ends: 60 [2022-01-31 02:25:35,178 INFO L226 Difference]: Without dead ends: 58 [2022-01-31 02:25:35,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-31 02:25:35,179 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 97 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:35,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 49 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:35,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-31 02:25:35,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-01-31 02:25:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-01-31 02:25:35,184 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2022-01-31 02:25:35,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:35,184 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-01-31 02:25:35,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:35,184 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-01-31 02:25:35,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 02:25:35,185 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:35,185 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:35,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-31 02:25:35,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 02:25:35,400 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:35,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:35,400 INFO L85 PathProgramCache]: Analyzing trace with hash -167538465, now seen corresponding path program 1 times [2022-01-31 02:25:35,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:35,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649459576] [2022-01-31 02:25:35,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:35,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:35,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:35,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:35,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649459576] [2022-01-31 02:25:35,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649459576] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:35,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:35,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:35,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811652646] [2022-01-31 02:25:35,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:35,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:35,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:35,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:35,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:35,451 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:35,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:35,594 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-01-31 02:25:35,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:25:35,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-01-31 02:25:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:35,597 INFO L225 Difference]: With dead ends: 69 [2022-01-31 02:25:35,597 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 02:25:35,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-31 02:25:35,598 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:35,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 65 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:35,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 02:25:35,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2022-01-31 02:25:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-01-31 02:25:35,602 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2022-01-31 02:25:35,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:35,603 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-01-31 02:25:35,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-01-31 02:25:35,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 02:25:35,603 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:35,603 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:35,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 02:25:35,604 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 02:25:35,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:35,604 INFO L85 PathProgramCache]: Analyzing trace with hash -799157235, now seen corresponding path program 1 times [2022-01-31 02:25:35,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:35,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546336530] [2022-01-31 02:25:35,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:35,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:35,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:35,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 02:25:35,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:35,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546336530] [2022-01-31 02:25:35,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546336530] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:35,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:35,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:35,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965709233] [2022-01-31 02:25:35,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:35,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:35,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:35,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:35,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:35,653 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:35,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:35,829 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-01-31 02:25:35,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 02:25:35,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-01-31 02:25:35,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:35,829 INFO L225 Difference]: With dead ends: 75 [2022-01-31 02:25:35,829 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 02:25:35,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-01-31 02:25:35,833 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 88 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:35,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 55 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 02:25:35,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 02:25:35,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-31 02:25:35,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 02:25:35,835 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-01-31 02:25:35,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:35,836 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 02:25:35,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:35,836 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 02:25:35,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 02:25:35,838 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-01-31 02:25:35,839 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-01-31 02:25:35,839 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-01-31 02:25:35,839 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-01-31 02:25:35,839 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-01-31 02:25:35,839 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-01-31 02:25:35,839 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-01-31 02:25:35,839 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-01-31 02:25:35,839 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-01-31 02:25:35,839 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-01-31 02:25:35,840 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-01-31 02:25:35,840 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-01-31 02:25:35,840 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-01-31 02:25:35,840 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-01-31 02:25:35,840 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-01-31 02:25:35,840 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-01-31 02:25:35,840 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-01-31 02:25:35,840 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-01-31 02:25:35,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 02:25:35,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 02:25:41,289 WARN L228 SmtUtils]: Spent 5.44s on a formula simplification. DAG size of input: 127 DAG size of output: 123 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-31 02:26:04,333 WARN L228 SmtUtils]: Spent 22.16s on a formula simplification. DAG size of input: 133 DAG size of output: 128 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-31 02:26:05,008 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-01-31 02:26:05,008 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-01-31 02:26:05,008 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-01-31 02:26:05,008 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-01-31 02:26:05,009 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-01-31 02:26:05,009 INFO L858 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-01-31 02:26:05,009 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-01-31 02:26:05,009 INFO L858 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2022-01-31 02:26:05,009 INFO L858 garLoopResultBuilder]: For program point mainEXIT(lines 13 439) no Hoare annotation was computed. [2022-01-31 02:26:05,009 INFO L858 garLoopResultBuilder]: For program point L374(line 374) no Hoare annotation was computed. [2022-01-31 02:26:05,009 INFO L858 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-01-31 02:26:05,009 INFO L858 garLoopResultBuilder]: For program point L308(line 308) no Hoare annotation was computed. [2022-01-31 02:26:05,009 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 362) no Hoare annotation was computed. [2022-01-31 02:26:05,009 INFO L858 garLoopResultBuilder]: For program point L234(lines 234 338) no Hoare annotation was computed. [2022-01-31 02:26:05,009 INFO L858 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2022-01-31 02:26:05,009 INFO L858 garLoopResultBuilder]: For program point L135(lines 135 397) no Hoare annotation was computed. [2022-01-31 02:26:05,009 INFO L858 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-01-31 02:26:05,009 INFO L858 garLoopResultBuilder]: For program point L61(lines 61 427) no Hoare annotation was computed. [2022-01-31 02:26:05,009 INFO L858 garLoopResultBuilder]: For program point L284(line 284) no Hoare annotation was computed. [2022-01-31 02:26:05,009 INFO L858 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2022-01-31 02:26:05,009 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 433) no Hoare annotation was computed. [2022-01-31 02:26:05,010 INFO L858 garLoopResultBuilder]: For program point L243(line 243) no Hoare annotation was computed. [2022-01-31 02:26:05,010 INFO L858 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-01-31 02:26:05,010 INFO L858 garLoopResultBuilder]: For program point L111(lines 111 405) no Hoare annotation was computed. [2022-01-31 02:26:05,010 INFO L858 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2022-01-31 02:26:05,010 INFO L854 garLoopResultBuilder]: At program point L392(lines 129 403) the Hoare annotation is: (and (< main_~main__cp~0 main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 .cse3 (<= 1 main_~__VERIFIER_assert__cond~16) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5)))) [2022-01-31 02:26:05,010 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 354) no Hoare annotation was computed. [2022-01-31 02:26:05,010 INFO L858 garLoopResultBuilder]: For program point L384(lines 384 393) no Hoare annotation was computed. [2022-01-31 02:26:05,010 INFO L858 garLoopResultBuilder]: For program point L95(lines 95 412) no Hoare annotation was computed. [2022-01-31 02:26:05,010 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 437) no Hoare annotation was computed. [2022-01-31 02:26:05,010 INFO L858 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-01-31 02:26:05,010 INFO L858 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-01-31 02:26:05,011 INFO L854 garLoopResultBuilder]: At program point L401(lines 131 402) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (not (<= main_~main__urilen~0 main_~main__cp~0))) [2022-01-31 02:26:05,011 INFO L858 garLoopResultBuilder]: For program point mainFINAL(lines 13 439) no Hoare annotation was computed. [2022-01-31 02:26:05,011 INFO L858 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2022-01-31 02:26:05,011 INFO L858 garLoopResultBuilder]: For program point L104(lines 104 411) no Hoare annotation was computed. [2022-01-31 02:26:05,011 INFO L858 garLoopResultBuilder]: For program point L71(lines 71 416) no Hoare annotation was computed. [2022-01-31 02:26:05,011 INFO L854 garLoopResultBuilder]: At program point L327(lines 262 328) the Hoare annotation is: (and (= |old(~__return_375~0)| ~__return_375~0) (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (let ((.cse1 (= main_~__VERIFIER_assert__cond~9 1)) (.cse2 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (not (= main_~__VERIFIER_assert__cond~9 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse11 (< 0 main_~main__scheme~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (<= 1 main_~__VERIFIER_assert__cond~4)) (.cse15 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)))))) (or (and .cse0 (= main_~main__c~0 0)) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse0)))) [2022-01-31 02:26:05,011 INFO L858 garLoopResultBuilder]: For program point L294(lines 294 318) no Hoare annotation was computed. [2022-01-31 02:26:05,011 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 359) no Hoare annotation was computed. [2022-01-31 02:26:05,011 INFO L858 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2022-01-31 02:26:05,011 INFO L858 garLoopResultBuilder]: For program point L63(lines 63 422) no Hoare annotation was computed. [2022-01-31 02:26:05,012 INFO L854 garLoopResultBuilder]: At program point mainENTRY(lines 13 439) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-01-31 02:26:05,012 INFO L858 garLoopResultBuilder]: For program point L253(lines 253 329) no Hoare annotation was computed. [2022-01-31 02:26:05,012 INFO L858 garLoopResultBuilder]: For program point L187(lines 187 355) no Hoare annotation was computed. [2022-01-31 02:26:05,012 INFO L854 garLoopResultBuilder]: At program point L410(lines 104 411) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2022-01-31 02:26:05,012 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 346) no Hoare annotation was computed. [2022-01-31 02:26:05,012 INFO L858 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-01-31 02:26:05,012 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 434) no Hoare annotation was computed. [2022-01-31 02:26:05,012 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 322) no Hoare annotation was computed. [2022-01-31 02:26:05,012 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 353) no Hoare annotation was computed. [2022-01-31 02:26:05,012 INFO L858 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2022-01-31 02:26:05,012 INFO L858 garLoopResultBuilder]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2022-01-31 02:26:05,012 INFO L858 garLoopResultBuilder]: For program point L262(lines 262 328) no Hoare annotation was computed. [2022-01-31 02:26:05,012 INFO L858 garLoopResultBuilder]: For program point L386(line 386) no Hoare annotation was computed. [2022-01-31 02:26:05,012 INFO L858 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-01-31 02:26:05,013 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 360) no Hoare annotation was computed. [2022-01-31 02:26:05,013 INFO L858 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2022-01-31 02:26:05,013 INFO L858 garLoopResultBuilder]: For program point L23(lines 23 438) no Hoare annotation was computed. [2022-01-31 02:26:05,013 INFO L858 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2022-01-31 02:26:05,013 INFO L858 garLoopResultBuilder]: For program point L296(line 296) no Hoare annotation was computed. [2022-01-31 02:26:05,013 INFO L858 garLoopResultBuilder]: For program point L65(lines 65 417) no Hoare annotation was computed. [2022-01-31 02:26:05,013 INFO L858 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2022-01-31 02:26:05,013 INFO L858 garLoopResultBuilder]: For program point L255(line 255) no Hoare annotation was computed. [2022-01-31 02:26:05,013 INFO L858 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2022-01-31 02:26:05,013 INFO L858 garLoopResultBuilder]: For program point L123(lines 123 403) no Hoare annotation was computed. [2022-01-31 02:26:05,013 INFO L858 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-01-31 02:26:05,013 INFO L858 garLoopResultBuilder]: For program point L272(line 272) no Hoare annotation was computed. [2022-01-31 02:26:05,013 INFO L858 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2022-01-31 02:26:05,014 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 435) no Hoare annotation was computed. [2022-01-31 02:26:05,014 INFO L858 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2022-01-31 02:26:05,014 INFO L858 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-01-31 02:26:05,014 INFO L858 garLoopResultBuilder]: For program point L372(lines 372 395) no Hoare annotation was computed. [2022-01-31 02:26:05,014 INFO L858 garLoopResultBuilder]: For program point L83(lines 83 414) no Hoare annotation was computed. [2022-01-31 02:26:05,014 INFO L858 garLoopResultBuilder]: For program point L306(lines 306 316) no Hoare annotation was computed. [2022-01-31 02:26:05,014 INFO L858 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2022-01-31 02:26:05,014 INFO L858 garLoopResultBuilder]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2022-01-31 02:26:05,014 INFO L858 garLoopResultBuilder]: For program point L224(lines 224 344) no Hoare annotation was computed. [2022-01-31 02:26:05,014 INFO L858 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-01-31 02:26:05,014 INFO L858 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-01-31 02:26:05,014 INFO L858 garLoopResultBuilder]: For program point L59(lines 59 432) no Hoare annotation was computed. [2022-01-31 02:26:05,015 INFO L854 garLoopResultBuilder]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse8 (= main_~main__c~0 0)) (.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse4 (< main_~main__cp~0 main_~main__urilen~0)) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse9 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse10 (< 0 main_~main__scheme~0)) (.cse11 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse12 (<= 1 main_~main__cp~0)) (.cse13 (<= 1 main_~__VERIFIER_assert__cond~4)) (.cse14 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~8 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< (+ main_~main__cp~0 1) main_~main__urilen~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (let ((.cse15 (let ((.cse16 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse7 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) (or (and .cse8 .cse15) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse15))) (<= 1 main_~__VERIFIER_assert__cond~10)))) [2022-01-31 02:26:05,015 INFO L858 garLoopResultBuilder]: For program point L282(lines 282 320) no Hoare annotation was computed. [2022-01-31 02:26:05,015 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 331) no Hoare annotation was computed. [2022-01-31 02:26:05,015 INFO L858 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2022-01-31 02:26:05,015 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 357) no Hoare annotation was computed. [2022-01-31 02:26:05,015 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 436) no Hoare annotation was computed. [2022-01-31 02:26:05,015 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-01-31 02:26:05,015 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 02:26:05,015 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-01-31 02:26:05,015 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-31 02:26:05,015 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 02:26:05,015 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 02:26:05,015 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-31 02:26:05,018 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:26:05,019 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 02:26:05,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:26:05 BoogieIcfgContainer [2022-01-31 02:26:05,042 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 02:26:05,043 INFO L158 Benchmark]: Toolchain (without parser) took 36772.19ms. Allocated memory was 178.3MB in the beginning and 458.2MB in the end (delta: 280.0MB). Free memory was 125.7MB in the beginning and 429.7MB in the end (delta: -304.0MB). Peak memory consumption was 257.3MB. Max. memory is 8.0GB. [2022-01-31 02:26:05,043 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 178.3MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 02:26:05,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.83ms. Allocated memory was 178.3MB in the beginning and 264.2MB in the end (delta: 86.0MB). Free memory was 125.5MB in the beginning and 227.2MB in the end (delta: -101.7MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-01-31 02:26:05,043 INFO L158 Benchmark]: Boogie Preprocessor took 33.62ms. Allocated memory is still 264.2MB. Free memory was 227.2MB in the beginning and 225.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 02:26:05,044 INFO L158 Benchmark]: RCFGBuilder took 351.46ms. Allocated memory is still 264.2MB. Free memory was 225.6MB in the beginning and 208.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-01-31 02:26:05,044 INFO L158 Benchmark]: TraceAbstraction took 36067.42ms. Allocated memory was 264.2MB in the beginning and 458.2MB in the end (delta: 194.0MB). Free memory was 208.9MB in the beginning and 429.7MB in the end (delta: -220.8MB). Peak memory consumption was 254.2MB. Max. memory is 8.0GB. [2022-01-31 02:26:05,045 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 178.3MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 308.83ms. Allocated memory was 178.3MB in the beginning and 264.2MB in the end (delta: 86.0MB). Free memory was 125.5MB in the beginning and 227.2MB in the end (delta: -101.7MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.62ms. Allocated memory is still 264.2MB. Free memory was 227.2MB in the beginning and 225.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 351.46ms. Allocated memory is still 264.2MB. Free memory was 225.6MB in the beginning and 208.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 36067.42ms. Allocated memory was 264.2MB in the beginning and 458.2MB in the end (delta: 194.0MB). Free memory was 208.9MB in the beginning and 429.7MB in the end (delta: -220.8MB). Peak memory consumption was 254.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 308]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 94 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 36.0s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 29.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3669 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3669 mSDsluCounter, 1690 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 365 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2596 IncrementalHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 1325 mSDtfsCounter, 2596 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 269 SyntacticMatches, 18 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 296 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 732 HoareAnnotationTreeSize, 9 FomulaSimplifications, 75971 FormulaSimplificationTreeSizeReduction, 28.5s HoareSimplificationTime, 9 FomulaSimplificationsInter, 370060 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 855 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 2199 SizeOfPredicates, 12 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 11/29 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (\old(__return_375) == __return_375 && __VERIFIER_assert__cond == 1) && ((((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen)) && main__c == 0) || ((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen)))) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (main__cp < main__urilen && \old(__return_375) == __return_375) && ((((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= __VERIFIER_assert__cond) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(main__urilen <= main__cp) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) && \old(__return_375) == __return_375 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && main__c == 0) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) || (((main__c == 0 && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)))) || ((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0))))) && 1 <= __VERIFIER_assert__cond) RESULT: Ultimate proved your program to be correct! [2022-01-31 02:26:05,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...