/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 11:56:46,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 11:56:46,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 11:56:46,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 11:56:46,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 11:56:46,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 11:56:46,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 11:56:46,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 11:56:46,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 11:56:46,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 11:56:46,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 11:56:46,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 11:56:46,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 11:56:46,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 11:56:46,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 11:56:46,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 11:56:46,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 11:56:46,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 11:56:46,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 11:56:46,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 11:56:46,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 11:56:46,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 11:56:46,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 11:56:46,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 11:56:46,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 11:56:46,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 11:56:46,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 11:56:46,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 11:56:46,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 11:56:46,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 11:56:46,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 11:56:46,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 11:56:46,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 11:56:46,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 11:56:46,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 11:56:46,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 11:56:46,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 11:56:46,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 11:56:46,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 11:56:46,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 11:56:46,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 11:56:46,840 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-02 11:56:46,865 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 11:56:46,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 11:56:46,866 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-02 11:56:46,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-02 11:56:46,867 INFO L138 SettingsManager]: * Use SBE=true [2021-05-02 11:56:46,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 11:56:46,867 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 11:56:46,867 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 11:56:46,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 11:56:46,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 11:56:46,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 11:56:46,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 11:56:46,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 11:56:46,868 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 11:56:46,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 11:56:46,868 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 11:56:46,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 11:56:46,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 11:56:46,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 11:56:46,869 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 11:56:46,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 11:56:46,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 11:56:46,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-02 11:56:46,869 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-02 11:56:46,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 11:56:46,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-02 11:56:46,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 11:56:46,870 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-02 11:56:46,870 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 11:56:47,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 11:56:47,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 11:56:47,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 11:56:47,257 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 11:56:47,258 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 11:56:47,258 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2021-05-02 11:56:47,312 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a775ec7/9e0129eef0fa49edac36aa253895a19d/FLAG1b59e1311 [2021-05-02 11:56:47,732 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 11:56:47,733 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2021-05-02 11:56:47,739 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a775ec7/9e0129eef0fa49edac36aa253895a19d/FLAG1b59e1311 [2021-05-02 11:56:47,752 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a775ec7/9e0129eef0fa49edac36aa253895a19d [2021-05-02 11:56:47,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 11:56:47,756 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 11:56:47,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 11:56:47,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 11:56:47,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 11:56:47,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:56:47" (1/1) ... [2021-05-02 11:56:47,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d5eaedf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:56:47, skipping insertion in model container [2021-05-02 11:56:47,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:56:47" (1/1) ... [2021-05-02 11:56:47,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 11:56:47,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 11:56:47,920 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[840,853] [2021-05-02 11:56:47,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 11:56:47,975 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 11:56:47,988 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[840,853] [2021-05-02 11:56:48,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 11:56:48,039 INFO L208 MainTranslator]: Completed translation [2021-05-02 11:56:48,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:56:48 WrapperNode [2021-05-02 11:56:48,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 11:56:48,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 11:56:48,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 11:56:48,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 11:56:48,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:56:48" (1/1) ... [2021-05-02 11:56:48,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:56:48" (1/1) ... [2021-05-02 11:56:48,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:56:48" (1/1) ... [2021-05-02 11:56:48,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:56:48" (1/1) ... [2021-05-02 11:56:48,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:56:48" (1/1) ... [2021-05-02 11:56:48,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:56:48" (1/1) ... [2021-05-02 11:56:48,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:56:48" (1/1) ... [2021-05-02 11:56:48,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 11:56:48,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 11:56:48,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 11:56:48,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 11:56:48,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:56:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 11:56:48,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 11:56:48,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 11:56:48,191 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 11:56:48,192 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 11:56:48,192 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2021-05-02 11:56:48,192 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2021-05-02 11:56:48,192 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 11:56:48,193 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 11:56:48,193 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 11:56:48,193 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-02 11:56:48,193 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-02 11:56:48,193 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 11:56:48,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 11:56:48,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 11:56:48,194 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2021-05-02 11:56:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2021-05-02 11:56:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2021-05-02 11:56:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-05-02 11:56:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy_ptr [2021-05-02 11:56:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2021-05-02 11:56:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2021-05-02 11:56:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2021-05-02 11:56:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2021-05-02 11:56:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2021-05-02 11:56:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2021-05-02 11:56:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2021-05-02 11:56:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2021-05-02 11:56:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2021-05-02 11:56:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure strrand [2021-05-02 11:56:48,196 INFO L130 BoogieDeclarations]: Found specification of procedure istrrand [2021-05-02 11:56:48,196 INFO L130 BoogieDeclarations]: Found specification of procedure istrchr [2021-05-02 11:56:48,196 INFO L130 BoogieDeclarations]: Found specification of procedure istrrchr [2021-05-02 11:56:48,196 INFO L130 BoogieDeclarations]: Found specification of procedure istrncmp [2021-05-02 11:56:48,196 INFO L130 BoogieDeclarations]: Found specification of procedure istrstr [2021-05-02 11:56:48,196 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2021-05-02 11:56:48,196 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcpy [2021-05-02 11:56:48,196 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcat [2021-05-02 11:56:48,197 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncat [2021-05-02 11:56:48,197 INFO L130 BoogieDeclarations]: Found specification of procedure r_memcpy [2021-05-02 11:56:48,197 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2021-05-02 11:56:48,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 11:56:48,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 11:56:48,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 11:56:48,197 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 11:56:48,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 11:56:48,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 11:56:48,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 11:56:48,573 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 11:56:48,574 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-05-02 11:56:48,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:56:48 BoogieIcfgContainer [2021-05-02 11:56:48,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 11:56:48,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 11:56:48,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 11:56:48,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 11:56:48,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:56:47" (1/3) ... [2021-05-02 11:56:48,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ac656b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:56:48, skipping insertion in model container [2021-05-02 11:56:48,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:56:48" (2/3) ... [2021-05-02 11:56:48,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ac656b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:56:48, skipping insertion in model container [2021-05-02 11:56:48,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:56:48" (3/3) ... [2021-05-02 11:56:48,583 INFO L111 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2021-05-02 11:56:48,589 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-02 11:56:48,595 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 11:56:48,608 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 11:56:48,634 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 11:56:48,634 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 11:56:48,634 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-02 11:56:48,634 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 11:56:48,634 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 11:56:48,634 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 11:56:48,634 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 11:56:48,634 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 11:56:48,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 11:56:48,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 11:56:48,654 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:56:48,654 INFO L523 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] [2021-05-02 11:56:48,655 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:56:48,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:56:48,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1687048304, now seen corresponding path program 1 times [2021-05-02 11:56:48,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:56:48,668 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538255092] [2021-05-02 11:56:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:56:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:48,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:56:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:48,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-05-02 11:56:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:56:48,898 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:56:48,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538255092] [2021-05-02 11:56:48,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538255092] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:56:48,898 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:56:48,899 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 11:56:48,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600215438] [2021-05-02 11:56:48,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 11:56:48,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:56:48,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 11:56:48,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 11:56:48,911 INFO L87 Difference]: Start difference. First operand has 51 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:56:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:56:49,085 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2021-05-02 11:56:49,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 11:56:49,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2021-05-02 11:56:49,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:56:49,091 INFO L225 Difference]: With dead ends: 93 [2021-05-02 11:56:49,091 INFO L226 Difference]: Without dead ends: 43 [2021-05-02 11:56:49,094 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 11:56:49,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-05-02 11:56:49,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-05-02 11:56:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 11:56:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2021-05-02 11:56:49,128 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 29 [2021-05-02 11:56:49,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:56:49,128 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2021-05-02 11:56:49,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:56:49,129 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2021-05-02 11:56:49,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 11:56:49,130 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:56:49,131 INFO L523 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] [2021-05-02 11:56:49,131 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 11:56:49,131 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:56:49,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:56:49,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1509330471, now seen corresponding path program 1 times [2021-05-02 11:56:49,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:56:49,133 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727569532] [2021-05-02 11:56:49,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:56:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:49,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:56:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:49,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-02 11:56:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:56:49,252 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:56:49,252 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727569532] [2021-05-02 11:56:49,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727569532] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:56:49,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:56:49,253 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 11:56:49,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739843593] [2021-05-02 11:56:49,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 11:56:49,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:56:49,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 11:56:49,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 11:56:49,258 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:56:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:56:49,380 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2021-05-02 11:56:49,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 11:56:49,381 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), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2021-05-02 11:56:49,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:56:49,383 INFO L225 Difference]: With dead ends: 78 [2021-05-02 11:56:49,383 INFO L226 Difference]: Without dead ends: 44 [2021-05-02 11:56:49,385 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 11:56:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-05-02 11:56:49,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-05-02 11:56:49,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 11:56:49,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2021-05-02 11:56:49,404 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 33 [2021-05-02 11:56:49,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:56:49,404 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2021-05-02 11:56:49,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:56:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2021-05-02 11:56:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 11:56:49,405 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:56:49,405 INFO L523 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] [2021-05-02 11:56:49,405 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 11:56:49,405 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:56:49,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:56:49,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1932032297, now seen corresponding path program 1 times [2021-05-02 11:56:49,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:56:49,405 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663988966] [2021-05-02 11:56:49,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:56:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:49,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:56:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:49,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-02 11:56:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:56:49,509 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:56:49,509 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663988966] [2021-05-02 11:56:49,509 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663988966] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:56:49,510 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:56:49,510 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 11:56:49,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557126079] [2021-05-02 11:56:49,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 11:56:49,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:56:49,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 11:56:49,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:56:49,512 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:56:49,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:56:49,700 INFO L93 Difference]: Finished difference Result 106 states and 136 transitions. [2021-05-02 11:56:49,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 11:56:49,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2021-05-02 11:56:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:56:49,702 INFO L225 Difference]: With dead ends: 106 [2021-05-02 11:56:49,702 INFO L226 Difference]: Without dead ends: 71 [2021-05-02 11:56:49,703 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 48.6ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 11:56:49,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-02 11:56:49,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2021-05-02 11:56:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 11:56:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2021-05-02 11:56:49,710 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 33 [2021-05-02 11:56:49,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:56:49,710 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2021-05-02 11:56:49,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:56:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2021-05-02 11:56:49,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 11:56:49,711 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:56:49,711 INFO L523 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] [2021-05-02 11:56:49,711 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 11:56:49,711 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:56:49,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:56:49,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1403704983, now seen corresponding path program 1 times [2021-05-02 11:56:49,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:56:49,712 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545055610] [2021-05-02 11:56:49,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:56:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:49,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:56:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:49,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-02 11:56:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:49,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:56:49,871 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:56:49,871 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545055610] [2021-05-02 11:56:49,872 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545055610] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:56:49,872 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:56:49,872 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 11:56:49,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4052449] [2021-05-02 11:56:49,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 11:56:49,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:56:49,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 11:56:49,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-05-02 11:56:49,873 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:56:50,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:56:50,184 INFO L93 Difference]: Finished difference Result 106 states and 136 transitions. [2021-05-02 11:56:50,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 11:56:50,184 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2021-05-02 11:56:50,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:56:50,186 INFO L225 Difference]: With dead ends: 106 [2021-05-02 11:56:50,186 INFO L226 Difference]: Without dead ends: 104 [2021-05-02 11:56:50,187 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 177.7ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-05-02 11:56:50,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-05-02 11:56:50,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2021-05-02 11:56:50,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 73 states have internal predecessors, (95), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 11:56:50,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2021-05-02 11:56:50,209 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 33 [2021-05-02 11:56:50,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:56:50,210 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2021-05-02 11:56:50,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:56:50,210 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2021-05-02 11:56:50,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 11:56:50,211 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:56:50,211 INFO L523 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] [2021-05-02 11:56:50,212 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 11:56:50,212 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:56:50,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:56:50,212 INFO L82 PathProgramCache]: Analyzing trace with hash 590439723, now seen corresponding path program 1 times [2021-05-02 11:56:50,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:56:50,212 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778174030] [2021-05-02 11:56:50,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:56:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:50,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:56:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:50,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-02 11:56:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:50,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:56:50,361 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:56:50,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778174030] [2021-05-02 11:56:50,361 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778174030] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:56:50,361 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:56:50,361 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 11:56:50,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446579196] [2021-05-02 11:56:50,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 11:56:50,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:56:50,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 11:56:50,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-05-02 11:56:50,363 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:56:50,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:56:50,656 INFO L93 Difference]: Finished difference Result 195 states and 257 transitions. [2021-05-02 11:56:50,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 11:56:50,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2021-05-02 11:56:50,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:56:50,659 INFO L225 Difference]: With dead ends: 195 [2021-05-02 11:56:50,660 INFO L226 Difference]: Without dead ends: 127 [2021-05-02 11:56:50,660 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 77.6ms TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-05-02 11:56:50,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-05-02 11:56:50,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2021-05-02 11:56:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 80 states have internal predecessors, (103), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 11:56:50,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2021-05-02 11:56:50,673 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 33 [2021-05-02 11:56:50,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:56:50,675 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2021-05-02 11:56:50,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:56:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2021-05-02 11:56:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-02 11:56:50,678 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:56:50,678 INFO L523 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] [2021-05-02 11:56:50,678 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 11:56:50,679 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:56:50,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:56:50,679 INFO L82 PathProgramCache]: Analyzing trace with hash -532744798, now seen corresponding path program 1 times [2021-05-02 11:56:50,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:56:50,680 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957372048] [2021-05-02 11:56:50,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:56:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:50,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:56:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:50,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-05-02 11:56:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:56:50,777 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:56:50,777 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957372048] [2021-05-02 11:56:50,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957372048] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:56:50,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:56:50,777 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 11:56:50,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162341373] [2021-05-02 11:56:50,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 11:56:50,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:56:50,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 11:56:50,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 11:56:50,779 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:56:50,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:56:50,927 INFO L93 Difference]: Finished difference Result 180 states and 227 transitions. [2021-05-02 11:56:50,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 11:56:50,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2021-05-02 11:56:50,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:56:50,929 INFO L225 Difference]: With dead ends: 180 [2021-05-02 11:56:50,929 INFO L226 Difference]: Without dead ends: 116 [2021-05-02 11:56:50,929 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 39.8ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 11:56:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-05-02 11:56:50,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 86. [2021-05-02 11:56:50,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 75 states have internal predecessors, (92), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 11:56:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2021-05-02 11:56:50,935 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 35 [2021-05-02 11:56:50,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:56:50,936 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2021-05-02 11:56:50,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:56:50,936 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2021-05-02 11:56:50,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-05-02 11:56:50,936 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:56:50,936 INFO L523 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, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:56:50,937 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 11:56:50,937 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:56:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:56:50,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1949287377, now seen corresponding path program 1 times [2021-05-02 11:56:50,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:56:50,937 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633750679] [2021-05-02 11:56:50,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:56:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:51,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:56:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:51,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-02 11:56:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-05-02 11:56:51,011 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:56:51,011 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633750679] [2021-05-02 11:56:51,012 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633750679] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:56:51,012 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:56:51,012 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 11:56:51,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687417165] [2021-05-02 11:56:51,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 11:56:51,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:56:51,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 11:56:51,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-05-02 11:56:51,013 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:56:51,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:56:51,267 INFO L93 Difference]: Finished difference Result 163 states and 204 transitions. [2021-05-02 11:56:51,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 11:56:51,267 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2021-05-02 11:56:51,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:56:51,268 INFO L225 Difference]: With dead ends: 163 [2021-05-02 11:56:51,268 INFO L226 Difference]: Without dead ends: 119 [2021-05-02 11:56:51,269 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 81.1ms TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-05-02 11:56:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-02 11:56:51,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2021-05-02 11:56:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 86 states have (on average 1.2674418604651163) internal successors, (109), 87 states have internal predecessors, (109), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 11:56:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2021-05-02 11:56:51,280 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 38 [2021-05-02 11:56:51,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:56:51,280 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2021-05-02 11:56:51,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:56:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2021-05-02 11:56:51,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-02 11:56:51,281 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:56:51,281 INFO L523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:56:51,281 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 11:56:51,281 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:56:51,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:56:51,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1669063770, now seen corresponding path program 1 times [2021-05-02 11:56:51,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:56:51,284 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283722318] [2021-05-02 11:56:51,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:56:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:51,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:56:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:51,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-05-02 11:56:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:56:51,360 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:56:51,360 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283722318] [2021-05-02 11:56:51,360 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283722318] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:56:51,360 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264501482] [2021-05-02 11:56:51,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:56:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:51,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2021-05-02 11:56:51,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:56:51,533 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:51,537 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:51,554 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:51,556 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:51,570 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:51,592 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:56:51,646 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264501482] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:56:51,646 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:56:51,646 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2021-05-02 11:56:51,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291115902] [2021-05-02 11:56:51,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 11:56:51,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:56:51,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 11:56:51,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-05-02 11:56:51,647 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 11:56:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:56:51,847 INFO L93 Difference]: Finished difference Result 243 states and 304 transitions. [2021-05-02 11:56:51,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 11:56:51,848 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2021-05-02 11:56:51,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:56:51,849 INFO L225 Difference]: With dead ends: 243 [2021-05-02 11:56:51,849 INFO L226 Difference]: Without dead ends: 173 [2021-05-02 11:56:51,849 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 65.9ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-05-02 11:56:51,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-05-02 11:56:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 135. [2021-05-02 11:56:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 121 states have (on average 1.2314049586776858) internal successors, (149), 122 states have internal predecessors, (149), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-05-02 11:56:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 165 transitions. [2021-05-02 11:56:51,857 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 165 transitions. Word has length 40 [2021-05-02 11:56:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:56:51,857 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 165 transitions. [2021-05-02 11:56:51,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 11:56:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 165 transitions. [2021-05-02 11:56:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-02 11:56:51,858 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:56:51,858 INFO L523 BasicCegarLoop]: trace histogram [3, 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] [2021-05-02 11:56:52,079 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-05-02 11:56:52,080 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:56:52,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:56:52,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1571153886, now seen corresponding path program 2 times [2021-05-02 11:56:52,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:56:52,080 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70557431] [2021-05-02 11:56:52,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:56:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:52,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:56:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:52,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-05-02 11:56:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:56:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:56:52,226 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:56:52,226 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70557431] [2021-05-02 11:56:52,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70557431] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:56:52,226 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105281905] [2021-05-02 11:56:52,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:56:52,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 11:56:52,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 11:56:52,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 13 conjunts are in the unsatisfiable core [2021-05-02 11:56:52,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:56:52,354 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:52,356 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:52,393 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:52,405 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:52,451 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:52,454 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:52,496 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:52,532 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:52,534 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:52,554 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:52,555 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:52,558 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:52,559 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:52,571 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:52,573 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:52,581 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:52,586 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:52,592 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:56:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:56:52,624 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105281905] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:56:52,624 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:56:52,624 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-05-02 11:56:52,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541430161] [2021-05-02 11:56:52,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-02 11:56:52,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:56:52,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-02 11:56:52,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-05-02 11:56:52,626 INFO L87 Difference]: Start difference. First operand 135 states and 165 transitions. Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 16 states have internal predecessors, (71), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 11:56:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:56:53,169 INFO L93 Difference]: Finished difference Result 250 states and 315 transitions. [2021-05-02 11:56:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 11:56:53,170 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 16 states have internal predecessors, (71), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2021-05-02 11:56:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:56:53,173 INFO L225 Difference]: With dead ends: 250 [2021-05-02 11:56:53,173 INFO L226 Difference]: Without dead ends: 248 [2021-05-02 11:56:53,174 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 361.1ms TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2021-05-02 11:56:53,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-05-02 11:56:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 191. [2021-05-02 11:56:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 174 states have (on average 1.2816091954022988) internal successors, (223), 176 states have internal predecessors, (223), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2021-05-02 11:56:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 243 transitions. [2021-05-02 11:56:53,192 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 243 transitions. Word has length 45 [2021-05-02 11:56:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:56:53,192 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 243 transitions. [2021-05-02 11:56:53,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 16 states have internal predecessors, (71), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 11:56:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 243 transitions. [2021-05-02 11:56:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-02 11:56:53,193 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:56:53,193 INFO L523 BasicCegarLoop]: trace histogram [3, 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] [2021-05-02 11:56:53,411 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:56:53,411 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:56:53,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:56:53,412 INFO L82 PathProgramCache]: Analyzing trace with hash -870089308, now seen corresponding path program 1 times [2021-05-02 11:56:53,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:56:53,412 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505662372] [2021-05-02 11:56:53,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:56:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 11:56:53,434 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 11:56:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 11:56:53,462 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 11:56:53,490 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-02 11:56:53,490 INFO L624 BasicCegarLoop]: Counterexample might be feasible [2021-05-02 11:56:53,491 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-02 11:56:53,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 11:56:53 BoogieIcfgContainer [2021-05-02 11:56:53,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 11:56:53,536 INFO L168 Benchmark]: Toolchain (without parser) took 5780.72 ms. Allocated memory was 219.2 MB in the beginning and 304.1 MB in the end (delta: 84.9 MB). Free memory was 184.8 MB in the beginning and 140.6 MB in the end (delta: 44.2 MB). Peak memory consumption was 130.1 MB. Max. memory is 8.0 GB. [2021-05-02 11:56:53,536 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 219.2 MB. Free memory is still 201.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 11:56:53,536 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.18 ms. Allocated memory is still 219.2 MB. Free memory was 184.4 MB in the beginning and 173.2 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-05-02 11:56:53,536 INFO L168 Benchmark]: Boogie Preprocessor took 85.56 ms. Allocated memory is still 219.2 MB. Free memory was 173.2 MB in the beginning and 201.8 MB in the end (delta: -28.7 MB). Peak memory consumption was 4.4 MB. Max. memory is 8.0 GB. [2021-05-02 11:56:53,537 INFO L168 Benchmark]: RCFGBuilder took 447.96 ms. Allocated memory is still 219.2 MB. Free memory was 201.8 MB in the beginning and 174.6 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. [2021-05-02 11:56:53,537 INFO L168 Benchmark]: TraceAbstraction took 4959.56 ms. Allocated memory was 219.2 MB in the beginning and 304.1 MB in the end (delta: 84.9 MB). Free memory was 174.0 MB in the beginning and 140.6 MB in the end (delta: 33.4 MB). Peak memory consumption was 118.4 MB. Max. memory is 8.0 GB. [2021-05-02 11:56:53,537 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.14 ms. Allocated memory is still 219.2 MB. Free memory is still 201.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 283.18 ms. Allocated memory is still 219.2 MB. Free memory was 184.4 MB in the beginning and 173.2 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 85.56 ms. Allocated memory is still 219.2 MB. Free memory was 173.2 MB in the beginning and 201.8 MB in the end (delta: -28.7 MB). Peak memory consumption was 4.4 MB. Max. memory is 8.0 GB. * RCFGBuilder took 447.96 ms. Allocated memory is still 219.2 MB. Free memory was 201.8 MB in the beginning and 174.6 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4959.56 ms. Allocated memory was 219.2 MB in the beginning and 304.1 MB in the end (delta: 84.9 MB). Free memory was 174.0 MB in the beginning and 140.6 MB in the end (delta: 33.4 MB). Peak memory consumption was 118.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L85] char A [2 + 2 + 4 +1]; [L86] A[2 + 2 + 4] = 0 VAL [A={6:0}] [L87] CALL parse_expression_list (A) VAL [str={6:0}] [L59] int start=0, i=-1, j=-1; [L60] char str2[2]; VAL [i=-1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}] [L61] COND FALSE !(!str) VAL [i=-1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}] [L63] i++ [L64] str[i] [L65] case 0: VAL [i=0, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=-1] [L80] EXPR str[i] VAL [i=0, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=-1] [L80] COND TRUE str[i] != 0 [L63] i++ [L64] str[i] [L65] case 0: VAL [i=1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=54] [L80] EXPR str[i] VAL [i=1, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=54] [L80] COND TRUE str[i] != 0 [L63] i++ [L64] str[i] [L65] case 0: VAL [i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0] [L66] EXPR str[start] [L66] (str[start] == ' ') || (str[start] == '\t') [L66] EXPR str[start] [L66] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[start]=-1, str[start]=-1] [L66] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L67] EXPR str[start] VAL [i=2, j=-1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[start]=-1] [L67] COND FALSE !(str[start] == '"') [L68] j = i-1 VAL [i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0] [L69] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L69] EXPR str[j] [L69] EXPR (str[j] == ' ') || (str[j] == '\t') [L69] EXPR str[j] [L69] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=54, str[j]=54] [L69] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=0, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=54, str[j]=54] [L69] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L70] (0 < j) && (str[j] == '"') [L70] EXPR str[j] [L70] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=0, i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0, str[j]=54] [L70] COND FALSE !((0 < j) && (str[j] == '"')) [L71] COND TRUE start<=j VAL [i=2, j=1, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0] [L72] CALL r_strncpy(str2, str+start, j-start+1) VAL [\old(n)=2, dest={3:0}, src={6:0}] [L41] return strncpy(dest,src,n); [L72] RET r_strncpy(str2, str+start, j-start+1) VAL [i=2, j=1, r_strncpy(str2, str+start, j-start+1)={52:55}, start=0, str={6:0}, str={6:0}, str2={3:0}, str[i]=0] [L73] CALL __VERIFIER_assert(j - start + 1 < 2) VAL [\old(cond)=0] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L15] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4859.5ms, OverallIterations: 10, TraceHistogramMax: 3, EmptinessCheckTime: 18.2ms, AutomataDifference: 2282.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 435 SDtfs, 864 SDslu, 1271 SDs, 0 SdLazy, 1640 SolverSat, 243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1174.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 898.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=9, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 126.8ms AutomataMinimizationTime, 9 MinimizatonAttempts, 221 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 62.3ms SsaConstructionTime, 223.2ms SatisfiabilityAnalysisTime, 1391.5ms InterpolantComputationTime, 449 NumberOfCodeBlocks, 449 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 393 ConstructedInterpolants, 0 QuantifiedInterpolants, 1355 SizeOfPredicates, 4 NumberOfNonLiveVariables, 384 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 2/24 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...