/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/list-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:27:13,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:27:13,584 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:27:13,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:27:13,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:27:13,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:27:13,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:27:13,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:27:13,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:27:13,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:27:13,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:27:13,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:27:13,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:27:13,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:27:13,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:27:13,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:27:13,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:27:13,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:27:13,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:27:13,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:27:13,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:27:13,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:27:13,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:27:13,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:27:13,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:27:13,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:27:13,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:27:13,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:27:13,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:27:13,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:27:13,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:27:13,676 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:27:13,677 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:27:13,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:27:13,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:27:13,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:27:13,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:27:13,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:27:13,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:27:13,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:27:13,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:27:13,684 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 [2020-11-06 22:27:13,709 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:27:13,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:27:13,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:27:13,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:27:13,712 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:27:13,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:27:13,712 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:27:13,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:27:13,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:27:13,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:27:13,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:27:13,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:27:13,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:27:13,714 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:27:13,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:27:13,714 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:27:13,714 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:27:13,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:27:13,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:27:13,715 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:27:13,715 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:27:13,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:27:13,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:27:13,716 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:27:13,716 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:27:13,716 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:27:13,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:27:13,717 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:27:13,717 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:27:13,717 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 [2020-11-06 22:27:14,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:27:14,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:27:14,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:27:14,134 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:27:14,135 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:27:14,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list-2.i [2020-11-06 22:27:14,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/910a6334d/0f0dbd4a5cc049fc8b4f85bebb48a0ad/FLAGcd6dbf6ff [2020-11-06 22:27:14,966 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:27:14,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list-2.i [2020-11-06 22:27:14,984 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/910a6334d/0f0dbd4a5cc049fc8b4f85bebb48a0ad/FLAGcd6dbf6ff [2020-11-06 22:27:15,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/910a6334d/0f0dbd4a5cc049fc8b4f85bebb48a0ad [2020-11-06 22:27:15,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:27:15,271 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:27:15,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:27:15,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:27:15,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:27:15,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:15" (1/1) ... [2020-11-06 22:27:15,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1494773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:15, skipping insertion in model container [2020-11-06 22:27:15,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:15" (1/1) ... [2020-11-06 22:27:15,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:27:15,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:27:15,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:27:15,682 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:27:15,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:27:15,825 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:27:15,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:15 WrapperNode [2020-11-06 22:27:15,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:27:15,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:27:15,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:27:15,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:27:15,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:15" (1/1) ... [2020-11-06 22:27:15,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:15" (1/1) ... [2020-11-06 22:27:15,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:15" (1/1) ... [2020-11-06 22:27:15,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:15" (1/1) ... [2020-11-06 22:27:15,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:15" (1/1) ... [2020-11-06 22:27:15,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:15" (1/1) ... [2020-11-06 22:27:15,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:15" (1/1) ... [2020-11-06 22:27:15,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:27:15,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:27:15,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:27:15,923 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:27:15,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:15" (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 [2020-11-06 22:27:16,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:27:16,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:27:16,019 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:27:16,019 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-06 22:27:16,019 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-06 22:27:16,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-11-06 22:27:16,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-11-06 22:27:16,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-11-06 22:27:16,020 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-11-06 22:27:16,020 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:27:16,021 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:27:16,021 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:27:16,021 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-06 22:27:16,021 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-06 22:27:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:27:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:27:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:27:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-06 22:27:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-06 22:27:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-06 22:27:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-06 22:27:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-06 22:27:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-06 22:27:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-06 22:27:16,024 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-06 22:27:16,024 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-06 22:27:16,024 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-06 22:27:16,024 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-06 22:27:16,024 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-06 22:27:16,024 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-06 22:27:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-06 22:27:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-06 22:27:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-06 22:27:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-06 22:27:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-06 22:27:16,026 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-11-06 22:27:16,026 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-11-06 22:27:16,026 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-11-06 22:27:16,026 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-06 22:27:16,026 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-06 22:27:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-06 22:27:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-06 22:27:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-06 22:27:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-06 22:27:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-06 22:27:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-06 22:27:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-06 22:27:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-06 22:27:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-06 22:27:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-06 22:27:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-06 22:27:16,029 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-06 22:27:16,029 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-06 22:27:16,029 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-06 22:27:16,029 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-06 22:27:16,029 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-06 22:27:16,029 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-06 22:27:16,030 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-06 22:27:16,030 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-06 22:27:16,030 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-06 22:27:16,030 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-06 22:27:16,030 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-06 22:27:16,030 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-06 22:27:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-06 22:27:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-06 22:27:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-06 22:27:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-06 22:27:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-06 22:27:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-06 22:27:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-06 22:27:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-06 22:27:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-06 22:27:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-06 22:27:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-06 22:27:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-06 22:27:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-06 22:27:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-06 22:27:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-06 22:27:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-06 22:27:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-06 22:27:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-06 22:27:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-06 22:27:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-06 22:27:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-06 22:27:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-06 22:27:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-06 22:27:16,035 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-06 22:27:16,035 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-06 22:27:16,035 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-06 22:27:16,035 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-06 22:27:16,035 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-06 22:27:16,036 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-06 22:27:16,036 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-06 22:27:16,036 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-06 22:27:16,036 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-06 22:27:16,036 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-06 22:27:16,036 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-06 22:27:16,036 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-06 22:27:16,037 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-06 22:27:16,037 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-06 22:27:16,037 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-06 22:27:16,037 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-06 22:27:16,037 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-06 22:27:16,037 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-06 22:27:16,038 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-06 22:27:16,038 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-06 22:27:16,038 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-06 22:27:16,038 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-06 22:27:16,038 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-06 22:27:16,038 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-06 22:27:16,038 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-06 22:27:16,039 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-06 22:27:16,039 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-06 22:27:16,039 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-06 22:27:16,039 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-06 22:27:16,039 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-06 22:27:16,039 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-06 22:27:16,040 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-06 22:27:16,040 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-06 22:27:16,040 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-06 22:27:16,040 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-06 22:27:16,040 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-06 22:27:16,040 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-06 22:27:16,041 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-11-06 22:27:16,041 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:27:16,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-06 22:27:16,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:27:16,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-06 22:27:16,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-06 22:27:16,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:27:16,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:27:16,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:27:16,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:27:16,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:27:16,412 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-11-06 22:27:16,562 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:27:16,563 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-11-06 22:27:16,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:16 BoogieIcfgContainer [2020-11-06 22:27:16,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:27:16,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:27:16,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:27:16,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:27:16,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:27:15" (1/3) ... [2020-11-06 22:27:16,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cda921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:16, skipping insertion in model container [2020-11-06 22:27:16,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:15" (2/3) ... [2020-11-06 22:27:16,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cda921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:16, skipping insertion in model container [2020-11-06 22:27:16,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:16" (3/3) ... [2020-11-06 22:27:16,575 INFO L111 eAbstractionObserver]: Analyzing ICFG list-2.i [2020-11-06 22:27:16,591 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:27:16,595 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:27:16,608 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:27:16,637 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:27:16,637 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:27:16,637 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:27:16,637 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:27:16,637 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:27:16,638 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:27:16,638 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:27:16,638 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:27:16,656 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-11-06 22:27:16,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-06 22:27:16,662 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:16,663 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:27:16,663 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:16,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:16,670 INFO L82 PathProgramCache]: Analyzing trace with hash 620344659, now seen corresponding path program 1 times [2020-11-06 22:27:16,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:16,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180690358] [2020-11-06 22:27:16,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:16,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:16,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180690358] [2020-11-06 22:27:16,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:16,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-06 22:27:16,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636073556] [2020-11-06 22:27:16,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:27:16,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:16,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:27:16,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-06 22:27:16,934 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-11-06 22:27:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:17,049 INFO L93 Difference]: Finished difference Result 63 states and 84 transitions. [2020-11-06 22:27:17,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:27:17,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-11-06 22:27:17,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:17,059 INFO L225 Difference]: With dead ends: 63 [2020-11-06 22:27:17,059 INFO L226 Difference]: Without dead ends: 27 [2020-11-06 22:27:17,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-06 22:27:17,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-11-06 22:27:17,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-11-06 22:27:17,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-11-06 22:27:17,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2020-11-06 22:27:17,104 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2020-11-06 22:27:17,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:17,105 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-11-06 22:27:17,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:27:17,105 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-11-06 22:27:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-06 22:27:17,106 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:17,106 INFO L422 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] [2020-11-06 22:27:17,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:27:17,107 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:17,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:17,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1278182859, now seen corresponding path program 1 times [2020-11-06 22:27:17,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:17,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827168879] [2020-11-06 22:27:17,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:17,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:17,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827168879] [2020-11-06 22:27:17,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:17,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:27:17,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866251233] [2020-11-06 22:27:17,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:27:17,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:17,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:27:17,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:27:17,291 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2020-11-06 22:27:17,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:17,437 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2020-11-06 22:27:17,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:27:17,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-11-06 22:27:17,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:17,441 INFO L225 Difference]: With dead ends: 53 [2020-11-06 22:27:17,441 INFO L226 Difference]: Without dead ends: 47 [2020-11-06 22:27:17,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:27:17,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-06 22:27:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2020-11-06 22:27:17,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-11-06 22:27:17,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2020-11-06 22:27:17,453 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 22 [2020-11-06 22:27:17,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:17,453 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2020-11-06 22:27:17,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:27:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2020-11-06 22:27:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-06 22:27:17,454 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:17,455 INFO L422 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] [2020-11-06 22:27:17,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:27:17,455 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:17,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash -511611450, now seen corresponding path program 1 times [2020-11-06 22:27:17,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:17,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193279787] [2020-11-06 22:27:17,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:17,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:17,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193279787] [2020-11-06 22:27:17,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:17,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:27:17,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225006434] [2020-11-06 22:27:17,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:27:17,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:17,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:27:17,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:27:17,559 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 6 states. [2020-11-06 22:27:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:17,700 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2020-11-06 22:27:17,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:27:17,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-11-06 22:27:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:17,702 INFO L225 Difference]: With dead ends: 55 [2020-11-06 22:27:17,702 INFO L226 Difference]: Without dead ends: 45 [2020-11-06 22:27:17,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:27:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-11-06 22:27:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2020-11-06 22:27:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-06 22:27:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2020-11-06 22:27:17,711 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 24 [2020-11-06 22:27:17,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:17,711 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2020-11-06 22:27:17,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:27:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-11-06 22:27:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-06 22:27:17,712 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:17,712 INFO L422 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] [2020-11-06 22:27:17,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:27:17,713 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:17,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:17,714 INFO L82 PathProgramCache]: Analyzing trace with hash 680437702, now seen corresponding path program 1 times [2020-11-06 22:27:17,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:17,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211149235] [2020-11-06 22:27:17,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:17,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:17,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211149235] [2020-11-06 22:27:17,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:17,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:27:17,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969972326] [2020-11-06 22:27:17,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:27:17,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:27:17,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:27:17,833 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 6 states. [2020-11-06 22:27:17,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:17,978 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2020-11-06 22:27:17,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:27:17,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-11-06 22:27:17,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:17,979 INFO L225 Difference]: With dead ends: 55 [2020-11-06 22:27:17,980 INFO L226 Difference]: Without dead ends: 42 [2020-11-06 22:27:17,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:27:17,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-06 22:27:17,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2020-11-06 22:27:17,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-06 22:27:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-11-06 22:27:17,987 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 24 [2020-11-06 22:27:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:17,987 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-11-06 22:27:17,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:27:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-11-06 22:27:17,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-06 22:27:17,988 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:17,989 INFO L422 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] [2020-11-06 22:27:17,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:27:17,989 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:17,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:17,990 INFO L82 PathProgramCache]: Analyzing trace with hash 134346418, now seen corresponding path program 1 times [2020-11-06 22:27:17,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:17,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009594458] [2020-11-06 22:27:17,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:18,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:18,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009594458] [2020-11-06 22:27:18,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885948137] [2020-11-06 22:27:18,192 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 [2020-11-06 22:27:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:18,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 30 conjunts are in the unsatisfiable core [2020-11-06 22:27:18,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:27:18,420 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-06 22:27:18,420 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:18,427 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:18,428 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:18,428 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-06 22:27:18,503 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:18,503 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-06 22:27:18,504 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:18,518 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:18,524 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:27:18,525 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:18,537 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:18,537 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:18,538 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2020-11-06 22:27:18,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:27:18,593 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-06 22:27:18,593 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:18,607 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:18,607 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:18,608 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2020-11-06 22:27:18,657 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-06 22:27:18,658 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:18,668 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:18,671 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-06 22:27:18,671 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2020-11-06 22:27:18,728 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-11-06 22:27:18,730 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:18,737 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:18,739 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:18,739 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2020-11-06 22:27:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:18,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:27:18,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-11-06 22:27:18,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285034903] [2020-11-06 22:27:18,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-06 22:27:18,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:18,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-06 22:27:18,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:27:18,746 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 14 states. [2020-11-06 22:27:19,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:19,100 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2020-11-06 22:27:19,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-06 22:27:19,101 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2020-11-06 22:27:19,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:19,102 INFO L225 Difference]: With dead ends: 57 [2020-11-06 22:27:19,102 INFO L226 Difference]: Without dead ends: 49 [2020-11-06 22:27:19,103 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2020-11-06 22:27:19,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-06 22:27:19,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2020-11-06 22:27:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-11-06 22:27:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2020-11-06 22:27:19,109 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 26 [2020-11-06 22:27:19,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:19,110 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-11-06 22:27:19,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-06 22:27:19,110 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-11-06 22:27:19,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-06 22:27:19,111 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:19,111 INFO L422 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] [2020-11-06 22:27:19,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:27:19,327 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:19,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:19,328 INFO L82 PathProgramCache]: Analyzing trace with hash 934657394, now seen corresponding path program 1 times [2020-11-06 22:27:19,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:19,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418924511] [2020-11-06 22:27:19,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:19,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:19,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418924511] [2020-11-06 22:27:19,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623628698] [2020-11-06 22:27:19,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-11-06 22:27:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:19,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 30 conjunts are in the unsatisfiable core [2020-11-06 22:27:19,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:27:19,628 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-06 22:27:19,628 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:19,640 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:19,640 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:19,640 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-06 22:27:19,698 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:19,698 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-06 22:27:19,699 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:19,713 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:19,718 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:27:19,719 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:19,730 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:19,731 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:19,731 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2020-11-06 22:27:19,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:27:19,765 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-06 22:27:19,766 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:19,773 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:19,774 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:19,774 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2020-11-06 22:27:19,808 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-06 22:27:19,809 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:19,821 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:19,824 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-06 22:27:19,824 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2020-11-06 22:27:19,878 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-11-06 22:27:19,880 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:19,884 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:19,886 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:19,886 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2020-11-06 22:27:19,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:19,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:27:19,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-11-06 22:27:19,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016363687] [2020-11-06 22:27:19,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-06 22:27:19,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:19,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-06 22:27:19,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:27:19,893 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 14 states. [2020-11-06 22:27:20,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:20,269 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2020-11-06 22:27:20,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-06 22:27:20,270 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2020-11-06 22:27:20,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:20,271 INFO L225 Difference]: With dead ends: 66 [2020-11-06 22:27:20,271 INFO L226 Difference]: Without dead ends: 60 [2020-11-06 22:27:20,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2020-11-06 22:27:20,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-11-06 22:27:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2020-11-06 22:27:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-11-06 22:27:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2020-11-06 22:27:20,285 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 26 [2020-11-06 22:27:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:20,289 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2020-11-06 22:27:20,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-06 22:27:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2020-11-06 22:27:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-06 22:27:20,291 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:20,291 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:27:20,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:27:20,507 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:20,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:20,508 INFO L82 PathProgramCache]: Analyzing trace with hash 965245677, now seen corresponding path program 1 times [2020-11-06 22:27:20,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:20,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176906085] [2020-11-06 22:27:20,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:20,831 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2020-11-06 22:27:20,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:20,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176906085] [2020-11-06 22:27:20,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982970171] [2020-11-06 22:27:20,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:27:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:21,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 37 conjunts are in the unsatisfiable core [2020-11-06 22:27:21,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:27:21,060 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-06 22:27:21,060 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:21,065 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:21,065 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:21,065 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-06 22:27:21,087 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:21,088 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-06 22:27:21,089 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:21,111 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:21,111 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:21,111 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-11-06 22:27:21,128 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:27:21,129 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:21,144 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:21,152 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:27:21,152 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:21,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:21,174 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:21,174 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-11-06 22:27:21,189 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_23|], 2=[|v_#memory_$Pointer$.base_18|, |v_#memory_$Pointer$.offset_16|]} [2020-11-06 22:27:21,196 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2020-11-06 22:27:21,196 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:21,211 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:21,234 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:21,235 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2020-11-06 22:27:21,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-11-06 22:27:21,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:27:21,240 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:21,266 INFO L625 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2020-11-06 22:27:21,270 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2020-11-06 22:27:21,271 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:21,279 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:21,279 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:21,279 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-11-06 22:27:21,314 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2020-11-06 22:27:21,314 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:21,321 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:21,325 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-11-06 22:27:21,325 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:21,331 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:21,332 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:21,332 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-11-06 22:27:21,338 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-06 22:27:21,339 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:21,341 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:21,341 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:21,342 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-11-06 22:27:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:21,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:27:21,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-11-06 22:27:21,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201860708] [2020-11-06 22:27:21,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:27:21,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:21,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:27:21,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:27:21,349 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 11 states. [2020-11-06 22:27:21,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:21,736 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2020-11-06 22:27:21,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:27:21,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-11-06 22:27:21,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:21,737 INFO L225 Difference]: With dead ends: 70 [2020-11-06 22:27:21,737 INFO L226 Difference]: Without dead ends: 64 [2020-11-06 22:27:21,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-11-06 22:27:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-06 22:27:21,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2020-11-06 22:27:21,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-06 22:27:21,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2020-11-06 22:27:21,746 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 28 [2020-11-06 22:27:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:21,746 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2020-11-06 22:27:21,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:27:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2020-11-06 22:27:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-06 22:27:21,747 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:21,747 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-06 22:27:21,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:27:21,964 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:21,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:21,965 INFO L82 PathProgramCache]: Analyzing trace with hash -596532632, now seen corresponding path program 1 times [2020-11-06 22:27:21,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:21,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769839097] [2020-11-06 22:27:21,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:22,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:22,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:22,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769839097] [2020-11-06 22:27:22,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40881588] [2020-11-06 22:27:22,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:27:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:22,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 36 conjunts are in the unsatisfiable core [2020-11-06 22:27:22,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:27:22,351 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-06 22:27:22,352 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:22,356 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:22,356 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:22,356 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-06 22:27:22,370 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:22,371 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-06 22:27:22,371 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:22,378 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:22,378 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:22,379 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-11-06 22:27:22,395 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:27:22,395 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:22,407 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:22,412 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:27:22,413 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:22,425 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:22,427 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:22,427 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-11-06 22:27:22,444 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_24|], 2=[|v_#memory_$Pointer$.base_20|, |v_#memory_$Pointer$.offset_18|]} [2020-11-06 22:27:22,448 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2020-11-06 22:27:22,449 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:22,461 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:22,479 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:22,479 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2020-11-06 22:27:22,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-11-06 22:27:22,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:27:22,483 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:22,502 INFO L625 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2020-11-06 22:27:22,506 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2020-11-06 22:27:22,507 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:22,513 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:22,514 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:22,514 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-11-06 22:27:22,567 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2020-11-06 22:27:22,567 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:22,573 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:22,576 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-11-06 22:27:22,576 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:22,585 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:22,586 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:22,586 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-11-06 22:27:22,593 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-06 22:27:22,594 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:22,595 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:22,595 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:22,596 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-11-06 22:27:22,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:22,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:27:22,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2020-11-06 22:27:22,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140892824] [2020-11-06 22:27:22,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:27:22,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:22,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:27:22,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:27:22,618 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 12 states. [2020-11-06 22:27:23,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:23,057 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2020-11-06 22:27:23,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:27:23,058 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2020-11-06 22:27:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:23,060 INFO L225 Difference]: With dead ends: 72 [2020-11-06 22:27:23,060 INFO L226 Difference]: Without dead ends: 60 [2020-11-06 22:27:23,061 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2020-11-06 22:27:23,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-11-06 22:27:23,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2020-11-06 22:27:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-11-06 22:27:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2020-11-06 22:27:23,067 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 30 [2020-11-06 22:27:23,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:23,068 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2020-11-06 22:27:23,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:27:23,068 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2020-11-06 22:27:23,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-06 22:27:23,069 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:23,069 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-11-06 22:27:23,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:27:23,282 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:23,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:23,283 INFO L82 PathProgramCache]: Analyzing trace with hash 595516520, now seen corresponding path program 2 times [2020-11-06 22:27:23,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:23,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860203490] [2020-11-06 22:27:23,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:23,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:23,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860203490] [2020-11-06 22:27:23,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317026714] [2020-11-06 22:27:23,479 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:27:23,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-06 22:27:23,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:27:23,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 36 conjunts are in the unsatisfiable core [2020-11-06 22:27:23,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:27:23,646 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-06 22:27:23,646 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:23,650 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:23,651 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:23,651 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-06 22:27:23,671 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:23,672 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-06 22:27:23,673 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:23,680 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:23,680 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:23,681 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-11-06 22:27:23,694 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:27:23,694 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:23,707 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:23,714 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:27:23,714 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:23,731 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:23,733 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:23,733 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-11-06 22:27:23,748 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_25|], 2=[|v_#memory_$Pointer$.base_22|, |v_#memory_$Pointer$.offset_20|]} [2020-11-06 22:27:23,752 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2020-11-06 22:27:23,753 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:23,767 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:23,790 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:23,790 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2020-11-06 22:27:23,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-11-06 22:27:23,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:27:23,794 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:23,826 INFO L625 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2020-11-06 22:27:23,830 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2020-11-06 22:27:23,831 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:23,840 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:23,840 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:23,840 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-11-06 22:27:23,876 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2020-11-06 22:27:23,877 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:23,884 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:23,886 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-11-06 22:27:23,887 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:23,891 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:23,893 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:23,893 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-11-06 22:27:23,900 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-06 22:27:23,901 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:23,908 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:23,909 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:23,909 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-11-06 22:27:23,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:23,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:27:23,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2020-11-06 22:27:23,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336152344] [2020-11-06 22:27:23,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:27:23,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:23,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:27:23,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:27:23,930 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 12 states. [2020-11-06 22:27:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:24,299 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2020-11-06 22:27:24,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:27:24,299 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2020-11-06 22:27:24,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:24,300 INFO L225 Difference]: With dead ends: 65 [2020-11-06 22:27:24,300 INFO L226 Difference]: Without dead ends: 50 [2020-11-06 22:27:24,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2020-11-06 22:27:24,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-06 22:27:24,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 39. [2020-11-06 22:27:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-06 22:27:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2020-11-06 22:27:24,311 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 30 [2020-11-06 22:27:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:24,312 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2020-11-06 22:27:24,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:27:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-11-06 22:27:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-06 22:27:24,315 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:24,315 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:27:24,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:27:24,530 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:24,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:24,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1043096551, now seen corresponding path program 2 times [2020-11-06 22:27:24,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:24,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852954777] [2020-11-06 22:27:24,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:24,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:24,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852954777] [2020-11-06 22:27:24,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197777354] [2020-11-06 22:27:24,780 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:27:24,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-06 22:27:24,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:27:24,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 40 conjunts are in the unsatisfiable core [2020-11-06 22:27:24,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:27:24,950 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-06 22:27:24,951 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:24,955 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:24,956 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:24,956 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-06 22:27:24,988 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:24,989 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-11-06 22:27:24,990 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:25,027 INFO L625 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-11-06 22:27:25,034 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:27:25,034 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:25,049 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:25,050 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:25,050 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2020-11-06 22:27:25,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:27:25,093 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-06 22:27:25,094 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:25,105 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:25,106 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:25,106 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2020-11-06 22:27:25,155 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:25,155 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-11-06 22:27:25,156 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:25,169 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:25,174 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-06 22:27:25,174 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:25,186 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:25,186 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:25,186 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2020-11-06 22:27:25,263 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-11-06 22:27:25,263 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-11-06 22:27:25,264 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:25,285 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:25,288 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-06 22:27:25,288 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2020-11-06 22:27:25,357 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-11-06 22:27:25,358 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:25,374 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:25,379 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-06 22:27:25,379 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-11-06 22:27:25,440 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-11-06 22:27:25,442 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:25,450 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:25,451 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:25,451 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2020-11-06 22:27:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:25,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:27:25,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2020-11-06 22:27:25,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545163400] [2020-11-06 22:27:25,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-06 22:27:25,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:25,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-06 22:27:25,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:27:25,477 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 19 states. [2020-11-06 22:27:28,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:28,266 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2020-11-06 22:27:28,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-06 22:27:28,267 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2020-11-06 22:27:28,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:28,268 INFO L225 Difference]: With dead ends: 76 [2020-11-06 22:27:28,268 INFO L226 Difference]: Without dead ends: 66 [2020-11-06 22:27:28,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2020-11-06 22:27:28,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-06 22:27:28,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2020-11-06 22:27:28,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-06 22:27:28,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2020-11-06 22:27:28,278 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 30 [2020-11-06 22:27:28,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:28,279 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2020-11-06 22:27:28,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-06 22:27:28,279 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2020-11-06 22:27:28,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-06 22:27:28,280 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:28,281 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:27:28,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:27:28,484 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:28,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:28,485 INFO L82 PathProgramCache]: Analyzing trace with hash -792329511, now seen corresponding path program 1 times [2020-11-06 22:27:28,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:28,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321663325] [2020-11-06 22:27:28,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:28,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:28,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321663325] [2020-11-06 22:27:28,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528687529] [2020-11-06 22:27:28,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:27:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:28,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 40 conjunts are in the unsatisfiable core [2020-11-06 22:27:28,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:27:28,841 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-06 22:27:28,842 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:28,846 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:28,846 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:28,846 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-06 22:27:28,881 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:28,881 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-11-06 22:27:28,882 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:28,923 INFO L625 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-11-06 22:27:28,928 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:27:28,928 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:28,944 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:28,945 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:28,945 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2020-11-06 22:27:28,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:27:28,986 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-06 22:27:28,986 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:28,996 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:28,997 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:28,997 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2020-11-06 22:27:29,050 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:29,050 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-11-06 22:27:29,051 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:29,068 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:29,074 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-06 22:27:29,075 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:29,087 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:29,088 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:29,088 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2020-11-06 22:27:29,147 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-11-06 22:27:29,148 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-11-06 22:27:29,149 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:29,160 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:29,162 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-06 22:27:29,162 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2020-11-06 22:27:29,237 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-11-06 22:27:29,238 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:29,252 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:29,256 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-06 22:27:29,256 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-11-06 22:27:29,345 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-11-06 22:27:29,350 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:29,358 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:29,360 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:29,360 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2020-11-06 22:27:29,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:29,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:27:29,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2020-11-06 22:27:29,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554653806] [2020-11-06 22:27:29,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-06 22:27:29,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:29,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-06 22:27:29,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:27:29,388 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 19 states. [2020-11-06 22:27:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:30,245 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2020-11-06 22:27:30,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-06 22:27:30,246 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2020-11-06 22:27:30,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:30,247 INFO L225 Difference]: With dead ends: 96 [2020-11-06 22:27:30,247 INFO L226 Difference]: Without dead ends: 88 [2020-11-06 22:27:30,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2020-11-06 22:27:30,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-11-06 22:27:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2020-11-06 22:27:30,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-06 22:27:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2020-11-06 22:27:30,255 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 30 [2020-11-06 22:27:30,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:30,255 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2020-11-06 22:27:30,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-06 22:27:30,255 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2020-11-06 22:27:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-06 22:27:30,256 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:30,256 INFO L422 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] [2020-11-06 22:27:30,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:27:30,470 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:30,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:30,472 INFO L82 PathProgramCache]: Analyzing trace with hash -981048684, now seen corresponding path program 3 times [2020-11-06 22:27:30,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:30,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899893419] [2020-11-06 22:27:30,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:30,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:30,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:30,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899893419] [2020-11-06 22:27:30,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604898144] [2020-11-06 22:27:30,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:27:31,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-06 22:27:31,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:27:31,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 50 conjunts are in the unsatisfiable core [2020-11-06 22:27:31,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:27:31,022 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-06 22:27:31,022 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:31,027 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:31,027 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:31,027 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-06 22:27:31,055 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:31,055 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-11-06 22:27:31,056 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:31,088 INFO L625 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2020-11-06 22:27:31,089 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:31,089 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-11-06 22:27:31,139 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:27:31,139 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:31,157 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:31,167 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:27:31,167 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:31,183 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:31,185 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:31,185 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2020-11-06 22:27:31,245 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:31,245 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2020-11-06 22:27:31,246 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:31,269 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:31,270 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_36|], 2=[|v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.base_28|]} [2020-11-06 22:27:31,276 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:27:31,276 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:31,300 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:31,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:27:31,307 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-11-06 22:27:31,307 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:31,327 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:31,361 INFO L348 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2020-11-06 22:27:31,362 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2020-11-06 22:27:31,363 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:31,392 INFO L625 ElimStorePlain]: treesize reduction 8, result has 82.2 percent of original size [2020-11-06 22:27:31,393 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:31,393 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:37 [2020-11-06 22:27:31,460 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 100 [2020-11-06 22:27:31,461 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:31,487 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:31,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:27:31,494 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2020-11-06 22:27:31,494 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:31,514 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:31,541 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:31,541 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 105 [2020-11-06 22:27:31,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-11-06 22:27:31,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-06 22:27:31,544 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:31,585 INFO L625 ElimStorePlain]: treesize reduction 26, result has 77.6 percent of original size [2020-11-06 22:27:31,587 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:31,587 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:145, output treesize:84 [2020-11-06 22:27:31,636 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_24|, |v_#memory_int_38|], 6=[|v_#memory_$Pointer$.base_30|]} [2020-11-06 22:27:31,659 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:31,660 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 199 [2020-11-06 22:27:31,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-06 22:27:31,664 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:31,711 INFO L625 ElimStorePlain]: treesize reduction 48, result has 77.3 percent of original size [2020-11-06 22:27:31,725 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40 [2020-11-06 22:27:31,725 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:31,743 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:31,798 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:31,799 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 160 [2020-11-06 22:27:31,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-06 22:27:31,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:27:31,804 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:27:31,805 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-06 22:27:31,807 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-06 22:27:31,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-06 22:27:31,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:27:31,811 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:27:31,812 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-06 22:27:31,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-06 22:27:31,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:27:31,817 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:27:31,818 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-06 22:27:31,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-06 22:27:31,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:27:31,822 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:27:31,823 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-06 22:27:31,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-06 22:27:31,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:27:31,846 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:27:31,846 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-06 22:27:31,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-06 22:27:31,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:27:31,850 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:27:31,851 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-06 22:27:31,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-06 22:27:31,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:27:31,857 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:27:31,858 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-06 22:27:31,860 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-06 22:27:31,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-06 22:27:31,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:27:31,864 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:27:31,865 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-06 22:27:31,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-06 22:27:31,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:27:31,871 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:27:31,872 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-06 22:27:31,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-06 22:27:31,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:27:31,876 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:27:31,877 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-06 22:27:31,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-06 22:27:31,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:27:31,883 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:27:31,884 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-06 22:27:31,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-06 22:27:31,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:27:31,887 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:27:31,888 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-06 22:27:31,890 INFO L547 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-06 22:27:31,956 INFO L625 ElimStorePlain]: treesize reduction 92, result has 37.0 percent of original size [2020-11-06 22:27:31,958 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-06 22:27:31,958 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:220, output treesize:88 [2020-11-06 22:27:32,021 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2020-11-06 22:27:32,024 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2020-11-06 22:27:32,025 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:32,038 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:32,046 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:32,046 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 47 [2020-11-06 22:27:32,048 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-06 22:27:32,050 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-06 22:27:32,050 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-06 22:27:32,073 INFO L625 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2020-11-06 22:27:32,074 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-06 22:27:32,075 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:99, output treesize:19 [2020-11-06 22:27:32,125 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-11-06 22:27:32,126 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:27:32,140 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:27:32,142 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:27:32,142 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-11-06 22:27:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:32,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:27:32,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2020-11-06 22:27:32,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514366304] [2020-11-06 22:27:32,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-06 22:27:32,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:32,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-06 22:27:32,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:27:32,152 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 19 states. [2020-11-06 22:27:32,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:32,911 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2020-11-06 22:27:32,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-06 22:27:32,912 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2020-11-06 22:27:32,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:32,913 INFO L225 Difference]: With dead ends: 92 [2020-11-06 22:27:32,913 INFO L226 Difference]: Without dead ends: 84 [2020-11-06 22:27:32,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2020-11-06 22:27:32,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-06 22:27:32,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2020-11-06 22:27:32,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-06 22:27:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2020-11-06 22:27:32,921 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 32 [2020-11-06 22:27:32,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:32,922 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2020-11-06 22:27:32,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-06 22:27:32,922 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2020-11-06 22:27:32,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-06 22:27:32,923 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:32,923 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-06 22:27:33,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-11-06 22:27:33,138 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:33,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:33,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1704140972, now seen corresponding path program 1 times [2020-11-06 22:27:33,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:33,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127020209] [2020-11-06 22:27:33,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:27:33,172 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:27:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:27:33,190 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:27:33,234 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-06 22:27:33,234 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-06 22:27:33,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-06 22:27:33,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:27:33 BoogieIcfgContainer [2020-11-06 22:27:33,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:27:33,276 INFO L168 Benchmark]: Toolchain (without parser) took 18009.63 ms. Allocated memory was 125.8 MB in the beginning and 226.5 MB in the end (delta: 100.7 MB). Free memory was 99.4 MB in the beginning and 184.7 MB in the end (delta: -85.3 MB). Peak memory consumption was 16.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:27:33,277 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 125.8 MB. Free memory is still 85.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:27:33,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 553.70 ms. Allocated memory is still 125.8 MB. Free memory was 98.8 MB in the beginning and 77.0 MB in the end (delta: 21.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:27:33,277 INFO L168 Benchmark]: Boogie Preprocessor took 68.18 ms. Allocated memory is still 125.8 MB. Free memory was 77.0 MB in the beginning and 74.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:27:33,278 INFO L168 Benchmark]: RCFGBuilder took 668.81 ms. Allocated memory was 125.8 MB in the beginning and 157.3 MB in the end (delta: 31.5 MB). Free memory was 74.4 MB in the beginning and 98.4 MB in the end (delta: -24.0 MB). Peak memory consumption was 8.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:27:33,278 INFO L168 Benchmark]: TraceAbstraction took 16709.26 ms. Allocated memory was 157.3 MB in the beginning and 226.5 MB in the end (delta: 69.2 MB). Free memory was 98.3 MB in the beginning and 184.7 MB in the end (delta: -86.4 MB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:27:33,280 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.17 ms. Allocated memory is still 125.8 MB. Free memory is still 85.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 553.70 ms. Allocated memory is still 125.8 MB. Free memory was 98.8 MB in the beginning and 77.0 MB in the end (delta: 21.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 68.18 ms. Allocated memory is still 125.8 MB. Free memory was 77.0 MB in the beginning and 74.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 668.81 ms. Allocated memory was 125.8 MB in the beginning and 157.3 MB in the end (delta: 31.5 MB). Free memory was 74.4 MB in the beginning and 98.4 MB in the end (delta: -24.0 MB). Peak memory consumption was 8.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 16709.26 ms. Allocated memory was 157.3 MB in the beginning and 226.5 MB in the end (delta: 69.2 MB). Free memory was 98.3 MB in the beginning and 184.7 MB in the end (delta: -86.4 MB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L533] COND FALSE !(a == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L534] List t; [L535] List p = a; VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L536] COND TRUE __VERIFIER_nondet_int() [L537] p->h = 1 [L538] t = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L539] COND FALSE !(t == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L540] p->n = t [L541] EXPR p->n [L541] p = p->n [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND TRUE __VERIFIER_nondet_int() [L544] p->h = 2 [L545] t = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-3:0}] [L546] COND FALSE !(t == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-3:0}] [L547] p->n = t [L548] EXPR p->n [L548] p = p->n [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 [L551] p = a VAL [a={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-3:0}] [L552] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=1, t={-3:0}] [L552] COND FALSE !(p->h == 2) [L554] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=1, t={-3:0}] [L554] COND TRUE p->h == 1 [L555] EXPR p->n [L555] p = p->n [L554] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, p->h=2, t={-3:0}] [L554] COND FALSE !(p->h == 1) [L556] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, p->h=2, t={-3:0}] [L556] COND TRUE p->h != 3 [L557] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "list-2.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.6s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 274 SDtfs, 588 SDslu, 1349 SDs, 0 SdLazy, 2504 SolverSat, 272 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 409 GetRequests, 218 SyntacticMatches, 9 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 139 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 584 NumberOfCodeBlocks, 584 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 532 ConstructedInterpolants, 17 QuantifiedInterpolants, 155198 SizeOfPredicates, 113 NumberOfNonLiveVariables, 1238 ConjunctsInSsa, 299 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 16/92 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...