/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7968f31 [2022-03-17 19:36:54,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-17 19:36:54,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-17 19:36:54,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-17 19:36:54,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-17 19:36:54,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-17 19:36:54,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-17 19:36:54,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-17 19:36:54,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-17 19:36:54,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-17 19:36:54,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-17 19:36:54,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-17 19:36:54,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-17 19:36:54,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-17 19:36:54,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-17 19:36:54,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-17 19:36:54,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-17 19:36:54,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-17 19:36:54,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-17 19:36:54,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-17 19:36:54,857 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-17 19:36:54,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-17 19:36:54,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-17 19:36:54,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-17 19:36:54,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-17 19:36:54,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-17 19:36:54,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-17 19:36:54,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-17 19:36:54,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-17 19:36:54,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-17 19:36:54,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-17 19:36:54,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-17 19:36:54,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-17 19:36:54,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-17 19:36:54,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-17 19:36:54,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-17 19:36:54,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-17 19:36:54,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-17 19:36:54,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-17 19:36:54,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-17 19:36:54,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-17 19:36:54,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-17 19:36:54,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-03-17 19:36:54,891 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-17 19:36:54,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-17 19:36:54,893 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-17 19:36:54,893 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-17 19:36:54,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-17 19:36:54,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-17 19:36:54,893 INFO L138 SettingsManager]: * Use SBE=true [2022-03-17 19:36:54,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-17 19:36:54,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-17 19:36:54,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-17 19:36:54,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-17 19:36:54,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-17 19:36:54,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-17 19:36:54,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-17 19:36:54,895 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-17 19:36:54,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-17 19:36:54,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-17 19:36:54,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-17 19:36:54,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-17 19:36:54,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 19:36:54,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-17 19:36:54,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-17 19:36:54,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-17 19:36:54,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-17 19:36:54,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-17 19:36:54,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-17 19:36:54,896 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-03-17 19:36:54,896 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-03-17 19:36:54,897 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-17 19:36:54,897 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-03-17 19:36:55,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-17 19:36:55,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-17 19:36:55,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-17 19:36:55,076 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-17 19:36:55,077 INFO L275 PluginConnector]: CDTParser initialized [2022-03-17 19:36:55,078 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-03-17 19:36:55,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac51e249/6b86131a484045f58d703f6e5031b873/FLAG49e4dc20b [2022-03-17 19:36:55,460 INFO L306 CDTParser]: Found 1 translation units. [2022-03-17 19:36:55,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-03-17 19:36:55,467 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac51e249/6b86131a484045f58d703f6e5031b873/FLAG49e4dc20b [2022-03-17 19:36:55,474 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac51e249/6b86131a484045f58d703f6e5031b873 [2022-03-17 19:36:55,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-17 19:36:55,477 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-17 19:36:55,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-17 19:36:55,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-17 19:36:55,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-17 19:36:55,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:36:55" (1/1) ... [2022-03-17 19:36:55,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10b3fefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:55, skipping insertion in model container [2022-03-17 19:36:55,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:36:55" (1/1) ... [2022-03-17 19:36:55,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-17 19:36:55,504 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-17 19:36:55,630 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-03-17 19:36:55,632 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-03-17 19:36:55,633 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-03-17 19:36:55,634 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-03-17 19:36:55,638 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-03-17 19:36:55,642 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-03-17 19:36:55,647 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-03-17 19:36:55,648 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-03-17 19:36:55,650 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-03-17 19:36:55,650 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-03-17 19:36:55,652 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-03-17 19:36:55,656 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-03-17 19:36:55,658 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-03-17 19:36:55,659 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-03-17 19:36:55,660 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-03-17 19:36:55,661 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-03-17 19:36:55,663 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-03-17 19:36:55,663 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-03-17 19:36:55,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 19:36:55,670 INFO L203 MainTranslator]: Completed pre-run [2022-03-17 19:36:55,679 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-03-17 19:36:55,680 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-03-17 19:36:55,681 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-03-17 19:36:55,681 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-03-17 19:36:55,682 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-03-17 19:36:55,683 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-03-17 19:36:55,684 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-03-17 19:36:55,685 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-03-17 19:36:55,686 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-03-17 19:36:55,687 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-03-17 19:36:55,688 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-03-17 19:36:55,689 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-03-17 19:36:55,690 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-03-17 19:36:55,691 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-03-17 19:36:55,692 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-03-17 19:36:55,693 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-03-17 19:36:55,694 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-03-17 19:36:55,694 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-03-17 19:36:55,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 19:36:55,705 INFO L208 MainTranslator]: Completed translation [2022-03-17 19:36:55,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:55 WrapperNode [2022-03-17 19:36:55,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-17 19:36:55,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-17 19:36:55,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-17 19:36:55,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-17 19:36:55,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:55" (1/1) ... [2022-03-17 19:36:55,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:55" (1/1) ... [2022-03-17 19:36:55,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:55" (1/1) ... [2022-03-17 19:36:55,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:55" (1/1) ... [2022-03-17 19:36:55,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:55" (1/1) ... [2022-03-17 19:36:55,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:55" (1/1) ... [2022-03-17 19:36:55,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:55" (1/1) ... [2022-03-17 19:36:55,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-17 19:36:55,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-17 19:36:55,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-17 19:36:55,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-17 19:36:55,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:55" (1/1) ... [2022-03-17 19:36:55,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 19:36:55,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 19:36:55,754 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-03-17 19:36:55,760 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-03-17 19:36:55,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-17 19:36:55,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-17 19:36:55,778 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-17 19:36:55,778 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-17 19:36:55,778 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-17 19:36:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-17 19:36:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-17 19:36:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-17 19:36:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-17 19:36:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-17 19:36:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-17 19:36:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-17 19:36:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-17 19:36:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-17 19:36:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-17 19:36:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-17 19:36:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-17 19:36:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-17 19:36:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-17 19:36:55,840 INFO L234 CfgBuilder]: Building ICFG [2022-03-17 19:36:55,841 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-17 19:36:56,019 INFO L275 CfgBuilder]: Performing block encoding [2022-03-17 19:36:56,023 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-17 19:36:56,024 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-17 19:36:56,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 07:36:56 BoogieIcfgContainer [2022-03-17 19:36:56,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-17 19:36:56,025 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-17 19:36:56,026 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-17 19:36:56,031 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-17 19:36:56,033 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 07:36:56" (1/1) ... [2022-03-17 19:36:56,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 07:36:56 BasicIcfg [2022-03-17 19:36:56,061 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-17 19:36:56,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-17 19:36:56,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-17 19:36:56,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-17 19:36:56,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:36:55" (1/4) ... [2022-03-17 19:36:56,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8ac7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:36:56, skipping insertion in model container [2022-03-17 19:36:56,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:55" (2/4) ... [2022-03-17 19:36:56,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8ac7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:36:56, skipping insertion in model container [2022-03-17 19:36:56,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 07:36:56" (3/4) ... [2022-03-17 19:36:56,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8ac7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 07:36:56, skipping insertion in model container [2022-03-17 19:36:56,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 07:36:56" (4/4) ... [2022-03-17 19:36:56,065 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.cqvasr [2022-03-17 19:36:56,068 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-17 19:36:56,068 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-03-17 19:36:56,101 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-17 19:36:56,105 INFO L340 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=FINITE_AUTOMATA, 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 [2022-03-17 19:36:56,106 INFO L341 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-03-17 19:36:56,116 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-03-17 19:36:56,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 19:36:56,119 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:36:56,119 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 19:36:56,119 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:36:56,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:36:56,123 INFO L85 PathProgramCache]: Analyzing trace with hash 317693851, now seen corresponding path program 1 times [2022-03-17 19:36:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:36:56,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566696307] [2022-03-17 19:36:56,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:36:56,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:36:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:56,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:36:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:36:56,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:36:56,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566696307] [2022-03-17 19:36:56,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566696307] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:36:56,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:36:56,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-17 19:36:56,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119418903] [2022-03-17 19:36:56,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:36:56,273 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-17 19:36:56,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:36:56,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-17 19:36:56,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-17 19:36:56,293 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-03-17 19:36:56,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:36:56,371 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2022-03-17 19:36:56,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 19:36:56,373 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-03-17 19:36:56,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:36:56,379 INFO L225 Difference]: With dead ends: 93 [2022-03-17 19:36:56,379 INFO L226 Difference]: Without dead ends: 80 [2022-03-17 19:36:56,383 INFO L911 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-03-17 19:36:56,386 INFO L912 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.0s IncrementalHoareTripleChecker+Time [2022-03-17 19:36:56,386 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 105 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 19:36:56,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-03-17 19:36:56,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-03-17 19:36:56,408 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-03-17 19:36:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-03-17 19:36:56,410 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2022-03-17 19:36:56,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:36:56,411 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-03-17 19:36:56,411 INFO L479 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-03-17 19:36:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-03-17 19:36:56,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-17 19:36:56,411 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:36:56,411 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 19:36:56,412 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-17 19:36:56,412 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:36:56,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:36:56,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1258576075, now seen corresponding path program 1 times [2022-03-17 19:36:56,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:36:56,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687979753] [2022-03-17 19:36:56,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:36:56,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:36:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:56,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:36:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:36:56,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:36:56,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687979753] [2022-03-17 19:36:56,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687979753] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:36:56,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:36:56,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-17 19:36:56,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833005480] [2022-03-17 19:36:56,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:36:56,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 19:36:56,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:36:56,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 19:36:56,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-17 19:36:56,484 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-03-17 19:36:56,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:36:56,644 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-03-17 19:36:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 19:36:56,645 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-03-17 19:36:56,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:36:56,646 INFO L225 Difference]: With dead ends: 80 [2022-03-17 19:36:56,646 INFO L226 Difference]: Without dead ends: 78 [2022-03-17 19:36:56,646 INFO L911 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-03-17 19:36:56,647 INFO L912 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-03-17 19:36:56,648 INFO L913 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-03-17 19:36:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-03-17 19:36:56,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-03-17 19:36:56,655 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-03-17 19:36:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-03-17 19:36:56,657 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2022-03-17 19:36:56,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:36:56,658 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-03-17 19:36:56,658 INFO L479 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-03-17 19:36:56,658 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-03-17 19:36:56,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-17 19:36:56,658 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:36:56,658 INFO L500 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-03-17 19:36:56,658 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-17 19:36:56,659 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:36:56,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:36:56,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1689129137, now seen corresponding path program 1 times [2022-03-17 19:36:56,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:36:56,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677920221] [2022-03-17 19:36:56,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:36:56,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:36:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:56,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:36:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:56,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:36:56,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:36:56,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677920221] [2022-03-17 19:36:56,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677920221] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:36:56,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:36:56,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 19:36:56,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30697615] [2022-03-17 19:36:56,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:36:56,719 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 19:36:56,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:36:56,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 19:36:56,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 19:36:56,720 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-03-17 19:36:56,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:36:56,847 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-03-17 19:36:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 19:36:56,847 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-03-17 19:36:56,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:36:56,851 INFO L225 Difference]: With dead ends: 101 [2022-03-17 19:36:56,851 INFO L226 Difference]: Without dead ends: 99 [2022-03-17 19:36:56,852 INFO L911 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-03-17 19:36:56,854 INFO L912 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-03-17 19:36:56,857 INFO L913 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-03-17 19:36:56,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-03-17 19:36:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2022-03-17 19:36:56,868 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-03-17 19:36:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-03-17 19:36:56,869 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2022-03-17 19:36:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:36:56,869 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-03-17 19:36:56,870 INFO L479 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-03-17 19:36:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-03-17 19:36:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-17 19:36:56,870 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:36:56,870 INFO L500 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-03-17 19:36:56,870 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-17 19:36:56,870 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:36:56,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:36:56,871 INFO L85 PathProgramCache]: Analyzing trace with hash -823394398, now seen corresponding path program 1 times [2022-03-17 19:36:56,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:36:56,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815045931] [2022-03-17 19:36:56,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:36:56,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:36:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:56,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:36:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:36:56,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:36:56,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815045931] [2022-03-17 19:36:56,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815045931] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:36:56,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:36:56,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 19:36:56,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745685346] [2022-03-17 19:36:56,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:36:56,933 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 19:36:56,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:36:56,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 19:36:56,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 19:36:56,934 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-03-17 19:36:57,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:36:57,011 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-03-17 19:36:57,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 19:36:57,011 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-03-17 19:36:57,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:36:57,012 INFO L225 Difference]: With dead ends: 76 [2022-03-17 19:36:57,012 INFO L226 Difference]: Without dead ends: 74 [2022-03-17 19:36:57,012 INFO L911 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-03-17 19:36:57,015 INFO L912 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.0s IncrementalHoareTripleChecker+Time [2022-03-17 19:36:57,015 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 70 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 19:36:57,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-03-17 19:36:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-03-17 19:36:57,019 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-03-17 19:36:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-03-17 19:36:57,020 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2022-03-17 19:36:57,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:36:57,020 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-03-17 19:36:57,020 INFO L479 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-03-17 19:36:57,020 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-03-17 19:36:57,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-17 19:36:57,021 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:36:57,021 INFO L500 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-03-17 19:36:57,021 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-17 19:36:57,021 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:36:57,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:36:57,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1183023144, now seen corresponding path program 1 times [2022-03-17 19:36:57,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:36:57,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943969818] [2022-03-17 19:36:57,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:36:57,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:36:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:57,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:36:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:36:57,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:36:57,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943969818] [2022-03-17 19:36:57,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943969818] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:36:57,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:36:57,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 19:36:57,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583282568] [2022-03-17 19:36:57,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:36:57,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 19:36:57,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:36:57,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 19:36:57,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 19:36:57,101 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-03-17 19:36:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:36:57,354 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-03-17 19:36:57,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-17 19:36:57,354 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-03-17 19:36:57,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:36:57,355 INFO L225 Difference]: With dead ends: 141 [2022-03-17 19:36:57,355 INFO L226 Difference]: Without dead ends: 139 [2022-03-17 19:36:57,355 INFO L911 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-03-17 19:36:57,356 INFO L912 BasicCegarLoop]: 108 mSDtfsCounter, 235 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-03-17 19:36:57,356 INFO L913 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-03-17 19:36:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-03-17 19:36:57,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2022-03-17 19:36:57,361 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-03-17 19:36:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-03-17 19:36:57,361 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2022-03-17 19:36:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:36:57,361 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-03-17 19:36:57,362 INFO L479 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-03-17 19:36:57,362 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-03-17 19:36:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-17 19:36:57,362 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:36:57,362 INFO L500 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-03-17 19:36:57,362 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-17 19:36:57,362 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:36:57,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:36:57,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1182992326, now seen corresponding path program 1 times [2022-03-17 19:36:57,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:36:57,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514042036] [2022-03-17 19:36:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:36:57,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:36:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:57,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:36:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:36:57,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:36:57,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514042036] [2022-03-17 19:36:57,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514042036] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:36:57,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:36:57,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 19:36:57,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246559857] [2022-03-17 19:36:57,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:36:57,414 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 19:36:57,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:36:57,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 19:36:57,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 19:36:57,415 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-03-17 19:36:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:36:57,582 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2022-03-17 19:36:57,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-17 19:36:57,582 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-03-17 19:36:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:36:57,584 INFO L225 Difference]: With dead ends: 108 [2022-03-17 19:36:57,584 INFO L226 Difference]: Without dead ends: 106 [2022-03-17 19:36:57,584 INFO L911 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-03-17 19:36:57,586 INFO L912 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-03-17 19:36:57,587 INFO L913 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-03-17 19:36:57,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-03-17 19:36:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2022-03-17 19:36:57,596 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-03-17 19:36:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-03-17 19:36:57,598 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2022-03-17 19:36:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:36:57,600 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-03-17 19:36:57,600 INFO L479 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-03-17 19:36:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-03-17 19:36:57,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-17 19:36:57,601 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:36:57,601 INFO L500 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-03-17 19:36:57,601 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-17 19:36:57,601 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:36:57,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:36:57,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1980989516, now seen corresponding path program 1 times [2022-03-17 19:36:57,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:36:57,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521354192] [2022-03-17 19:36:57,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:36:57,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:36:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:57,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:36:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:36:57,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:36:57,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521354192] [2022-03-17 19:36:57,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521354192] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:36:57,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:36:57,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 19:36:57,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024012643] [2022-03-17 19:36:57,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:36:57,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 19:36:57,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:36:57,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 19:36:57,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 19:36:57,671 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-03-17 19:36:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:36:57,795 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2022-03-17 19:36:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 19:36:57,796 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-03-17 19:36:57,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:36:57,798 INFO L225 Difference]: With dead ends: 121 [2022-03-17 19:36:57,798 INFO L226 Difference]: Without dead ends: 119 [2022-03-17 19:36:57,802 INFO L911 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-03-17 19:36:57,804 INFO L912 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-03-17 19:36:57,805 INFO L913 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-03-17 19:36:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-03-17 19:36:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2022-03-17 19:36:57,817 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-03-17 19:36:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-03-17 19:36:57,818 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2022-03-17 19:36:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:36:57,818 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-03-17 19:36:57,818 INFO L479 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-03-17 19:36:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-03-17 19:36:57,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-17 19:36:57,818 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:36:57,818 INFO L500 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-03-17 19:36:57,818 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-17 19:36:57,819 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:36:57,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:36:57,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1981944876, now seen corresponding path program 1 times [2022-03-17 19:36:57,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:36:57,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093248013] [2022-03-17 19:36:57,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:36:57,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:36:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:57,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:36:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:36:57,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:36:57,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093248013] [2022-03-17 19:36:57,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093248013] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:36:57,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:36:57,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 19:36:57,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594399821] [2022-03-17 19:36:57,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:36:57,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 19:36:57,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:36:57,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 19:36:57,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 19:36:57,895 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-03-17 19:36:57,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:36:57,990 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-03-17 19:36:57,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 19:36:57,990 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-03-17 19:36:57,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:36:57,991 INFO L225 Difference]: With dead ends: 77 [2022-03-17 19:36:57,991 INFO L226 Difference]: Without dead ends: 75 [2022-03-17 19:36:57,991 INFO L911 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-03-17 19:36:57,992 INFO L912 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.0s IncrementalHoareTripleChecker+Time [2022-03-17 19:36:57,992 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 70 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 19:36:57,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-03-17 19:36:58,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-03-17 19:36:58,029 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-03-17 19:36:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-03-17 19:36:58,029 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2022-03-17 19:36:58,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:36:58,030 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-03-17 19:36:58,030 INFO L479 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-03-17 19:36:58,030 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-03-17 19:36:58,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-17 19:36:58,030 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:36:58,030 INFO L500 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-03-17 19:36:58,030 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-17 19:36:58,031 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:36:58,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:36:58,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1978555952, now seen corresponding path program 1 times [2022-03-17 19:36:58,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:36:58,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315348380] [2022-03-17 19:36:58,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:36:58,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:36:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:58,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:36:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:36:58,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:36:58,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315348380] [2022-03-17 19:36:58,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315348380] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:36:58,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:36:58,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-17 19:36:58,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501009208] [2022-03-17 19:36:58,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:36:58,057 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-17 19:36:58,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:36:58,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-17 19:36:58,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-17 19:36:58,067 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-03-17 19:36:58,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:36:58,127 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-03-17 19:36:58,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-17 19:36:58,127 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-03-17 19:36:58,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:36:58,128 INFO L225 Difference]: With dead ends: 115 [2022-03-17 19:36:58,128 INFO L226 Difference]: Without dead ends: 75 [2022-03-17 19:36:58,128 INFO L911 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-03-17 19:36:58,130 INFO L912 BasicCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-03-17 19:36:58,130 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 78 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 19:36:58,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-03-17 19:36:58,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-03-17 19:36:58,137 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-03-17 19:36:58,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-03-17 19:36:58,138 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2022-03-17 19:36:58,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:36:58,139 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-03-17 19:36:58,139 INFO L479 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-03-17 19:36:58,139 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-03-17 19:36:58,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-17 19:36:58,140 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:36:58,140 INFO L500 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-03-17 19:36:58,140 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-17 19:36:58,140 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:36:58,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:36:58,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1860757727, now seen corresponding path program 1 times [2022-03-17 19:36:58,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:36:58,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322637668] [2022-03-17 19:36:58,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:36:58,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:36:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:58,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:36:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:36:58,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:36:58,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322637668] [2022-03-17 19:36:58,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322637668] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:36:58,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:36:58,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 19:36:58,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658212607] [2022-03-17 19:36:58,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:36:58,222 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 19:36:58,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:36:58,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 19:36:58,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-17 19:36:58,222 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-03-17 19:36:58,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:36:58,300 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-03-17 19:36:58,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 19:36:58,300 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-03-17 19:36:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:36:58,301 INFO L225 Difference]: With dead ends: 76 [2022-03-17 19:36:58,301 INFO L226 Difference]: Without dead ends: 74 [2022-03-17 19:36:58,301 INFO L911 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-03-17 19:36:58,301 INFO L912 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.0s IncrementalHoareTripleChecker+Time [2022-03-17 19:36:58,302 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 62 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 19:36:58,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-03-17 19:36:58,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-03-17 19:36:58,304 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-03-17 19:36:58,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-03-17 19:36:58,305 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2022-03-17 19:36:58,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:36:58,305 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-03-17 19:36:58,305 INFO L479 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-03-17 19:36:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-03-17 19:36:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-17 19:36:58,305 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:36:58,306 INFO L500 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-03-17 19:36:58,306 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-17 19:36:58,306 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:36:58,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:36:58,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1486248991, now seen corresponding path program 1 times [2022-03-17 19:36:58,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:36:58,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020420071] [2022-03-17 19:36:58,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:36:58,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:36:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:58,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:36:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:58,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 19:36:58,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:36:58,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020420071] [2022-03-17 19:36:58,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020420071] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 19:36:58,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70783837] [2022-03-17 19:36:58,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:36:58,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 19:36:58,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 19:36:58,346 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-03-17 19:36:58,347 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-03-17 19:36:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:58,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 19:36:58,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 19:36:58,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 19:36:58,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 19:36:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 19:36:58,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70783837] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 19:36:58,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 19:36:58,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-03-17 19:36:58,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613932805] [2022-03-17 19:36:58,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 19:36:58,561 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 19:36:58,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:36:58,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 19:36:58,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-17 19:36:58,561 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-03-17 19:36:58,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:36:58,681 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-03-17 19:36:58,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 19:36:58,682 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-03-17 19:36:58,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:36:58,682 INFO L225 Difference]: With dead ends: 111 [2022-03-17 19:36:58,682 INFO L226 Difference]: Without dead ends: 109 [2022-03-17 19:36:58,683 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-17 19:36:58,683 INFO L912 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-03-17 19:36:58,683 INFO L913 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-03-17 19:36:58,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-03-17 19:36:58,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2022-03-17 19:36:58,688 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-03-17 19:36:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-03-17 19:36:58,689 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2022-03-17 19:36:58,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:36:58,689 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-03-17 19:36:58,689 INFO L479 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-03-17 19:36:58,689 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-03-17 19:36:58,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-17 19:36:58,690 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:36:58,690 INFO L500 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-03-17 19:36:58,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-17 19:36:58,903 WARN L460 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-03-17 19:36:58,903 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:36:58,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:36:58,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1848916017, now seen corresponding path program 1 times [2022-03-17 19:36:58,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:36:58,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873280742] [2022-03-17 19:36:58,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:36:58,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:36:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:58,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:36:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:36:58,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:36:58,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873280742] [2022-03-17 19:36:58,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873280742] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:36:58,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:36:58,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 19:36:58,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447922417] [2022-03-17 19:36:58,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:36:58,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 19:36:58,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:36:58,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 19:36:58,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 19:36:58,952 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-03-17 19:36:59,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:36:59,017 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-03-17 19:36:59,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 19:36:59,017 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-03-17 19:36:59,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:36:59,017 INFO L225 Difference]: With dead ends: 70 [2022-03-17 19:36:59,017 INFO L226 Difference]: Without dead ends: 68 [2022-03-17 19:36:59,018 INFO L911 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-03-17 19:36:59,018 INFO L912 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.0s IncrementalHoareTripleChecker+Time [2022-03-17 19:36:59,019 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 60 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 19:36:59,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-03-17 19:36:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-03-17 19:36:59,022 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-03-17 19:36:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-03-17 19:36:59,023 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2022-03-17 19:36:59,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:36:59,023 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-03-17 19:36:59,023 INFO L479 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-03-17 19:36:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-03-17 19:36:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-17 19:36:59,025 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:36:59,025 INFO L500 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-03-17 19:36:59,026 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-17 19:36:59,026 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:36:59,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:36:59,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1170891010, now seen corresponding path program 1 times [2022-03-17 19:36:59,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:36:59,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849837529] [2022-03-17 19:36:59,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:36:59,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:36:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:59,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:36:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 19:36:59,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:36:59,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849837529] [2022-03-17 19:36:59,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849837529] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 19:36:59,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763707687] [2022-03-17 19:36:59,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:36:59,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 19:36:59,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 19:36:59,080 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-03-17 19:36:59,095 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-03-17 19:36:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:59,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 19:36:59,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 19:36:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 19:36:59,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 19:36:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 19:36:59,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763707687] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 19:36:59,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 19:36:59,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-03-17 19:36:59,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673651938] [2022-03-17 19:36:59,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 19:36:59,249 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 19:36:59,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:36:59,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 19:36:59,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-17 19:36:59,250 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-03-17 19:36:59,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:36:59,324 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-03-17 19:36:59,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 19:36:59,325 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-03-17 19:36:59,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:36:59,325 INFO L225 Difference]: With dead ends: 69 [2022-03-17 19:36:59,325 INFO L226 Difference]: Without dead ends: 67 [2022-03-17 19:36:59,325 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-17 19:36:59,326 INFO L912 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.0s IncrementalHoareTripleChecker+Time [2022-03-17 19:36:59,326 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 61 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 19:36:59,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-03-17 19:36:59,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-03-17 19:36:59,330 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-03-17 19:36:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-03-17 19:36:59,330 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2022-03-17 19:36:59,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:36:59,330 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-03-17 19:36:59,330 INFO L479 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-03-17 19:36:59,330 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-03-17 19:36:59,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-17 19:36:59,330 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:36:59,330 INFO L500 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-03-17 19:36:59,351 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-03-17 19:36:59,547 WARN L460 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-03-17 19:36:59,547 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:36:59,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:36:59,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1897188956, now seen corresponding path program 1 times [2022-03-17 19:36:59,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:36:59,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914171970] [2022-03-17 19:36:59,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:36:59,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:36:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:59,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:36:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:36:59,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:36:59,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914171970] [2022-03-17 19:36:59,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914171970] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:36:59,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:36:59,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 19:36:59,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723177319] [2022-03-17 19:36:59,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:36:59,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 19:36:59,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:36:59,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 19:36:59,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-17 19:36:59,600 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-03-17 19:36:59,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:36:59,665 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-03-17 19:36:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 19:36:59,666 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-03-17 19:36:59,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:36:59,666 INFO L225 Difference]: With dead ends: 63 [2022-03-17 19:36:59,666 INFO L226 Difference]: Without dead ends: 61 [2022-03-17 19:36:59,666 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-03-17 19:36:59,667 INFO L912 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.0s IncrementalHoareTripleChecker+Time [2022-03-17 19:36:59,667 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 54 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 19:36:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-17 19:36:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-03-17 19:36:59,669 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-03-17 19:36:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-03-17 19:36:59,670 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2022-03-17 19:36:59,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:36:59,670 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-03-17 19:36:59,670 INFO L479 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-03-17 19:36:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-03-17 19:36:59,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-17 19:36:59,670 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:36:59,670 INFO L500 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-03-17 19:36:59,670 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-17 19:36:59,670 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:36:59,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:36:59,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1316685848, now seen corresponding path program 1 times [2022-03-17 19:36:59,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:36:59,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489048665] [2022-03-17 19:36:59,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:36:59,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:36:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:59,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:36:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:36:59,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:36:59,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489048665] [2022-03-17 19:36:59,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489048665] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:36:59,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:36:59,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-17 19:36:59,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737932163] [2022-03-17 19:36:59,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:36:59,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 19:36:59,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:36:59,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 19:36:59,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-17 19:36:59,708 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-03-17 19:36:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:36:59,800 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-03-17 19:36:59,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 19:36:59,800 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-03-17 19:36:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:36:59,801 INFO L225 Difference]: With dead ends: 71 [2022-03-17 19:36:59,801 INFO L226 Difference]: Without dead ends: 69 [2022-03-17 19:36:59,802 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-17 19:36:59,803 INFO L912 BasicCegarLoop]: 40 mSDtfsCounter, 153 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-03-17 19:36:59,803 INFO L913 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-03-17 19:36:59,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-03-17 19:36:59,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-03-17 19:36:59,807 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-03-17 19:36:59,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-03-17 19:36:59,807 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2022-03-17 19:36:59,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:36:59,807 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-03-17 19:36:59,807 INFO L479 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-03-17 19:36:59,807 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-03-17 19:36:59,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-17 19:36:59,808 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:36:59,808 INFO L500 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-03-17 19:36:59,808 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-17 19:36:59,808 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:36:59,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:36:59,808 INFO L85 PathProgramCache]: Analyzing trace with hash -546914678, now seen corresponding path program 1 times [2022-03-17 19:36:59,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:36:59,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266594665] [2022-03-17 19:36:59,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:36:59,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:36:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:59,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:36:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:36:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:36:59,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:36:59,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266594665] [2022-03-17 19:36:59,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266594665] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:36:59,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:36:59,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 19:36:59,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042066910] [2022-03-17 19:36:59,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:36:59,853 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 19:36:59,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:36:59,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 19:36:59,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 19:36:59,854 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-03-17 19:36:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:36:59,996 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-03-17 19:36:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-17 19:36:59,996 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-03-17 19:36:59,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:36:59,997 INFO L225 Difference]: With dead ends: 91 [2022-03-17 19:36:59,997 INFO L226 Difference]: Without dead ends: 89 [2022-03-17 19:36:59,997 INFO L911 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-03-17 19:36:59,997 INFO L912 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-03-17 19:36:59,998 INFO L913 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-03-17 19:36:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-03-17 19:37:00,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2022-03-17 19:37:00,004 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-03-17 19:37:00,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-03-17 19:37:00,004 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2022-03-17 19:37:00,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:37:00,005 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-03-17 19:37:00,005 INFO L479 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-03-17 19:37:00,005 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-03-17 19:37:00,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-17 19:37:00,005 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:37:00,005 INFO L500 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-03-17 19:37:00,005 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-17 19:37:00,005 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:37:00,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:37:00,006 INFO L85 PathProgramCache]: Analyzing trace with hash 225515518, now seen corresponding path program 1 times [2022-03-17 19:37:00,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:37:00,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546035122] [2022-03-17 19:37:00,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:37:00,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:37:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:37:00,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:37:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:37:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:37:00,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:37:00,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546035122] [2022-03-17 19:37:00,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546035122] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:37:00,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:37:00,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 19:37:00,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179490210] [2022-03-17 19:37:00,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:37:00,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 19:37:00,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:37:00,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 19:37:00,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 19:37:00,064 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-03-17 19:37:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:37:00,161 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-03-17 19:37:00,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 19:37:00,161 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-03-17 19:37:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:37:00,162 INFO L225 Difference]: With dead ends: 61 [2022-03-17 19:37:00,162 INFO L226 Difference]: Without dead ends: 59 [2022-03-17 19:37:00,162 INFO L911 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-03-17 19:37:00,162 INFO L912 BasicCegarLoop]: 50 mSDtfsCounter, 110 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-03-17 19:37:00,162 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 67 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 19:37:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-17 19:37:00,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-03-17 19:37:00,166 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-03-17 19:37:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-03-17 19:37:00,166 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2022-03-17 19:37:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:37:00,166 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-03-17 19:37:00,166 INFO L479 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-03-17 19:37:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-03-17 19:37:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-17 19:37:00,166 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:37:00,167 INFO L500 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-03-17 19:37:00,167 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-17 19:37:00,167 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:37:00,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:37:00,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1972090370, now seen corresponding path program 1 times [2022-03-17 19:37:00,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:37:00,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268987012] [2022-03-17 19:37:00,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:37:00,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:37:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:37:00,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:37:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:37:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:37:00,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:37:00,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268987012] [2022-03-17 19:37:00,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268987012] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:37:00,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:37:00,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 19:37:00,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841697788] [2022-03-17 19:37:00,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:37:00,203 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 19:37:00,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:37:00,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 19:37:00,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 19:37:00,203 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-03-17 19:37:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:37:00,281 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-03-17 19:37:00,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 19:37:00,281 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-03-17 19:37:00,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:37:00,282 INFO L225 Difference]: With dead ends: 70 [2022-03-17 19:37:00,282 INFO L226 Difference]: Without dead ends: 68 [2022-03-17 19:37:00,282 INFO L911 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-03-17 19:37:00,282 INFO L912 BasicCegarLoop]: 65 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-03-17 19:37:00,282 INFO L913 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-03-17 19:37:00,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-03-17 19:37:00,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2022-03-17 19:37:00,286 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-03-17 19:37:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-03-17 19:37:00,286 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2022-03-17 19:37:00,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:37:00,286 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-03-17 19:37:00,286 INFO L479 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-03-17 19:37:00,286 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-03-17 19:37:00,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-17 19:37:00,286 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:37:00,287 INFO L500 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-03-17 19:37:00,287 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-17 19:37:00,287 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:37:00,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:37:00,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1005260689, now seen corresponding path program 1 times [2022-03-17 19:37:00,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:37:00,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467882681] [2022-03-17 19:37:00,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:37:00,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:37:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:37:00,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:37:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:37:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:37:00,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:37:00,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467882681] [2022-03-17 19:37:00,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467882681] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:37:00,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:37:00,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 19:37:00,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740946466] [2022-03-17 19:37:00,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:37:00,322 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 19:37:00,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:37:00,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 19:37:00,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 19:37:00,322 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-03-17 19:37:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:37:00,409 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-03-17 19:37:00,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 19:37:00,409 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-03-17 19:37:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:37:00,410 INFO L225 Difference]: With dead ends: 66 [2022-03-17 19:37:00,410 INFO L226 Difference]: Without dead ends: 64 [2022-03-17 19:37:00,410 INFO L911 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-03-17 19:37:00,410 INFO L912 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-03-17 19:37:00,411 INFO L913 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-03-17 19:37:00,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-03-17 19:37:00,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-03-17 19:37:00,414 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-03-17 19:37:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-03-17 19:37:00,414 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2022-03-17 19:37:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:37:00,415 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-03-17 19:37:00,415 INFO L479 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-03-17 19:37:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-03-17 19:37:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-17 19:37:00,415 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:37:00,415 INFO L500 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-03-17 19:37:00,415 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-17 19:37:00,415 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:37:00,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:37:00,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1098311654, now seen corresponding path program 1 times [2022-03-17 19:37:00,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:37:00,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283632404] [2022-03-17 19:37:00,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:37:00,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:37:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:37:00,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:37:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:37:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:37:00,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:37:00,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283632404] [2022-03-17 19:37:00,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283632404] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:37:00,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:37:00,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 19:37:00,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44199585] [2022-03-17 19:37:00,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:37:00,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 19:37:00,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:37:00,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 19:37:00,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 19:37:00,459 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-03-17 19:37:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:37:00,638 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-03-17 19:37:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-17 19:37:00,639 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-03-17 19:37:00,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:37:00,639 INFO L225 Difference]: With dead ends: 88 [2022-03-17 19:37:00,639 INFO L226 Difference]: Without dead ends: 86 [2022-03-17 19:37:00,639 INFO L911 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-03-17 19:37:00,640 INFO L912 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-03-17 19:37:00,640 INFO L913 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-03-17 19:37:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-03-17 19:37:00,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2022-03-17 19:37:00,643 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-03-17 19:37:00,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2022-03-17 19:37:00,644 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2022-03-17 19:37:00,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:37:00,644 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-03-17 19:37:00,644 INFO L479 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-03-17 19:37:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-03-17 19:37:00,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-17 19:37:00,644 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:37:00,644 INFO L500 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-03-17 19:37:00,644 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-17 19:37:00,644 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:37:00,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:37:00,645 INFO L85 PathProgramCache]: Analyzing trace with hash -312075723, now seen corresponding path program 1 times [2022-03-17 19:37:00,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:37:00,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393479696] [2022-03-17 19:37:00,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:37:00,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:37:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:37:00,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:37:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:37:00,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:37:00,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:37:00,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393479696] [2022-03-17 19:37:00,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393479696] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:37:00,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:37:00,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 19:37:00,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301834463] [2022-03-17 19:37:00,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:37:00,685 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 19:37:00,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:37:00,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 19:37:00,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 19:37:00,686 INFO L87 Difference]: Start difference. First operand 60 states and 63 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-03-17 19:37:00,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:37:00,796 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-03-17 19:37:00,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 19:37:00,796 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-03-17 19:37:00,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:37:00,796 INFO L225 Difference]: With dead ends: 73 [2022-03-17 19:37:00,797 INFO L226 Difference]: Without dead ends: 71 [2022-03-17 19:37:00,797 INFO L911 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-03-17 19:37:00,797 INFO L912 BasicCegarLoop]: 52 mSDtfsCounter, 81 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 19:37:00,797 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 69 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 19:37:00,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-03-17 19:37:00,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2022-03-17 19:37:00,800 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-03-17 19:37:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-03-17 19:37:00,801 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2022-03-17 19:37:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:37:00,801 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-03-17 19:37:00,801 INFO L479 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-03-17 19:37:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-03-17 19:37:00,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-17 19:37:00,801 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:37:00,801 INFO L500 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-03-17 19:37:00,801 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-17 19:37:00,801 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:37:00,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:37:00,802 INFO L85 PathProgramCache]: Analyzing trace with hash -283140749, now seen corresponding path program 1 times [2022-03-17 19:37:00,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:37:00,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137031644] [2022-03-17 19:37:00,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:37:00,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:37:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:37:00,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:37:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:37:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:37:00,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:37:00,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137031644] [2022-03-17 19:37:00,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137031644] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 19:37:00,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143810700] [2022-03-17 19:37:00,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:37:00,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 19:37:00,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 19:37:00,849 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-03-17 19:37:00,850 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-03-17 19:37:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:37:00,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 19:37:00,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 19:37:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:37:00,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 19:37:01,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 19:37:01,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143810700] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 19:37:01,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 19:37:01,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-03-17 19:37:01,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59375947] [2022-03-17 19:37:01,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 19:37:01,041 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 19:37:01,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:37:01,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 19:37:01,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-17 19:37:01,041 INFO L87 Difference]: Start difference. First operand 58 states and 61 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-03-17 19:37:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:37:01,109 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-03-17 19:37:01,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 19:37:01,111 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-03-17 19:37:01,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:37:01,111 INFO L225 Difference]: With dead ends: 58 [2022-03-17 19:37:01,111 INFO L226 Difference]: Without dead ends: 56 [2022-03-17 19:37:01,111 INFO L911 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-03-17 19:37:01,112 INFO L912 BasicCegarLoop]: 30 mSDtfsCounter, 98 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 19:37:01,112 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 42 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 19:37:01,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-03-17 19:37:01,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-03-17 19:37:01,115 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-03-17 19:37:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-03-17 19:37:01,115 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2022-03-17 19:37:01,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:37:01,115 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-03-17 19:37:01,115 INFO L479 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-03-17 19:37:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-03-17 19:37:01,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-17 19:37:01,116 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 19:37:01,116 INFO L500 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-03-17 19:37:01,134 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-03-17 19:37:01,331 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 19:37:01,332 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-17 19:37:01,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 19:37:01,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1506676067, now seen corresponding path program 1 times [2022-03-17 19:37:01,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 19:37:01,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353495186] [2022-03-17 19:37:01,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 19:37:01,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 19:37:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:37:01,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 19:37:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 19:37:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 19:37:01,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 19:37:01,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353495186] [2022-03-17 19:37:01,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353495186] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 19:37:01,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 19:37:01,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 19:37:01,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667906427] [2022-03-17 19:37:01,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 19:37:01,370 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 19:37:01,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 19:37:01,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 19:37:01,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 19:37:01,370 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-03-17 19:37:01,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 19:37:01,508 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-03-17 19:37:01,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 19:37:01,508 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-03-17 19:37:01,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 19:37:01,508 INFO L225 Difference]: With dead ends: 75 [2022-03-17 19:37:01,508 INFO L226 Difference]: Without dead ends: 0 [2022-03-17 19:37:01,509 INFO L911 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-03-17 19:37:01,509 INFO L912 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-03-17 19:37:01,509 INFO L913 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-03-17 19:37:01,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-17 19:37:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-17 19:37:01,509 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-03-17 19:37:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-17 19:37:01,510 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-03-17 19:37:01,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 19:37:01,510 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-17 19:37:01,510 INFO L479 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-03-17 19:37:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-17 19:37:01,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-17 19:37:01,512 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-03-17 19:37:01,512 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-03-17 19:37:01,512 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-03-17 19:37:01,512 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-03-17 19:37:01,512 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-03-17 19:37:01,512 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-03-17 19:37:01,512 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-03-17 19:37:01,512 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-03-17 19:37:01,512 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-03-17 19:37:01,512 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-03-17 19:37:01,512 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-03-17 19:37:01,513 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-03-17 19:37:01,513 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-03-17 19:37:01,513 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-03-17 19:37:01,513 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-03-17 19:37:01,513 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-03-17 19:37:01,513 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-03-17 19:37:01,513 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-03-17 19:37:01,513 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-17 19:37:01,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-17 19:37:27,647 WARN L232 SmtUtils]: Spent 20.80s 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-03-17 19:37:28,264 INFO L878 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-03-17 19:37:28,265 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-03-17 19:37:28,265 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-03-17 19:37:28,265 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-17 19:37:28,265 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-17 19:37:28,265 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-03-17 19:37:28,265 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-03-17 19:37:28,265 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 13 439) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-03-17 19:37:28,265 INFO L882 garLoopResultBuilder]: For program point L23(lines 23 438) no Hoare annotation was computed. [2022-03-17 19:37:28,265 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 13 439) no Hoare annotation was computed. [2022-03-17 19:37:28,265 INFO L882 garLoopResultBuilder]: For program point L29(lines 29 437) no Hoare annotation was computed. [2022-03-17 19:37:28,265 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 13 439) no Hoare annotation was computed. [2022-03-17 19:37:28,265 INFO L882 garLoopResultBuilder]: For program point L35(lines 35 436) no Hoare annotation was computed. [2022-03-17 19:37:28,265 INFO L882 garLoopResultBuilder]: For program point L41(lines 41 435) no Hoare annotation was computed. [2022-03-17 19:37:28,265 INFO L882 garLoopResultBuilder]: For program point L47(lines 47 434) no Hoare annotation was computed. [2022-03-17 19:37:28,265 INFO L882 garLoopResultBuilder]: For program point L53(lines 53 433) no Hoare annotation was computed. [2022-03-17 19:37:28,266 INFO L882 garLoopResultBuilder]: For program point L59(lines 59 432) no Hoare annotation was computed. [2022-03-17 19:37:28,266 INFO L882 garLoopResultBuilder]: For program point L61(lines 61 427) no Hoare annotation was computed. [2022-03-17 19:37:28,266 INFO L882 garLoopResultBuilder]: For program point L63(lines 63 422) no Hoare annotation was computed. [2022-03-17 19:37:28,266 INFO L882 garLoopResultBuilder]: For program point L65(lines 65 417) no Hoare annotation was computed. [2022-03-17 19:37:28,266 INFO L882 garLoopResultBuilder]: For program point L71(lines 71 416) no Hoare annotation was computed. [2022-03-17 19:37:28,266 INFO L882 garLoopResultBuilder]: For program point L83(lines 83 414) no Hoare annotation was computed. [2022-03-17 19:37:28,266 INFO L882 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-03-17 19:37:28,267 INFO L882 garLoopResultBuilder]: For program point L95(lines 95 412) no Hoare annotation was computed. [2022-03-17 19:37:28,267 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2022-03-17 19:37:28,267 INFO L882 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-03-17 19:37:28,267 INFO L882 garLoopResultBuilder]: For program point L104(lines 104 411) no Hoare annotation was computed. [2022-03-17 19:37:28,267 INFO L882 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2022-03-17 19:37:28,267 INFO L882 garLoopResultBuilder]: For program point L111(lines 111 405) no Hoare annotation was computed. [2022-03-17 19:37:28,267 INFO L878 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-03-17 19:37:28,267 INFO L882 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-03-17 19:37:28,267 INFO L882 garLoopResultBuilder]: For program point L123(lines 123 403) no Hoare annotation was computed. [2022-03-17 19:37:28,267 INFO L882 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2022-03-17 19:37:28,267 INFO L882 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-03-17 19:37:28,268 INFO L878 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-03-17 19:37:28,268 INFO L882 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2022-03-17 19:37:28,268 INFO L882 garLoopResultBuilder]: For program point L135(lines 135 397) no Hoare annotation was computed. [2022-03-17 19:37:28,268 INFO L878 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-03-17 19:37:28,268 INFO L882 garLoopResultBuilder]: For program point L372(lines 372 395) no Hoare annotation was computed. [2022-03-17 19:37:28,268 INFO L882 garLoopResultBuilder]: For program point L143(lines 143 362) no Hoare annotation was computed. [2022-03-17 19:37:28,268 INFO L882 garLoopResultBuilder]: For program point L374(line 374) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point L384(lines 384 393) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point L155(lines 155 360) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point L386(line 386) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point L162(lines 162 359) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point L175(lines 175 357) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point L187(lines 187 355) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point L194(lines 194 354) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point L204(lines 204 353) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point L212(lines 212 346) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point L224(lines 224 344) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2022-03-17 19:37:28,269 INFO L882 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-03-17 19:37:28,270 INFO L878 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-03-17 19:37:28,270 INFO L882 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2022-03-17 19:37:28,270 INFO L882 garLoopResultBuilder]: For program point L234(lines 234 338) no Hoare annotation was computed. [2022-03-17 19:37:28,270 INFO L882 garLoopResultBuilder]: For program point L241(lines 241 331) no Hoare annotation was computed. [2022-03-17 19:37:28,270 INFO L882 garLoopResultBuilder]: For program point L243(line 243) no Hoare annotation was computed. [2022-03-17 19:37:28,270 INFO L882 garLoopResultBuilder]: For program point L253(lines 253 329) no Hoare annotation was computed. [2022-03-17 19:37:28,270 INFO L882 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2022-03-17 19:37:28,270 INFO L882 garLoopResultBuilder]: For program point L255(line 255) no Hoare annotation was computed. [2022-03-17 19:37:28,270 INFO L882 garLoopResultBuilder]: For program point L262(lines 262 328) no Hoare annotation was computed. [2022-03-17 19:37:28,270 INFO L882 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2022-03-17 19:37:28,270 INFO L882 garLoopResultBuilder]: For program point L270(lines 270 322) no Hoare annotation was computed. [2022-03-17 19:37:28,270 INFO L878 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-03-17 19:37:28,270 INFO L882 garLoopResultBuilder]: For program point L272(line 272) no Hoare annotation was computed. [2022-03-17 19:37:28,270 INFO L882 garLoopResultBuilder]: For program point L282(lines 282 320) no Hoare annotation was computed. [2022-03-17 19:37:28,271 INFO L882 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2022-03-17 19:37:28,271 INFO L882 garLoopResultBuilder]: For program point L284(line 284) no Hoare annotation was computed. [2022-03-17 19:37:28,271 INFO L882 garLoopResultBuilder]: For program point L294(lines 294 318) no Hoare annotation was computed. [2022-03-17 19:37:28,271 INFO L882 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2022-03-17 19:37:28,271 INFO L882 garLoopResultBuilder]: For program point L296(line 296) no Hoare annotation was computed. [2022-03-17 19:37:28,271 INFO L882 garLoopResultBuilder]: For program point L306(lines 306 316) no Hoare annotation was computed. [2022-03-17 19:37:28,272 INFO L882 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2022-03-17 19:37:28,272 INFO L882 garLoopResultBuilder]: For program point L308(line 308) no Hoare annotation was computed. [2022-03-17 19:37:28,272 INFO L882 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2022-03-17 19:37:28,274 INFO L718 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-03-17 19:37:28,275 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-17 19:37:28,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 07:37:28 BasicIcfg [2022-03-17 19:37:28,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-17 19:37:28,307 INFO L158 Benchmark]: Toolchain (without parser) took 32829.64ms. Allocated memory was 188.7MB in the beginning and 490.7MB in the end (delta: 302.0MB). Free memory was 136.7MB in the beginning and 216.3MB in the end (delta: -79.6MB). Peak memory consumption was 270.6MB. Max. memory is 8.0GB. [2022-03-17 19:37:28,307 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 188.7MB. Free memory was 153.1MB in the beginning and 153.0MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-17 19:37:28,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.58ms. Allocated memory is still 188.7MB. Free memory was 136.4MB in the beginning and 156.3MB in the end (delta: -20.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-17 19:37:28,309 INFO L158 Benchmark]: Boogie Preprocessor took 23.35ms. Allocated memory is still 188.7MB. Free memory was 156.3MB in the beginning and 154.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-17 19:37:28,309 INFO L158 Benchmark]: RCFGBuilder took 295.14ms. Allocated memory is still 188.7MB. Free memory was 154.4MB in the beginning and 138.6MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-17 19:37:28,309 INFO L158 Benchmark]: IcfgTransformer took 35.19ms. Allocated memory is still 188.7MB. Free memory was 138.6MB in the beginning and 136.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-17 19:37:28,309 INFO L158 Benchmark]: TraceAbstraction took 32244.56ms. Allocated memory was 188.7MB in the beginning and 490.7MB in the end (delta: 302.0MB). Free memory was 136.1MB in the beginning and 216.3MB in the end (delta: -80.1MB). Peak memory consumption was 270.8MB. Max. memory is 8.0GB. [2022-03-17 19:37:28,310 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.08ms. Allocated memory is still 188.7MB. Free memory was 153.1MB in the beginning and 153.0MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 227.58ms. Allocated memory is still 188.7MB. Free memory was 136.4MB in the beginning and 156.3MB in the end (delta: -20.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.35ms. Allocated memory is still 188.7MB. Free memory was 156.3MB in the beginning and 154.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 295.14ms. Allocated memory is still 188.7MB. Free memory was 154.4MB in the beginning and 138.6MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * IcfgTransformer took 35.19ms. Allocated memory is still 188.7MB. Free memory was 138.6MB in the beginning and 136.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 32244.56ms. Allocated memory was 188.7MB in the beginning and 490.7MB in the end (delta: 302.0MB). Free memory was 136.1MB in the beginning and 216.3MB in the end (delta: -80.1MB). Peak memory consumption was 270.8MB. 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: 374]: 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: 386]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 32.2s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 26.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3678 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3678 mSDsluCounter, 1687 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 360 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2587 IncrementalHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 1327 mSDtfsCounter, 2587 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.2s 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, 298 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 732 HoareAnnotationTreeSize, 9 FomulaSimplifications, 75985 FormulaSimplificationTreeSizeReduction, 26.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 370018 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s 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-03-17 19:37:28,339 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...