/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-ext2-properties/list_and_tree_cnstr-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 18:28:36,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 18:28:36,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 18:28:36,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 18:28:36,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 18:28:36,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 18:28:36,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 18:28:36,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 18:28:36,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 18:28:36,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 18:28:36,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 18:28:36,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 18:28:36,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 18:28:36,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 18:28:36,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 18:28:36,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 18:28:36,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 18:28:36,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 18:28:36,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 18:28:36,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 18:28:36,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 18:28:36,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 18:28:36,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 18:28:36,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 18:28:36,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 18:28:36,387 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 18:28:36,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 18:28:36,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 18:28:36,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 18:28:36,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 18:28:36,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 18:28:36,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 18:28:36,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 18:28:36,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 18:28:36,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 18:28:36,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 18:28:36,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 18:28:36,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 18:28:36,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 18:28:36,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 18:28:36,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 18:28:36,417 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-10-23 18:28:36,450 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 18:28:36,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 18:28:36,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-23 18:28:36,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-23 18:28:36,455 INFO L138 SettingsManager]: * Use SBE=true [2020-10-23 18:28:36,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 18:28:36,457 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 18:28:36,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 18:28:36,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 18:28:36,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 18:28:36,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 18:28:36,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 18:28:36,459 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 18:28:36,459 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 18:28:36,459 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 18:28:36,460 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 18:28:36,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 18:28:36,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 18:28:36,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-23 18:28:36,460 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 18:28:36,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 18:28:36,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 18:28:36,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 18:28:36,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-23 18:28:36,462 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-23 18:28:36,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-23 18:28:36,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-23 18:28:36,463 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 18:28:36,463 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-23 18:28:36,463 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-10-23 18:28:36,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 18:28:36,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 18:28:36,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 18:28:36,937 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 18:28:36,938 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 18:28:36,939 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2020-10-23 18:28:37,026 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbe929754/84e36563c4344caf8101fdee8cd0bab8/FLAG9c0127437 [2020-10-23 18:28:37,710 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 18:28:37,713 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2020-10-23 18:28:37,734 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbe929754/84e36563c4344caf8101fdee8cd0bab8/FLAG9c0127437 [2020-10-23 18:28:37,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbe929754/84e36563c4344caf8101fdee8cd0bab8 [2020-10-23 18:28:37,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 18:28:37,985 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 18:28:37,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 18:28:37,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 18:28:37,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 18:28:37,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:28:37" (1/1) ... [2020-10-23 18:28:37,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404e0429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:28:37, skipping insertion in model container [2020-10-23 18:28:37,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:28:37" (1/1) ... [2020-10-23 18:28:38,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 18:28:38,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 18:28:38,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:28:38,451 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 18:28:38,506 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:28:38,604 INFO L208 MainTranslator]: Completed translation [2020-10-23 18:28:38,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:28:38 WrapperNode [2020-10-23 18:28:38,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 18:28:38,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 18:28:38,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 18:28:38,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 18:28:38,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:28:38" (1/1) ... [2020-10-23 18:28:38,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:28:38" (1/1) ... [2020-10-23 18:28:38,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:28:38" (1/1) ... [2020-10-23 18:28:38,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:28:38" (1/1) ... [2020-10-23 18:28:38,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:28:38" (1/1) ... [2020-10-23 18:28:38,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:28:38" (1/1) ... [2020-10-23 18:28:38,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:28:38" (1/1) ... [2020-10-23 18:28:38,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 18:28:38,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 18:28:38,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 18:28:38,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 18:28:38,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:28:38" (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-10-23 18:28:38,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 18:28:38,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 18:28:38,858 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 18:28:38,859 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-10-23 18:28:38,859 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-10-23 18:28:38,860 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-10-23 18:28:38,860 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 18:28:38,860 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 18:28:38,860 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 18:28:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-10-23 18:28:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-10-23 18:28:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 18:28:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 18:28:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 18:28:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-10-23 18:28:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-10-23 18:28:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-10-23 18:28:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-10-23 18:28:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-10-23 18:28:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-10-23 18:28:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-10-23 18:28:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-10-23 18:28:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-10-23 18:28:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-10-23 18:28:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-10-23 18:28:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-10-23 18:28:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-10-23 18:28:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-10-23 18:28:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-10-23 18:28:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-10-23 18:28:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-10-23 18:28:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-10-23 18:28:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-10-23 18:28:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-10-23 18:28:38,869 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-10-23 18:28:38,869 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-10-23 18:28:38,869 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-10-23 18:28:38,869 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-10-23 18:28:38,869 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-10-23 18:28:38,869 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-10-23 18:28:38,869 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-10-23 18:28:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-10-23 18:28:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-10-23 18:28:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-10-23 18:28:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-10-23 18:28:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-10-23 18:28:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-10-23 18:28:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-10-23 18:28:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-10-23 18:28:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-10-23 18:28:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-10-23 18:28:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-10-23 18:28:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-10-23 18:28:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-10-23 18:28:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-10-23 18:28:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-10-23 18:28:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-10-23 18:28:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-10-23 18:28:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-10-23 18:28:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-10-23 18:28:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-10-23 18:28:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-10-23 18:28:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-10-23 18:28:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-10-23 18:28:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-10-23 18:28:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-10-23 18:28:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-10-23 18:28:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-23 18:28:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-10-23 18:28:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-23 18:28:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-10-23 18:28:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-10-23 18:28:38,876 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-10-23 18:28:38,876 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-10-23 18:28:38,877 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-10-23 18:28:38,877 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-10-23 18:28:38,877 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-10-23 18:28:38,877 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-10-23 18:28:38,877 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-23 18:28:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-10-23 18:28:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-10-23 18:28:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-10-23 18:28:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-10-23 18:28:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-10-23 18:28:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-10-23 18:28:38,880 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-10-23 18:28:38,880 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-10-23 18:28:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-10-23 18:28:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-10-23 18:28:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-10-23 18:28:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-10-23 18:28:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-10-23 18:28:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-10-23 18:28:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-10-23 18:28:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-10-23 18:28:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-10-23 18:28:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-10-23 18:28:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-10-23 18:28:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-10-23 18:28:38,883 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-10-23 18:28:38,883 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-10-23 18:28:38,883 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-10-23 18:28:38,883 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-10-23 18:28:38,883 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-10-23 18:28:38,883 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-10-23 18:28:38,883 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-10-23 18:28:38,883 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-10-23 18:28:38,884 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-10-23 18:28:38,884 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-10-23 18:28:38,884 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-10-23 18:28:38,884 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-10-23 18:28:38,884 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-10-23 18:28:38,884 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-10-23 18:28:38,884 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-10-23 18:28:38,884 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-10-23 18:28:38,885 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-10-23 18:28:38,885 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-10-23 18:28:38,886 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-10-23 18:28:38,886 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-10-23 18:28:38,886 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 18:28:38,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-23 18:28:38,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-23 18:28:38,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-23 18:28:38,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 18:28:38,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 18:28:38,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 18:28:38,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 18:28:38,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 18:28:38,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 18:28:39,538 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-10-23 18:28:39,852 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 18:28:39,852 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-23 18:28:39,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:28:39 BoogieIcfgContainer [2020-10-23 18:28:39,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 18:28:39,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 18:28:39,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 18:28:39,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 18:28:39,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:28:37" (1/3) ... [2020-10-23 18:28:39,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb49c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:28:39, skipping insertion in model container [2020-10-23 18:28:39,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:28:38" (2/3) ... [2020-10-23 18:28:39,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb49c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:28:39, skipping insertion in model container [2020-10-23 18:28:39,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:28:39" (3/3) ... [2020-10-23 18:28:39,864 INFO L111 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2020-10-23 18:28:39,876 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-23 18:28:39,882 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 18:28:39,896 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 18:28:39,922 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 18:28:39,923 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 18:28:39,923 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-23 18:28:39,923 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 18:28:39,923 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 18:28:39,923 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 18:28:39,923 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 18:28:39,923 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 18:28:39,941 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2020-10-23 18:28:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-23 18:28:39,949 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:28:39,950 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-10-23 18:28:39,950 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:28:39,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:28:39,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1723059971, now seen corresponding path program 1 times [2020-10-23 18:28:39,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:28:39,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798906174] [2020-10-23 18:28:39,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:28:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:40,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:28:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:28:40,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798906174] [2020-10-23 18:28:40,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:28:40,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-23 18:28:40,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949667354] [2020-10-23 18:28:40,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:28:40,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:28:40,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:28:40,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-23 18:28:40,282 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2020-10-23 18:28:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:28:40,561 INFO L93 Difference]: Finished difference Result 115 states and 176 transitions. [2020-10-23 18:28:40,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:28:40,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-10-23 18:28:40,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:28:40,571 INFO L225 Difference]: With dead ends: 115 [2020-10-23 18:28:40,572 INFO L226 Difference]: Without dead ends: 49 [2020-10-23 18:28:40,576 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-10-23 18:28:40,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-10-23 18:28:40,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-10-23 18:28:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-23 18:28:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2020-10-23 18:28:40,622 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 22 [2020-10-23 18:28:40,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:28:40,622 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2020-10-23 18:28:40,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:28:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2020-10-23 18:28:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-23 18:28:40,624 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:28:40,625 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, 1, 1, 1, 1, 1] [2020-10-23 18:28:40,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 18:28:40,625 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:28:40,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:28:40,626 INFO L82 PathProgramCache]: Analyzing trace with hash 80260039, now seen corresponding path program 1 times [2020-10-23 18:28:40,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:28:40,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437804487] [2020-10-23 18:28:40,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:28:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:40,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:28:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:28:40,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437804487] [2020-10-23 18:28:40,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:28:40,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 18:28:40,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451826510] [2020-10-23 18:28:40,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 18:28:40,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:28:40,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 18:28:40,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 18:28:40,779 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand 4 states. [2020-10-23 18:28:40,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:28:40,956 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2020-10-23 18:28:40,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 18:28:40,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-23 18:28:40,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:28:40,960 INFO L225 Difference]: With dead ends: 79 [2020-10-23 18:28:40,960 INFO L226 Difference]: Without dead ends: 57 [2020-10-23 18:28:40,961 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 18:28:40,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-23 18:28:40,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-23 18:28:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-23 18:28:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2020-10-23 18:28:40,973 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 27 [2020-10-23 18:28:40,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:28:40,973 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2020-10-23 18:28:40,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 18:28:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2020-10-23 18:28:40,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-23 18:28:40,975 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:28:40,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:28:40,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 18:28:40,975 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:28:40,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:28:40,976 INFO L82 PathProgramCache]: Analyzing trace with hash 510744340, now seen corresponding path program 1 times [2020-10-23 18:28:40,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:28:40,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886861935] [2020-10-23 18:28:40,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:28:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:41,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:28:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:41,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:28:41,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886861935] [2020-10-23 18:28:41,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:28:41,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 18:28:41,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224712508] [2020-10-23 18:28:41,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 18:28:41,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:28:41,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 18:28:41,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 18:28:41,068 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand 4 states. [2020-10-23 18:28:41,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:28:41,267 INFO L93 Difference]: Finished difference Result 97 states and 135 transitions. [2020-10-23 18:28:41,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 18:28:41,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-10-23 18:28:41,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:28:41,269 INFO L225 Difference]: With dead ends: 97 [2020-10-23 18:28:41,269 INFO L226 Difference]: Without dead ends: 59 [2020-10-23 18:28:41,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 18:28:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-23 18:28:41,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-23 18:28:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-23 18:28:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2020-10-23 18:28:41,278 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 33 [2020-10-23 18:28:41,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:28:41,279 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2020-10-23 18:28:41,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 18:28:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2020-10-23 18:28:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-23 18:28:41,281 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:28:41,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:28:41,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 18:28:41,281 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:28:41,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:28:41,282 INFO L82 PathProgramCache]: Analyzing trace with hash 729599058, now seen corresponding path program 1 times [2020-10-23 18:28:41,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:28:41,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466697735] [2020-10-23 18:28:41,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:28:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:41,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:28:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:41,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-23 18:28:41,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466697735] [2020-10-23 18:28:41,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:28:41,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 18:28:41,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306512280] [2020-10-23 18:28:41,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 18:28:41,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:28:41,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 18:28:41,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 18:28:41,422 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand 6 states. [2020-10-23 18:28:41,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:28:41,694 INFO L93 Difference]: Finished difference Result 85 states and 112 transitions. [2020-10-23 18:28:41,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 18:28:41,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-10-23 18:28:41,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:28:41,697 INFO L225 Difference]: With dead ends: 85 [2020-10-23 18:28:41,697 INFO L226 Difference]: Without dead ends: 79 [2020-10-23 18:28:41,698 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-10-23 18:28:41,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-23 18:28:41,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2020-10-23 18:28:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-23 18:28:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2020-10-23 18:28:41,709 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 93 transitions. Word has length 33 [2020-10-23 18:28:41,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:28:41,710 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 93 transitions. [2020-10-23 18:28:41,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 18:28:41,710 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2020-10-23 18:28:41,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-23 18:28:41,711 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:28:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:28:41,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 18:28:41,712 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:28:41,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:28:41,713 INFO L82 PathProgramCache]: Analyzing trace with hash 585622541, now seen corresponding path program 1 times [2020-10-23 18:28:41,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:28:41,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919113561] [2020-10-23 18:28:41,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:28:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:41,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:28:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:41,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-23 18:28:41,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919113561] [2020-10-23 18:28:41,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:28:41,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 18:28:41,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569757467] [2020-10-23 18:28:41,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 18:28:41,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:28:41,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 18:28:41,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 18:28:41,828 INFO L87 Difference]: Start difference. First operand 68 states and 93 transitions. Second operand 6 states. [2020-10-23 18:28:42,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:28:42,071 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2020-10-23 18:28:42,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 18:28:42,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-10-23 18:28:42,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:28:42,073 INFO L225 Difference]: With dead ends: 87 [2020-10-23 18:28:42,073 INFO L226 Difference]: Without dead ends: 77 [2020-10-23 18:28:42,074 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-10-23 18:28:42,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-23 18:28:42,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 66. [2020-10-23 18:28:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-23 18:28:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2020-10-23 18:28:42,082 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 90 transitions. Word has length 35 [2020-10-23 18:28:42,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:28:42,083 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 90 transitions. [2020-10-23 18:28:42,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 18:28:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2020-10-23 18:28:42,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-23 18:28:42,084 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:28:42,085 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:28:42,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 18:28:42,085 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:28:42,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:28:42,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1777671693, now seen corresponding path program 1 times [2020-10-23 18:28:42,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:28:42,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350409565] [2020-10-23 18:28:42,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:28:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:42,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:28:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-23 18:28:42,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350409565] [2020-10-23 18:28:42,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:28:42,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 18:28:42,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652835085] [2020-10-23 18:28:42,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 18:28:42,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:28:42,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 18:28:42,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 18:28:42,228 INFO L87 Difference]: Start difference. First operand 66 states and 90 transitions. Second operand 6 states. [2020-10-23 18:28:42,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:28:42,513 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2020-10-23 18:28:42,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 18:28:42,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-10-23 18:28:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:28:42,514 INFO L225 Difference]: With dead ends: 87 [2020-10-23 18:28:42,515 INFO L226 Difference]: Without dead ends: 74 [2020-10-23 18:28:42,516 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-10-23 18:28:42,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-23 18:28:42,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2020-10-23 18:28:42,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-23 18:28:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2020-10-23 18:28:42,523 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 35 [2020-10-23 18:28:42,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:28:42,524 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2020-10-23 18:28:42,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 18:28:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2020-10-23 18:28:42,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-23 18:28:42,526 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:28:42,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:28:42,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 18:28:42,527 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:28:42,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:28:42,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1980453703, now seen corresponding path program 1 times [2020-10-23 18:28:42,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:28:42,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462302248] [2020-10-23 18:28:42,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:28:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:42,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:28:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-23 18:28:42,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462302248] [2020-10-23 18:28:42,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993535698] [2020-10-23 18:28:42,743 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-10-23 18:28:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:42,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 28 conjunts are in the unsatisfiable core [2020-10-23 18:28:42,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:28:43,016 INFO L384 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-10-23 18:28:43,020 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:43,028 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:43,028 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:43,029 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-23 18:28:43,070 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:43,070 INFO L384 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-10-23 18:28:43,073 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:43,085 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:43,093 INFO L384 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-10-23 18:28:43,093 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:43,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:43,101 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:43,101 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2020-10-23 18:28:43,124 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-23 18:28:43,124 INFO L384 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 27 treesize of output 11 [2020-10-23 18:28:43,125 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:43,134 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:43,134 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:43,135 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2020-10-23 18:28:43,158 INFO L384 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-10-23 18:28:43,159 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:43,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:43,173 INFO L545 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-10-23 18:28:43,173 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-10-23 18:28:43,223 INFO L384 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-10-23 18:28:43,225 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:43,230 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:43,232 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:43,232 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-10-23 18:28:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-23 18:28:43,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:28:43,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-10-23 18:28:43,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438770872] [2020-10-23 18:28:43,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:28:43,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:28:43,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:28:43,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:28:43,240 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand 10 states. [2020-10-23 18:28:43,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:28:43,735 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2020-10-23 18:28:43,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 18:28:43,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-10-23 18:28:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:28:43,736 INFO L225 Difference]: With dead ends: 89 [2020-10-23 18:28:43,737 INFO L226 Difference]: Without dead ends: 81 [2020-10-23 18:28:43,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2020-10-23 18:28:43,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-23 18:28:43,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2020-10-23 18:28:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-23 18:28:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2020-10-23 18:28:43,745 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 37 [2020-10-23 18:28:43,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:28:43,746 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 94 transitions. [2020-10-23 18:28:43,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:28:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2020-10-23 18:28:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-23 18:28:43,747 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:28:43,747 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:28:43,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-10-23 18:28:43,961 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:28:43,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:28:43,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1180142727, now seen corresponding path program 1 times [2020-10-23 18:28:43,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:28:43,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214315262] [2020-10-23 18:28:43,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:28:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:44,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:28:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:44,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-23 18:28:44,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214315262] [2020-10-23 18:28:44,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935953781] [2020-10-23 18:28:44,196 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-10-23 18:28:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:44,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 28 conjunts are in the unsatisfiable core [2020-10-23 18:28:44,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:28:44,393 INFO L384 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-10-23 18:28:44,394 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:44,398 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:44,398 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:44,398 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-23 18:28:44,424 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:44,425 INFO L384 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-10-23 18:28:44,425 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:44,435 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:44,443 INFO L384 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-10-23 18:28:44,443 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:44,454 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:44,454 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:44,454 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2020-10-23 18:28:44,478 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-23 18:28:44,479 INFO L384 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 27 treesize of output 11 [2020-10-23 18:28:44,479 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:44,485 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:44,486 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:44,486 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2020-10-23 18:28:44,504 INFO L384 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-10-23 18:28:44,505 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:44,512 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:44,514 INFO L545 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-10-23 18:28:44,515 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-10-23 18:28:44,581 INFO L384 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-10-23 18:28:44,582 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:44,587 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:44,589 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:44,589 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-10-23 18:28:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-23 18:28:44,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:28:44,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-10-23 18:28:44,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496835721] [2020-10-23 18:28:44,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:28:44,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:28:44,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:28:44,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:28:44,596 INFO L87 Difference]: Start difference. First operand 70 states and 94 transitions. Second operand 10 states. [2020-10-23 18:28:45,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:28:45,041 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2020-10-23 18:28:45,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 18:28:45,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-10-23 18:28:45,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:28:45,043 INFO L225 Difference]: With dead ends: 98 [2020-10-23 18:28:45,043 INFO L226 Difference]: Without dead ends: 92 [2020-10-23 18:28:45,048 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2020-10-23 18:28:45,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-23 18:28:45,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2020-10-23 18:28:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-23 18:28:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 108 transitions. [2020-10-23 18:28:45,065 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 108 transitions. Word has length 37 [2020-10-23 18:28:45,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:28:45,069 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 108 transitions. [2020-10-23 18:28:45,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:28:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 108 transitions. [2020-10-23 18:28:45,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-23 18:28:45,070 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:28:45,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:28:45,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:28:45,271 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:28:45,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:28:45,273 INFO L82 PathProgramCache]: Analyzing trace with hash 167149748, now seen corresponding path program 1 times [2020-10-23 18:28:45,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:28:45,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780000204] [2020-10-23 18:28:45,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:28:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:45,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:28:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-23 18:28:45,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780000204] [2020-10-23 18:28:45,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709759705] [2020-10-23 18:28:45,584 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-10-23 18:28:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:45,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 38 conjunts are in the unsatisfiable core [2020-10-23 18:28:45,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:28:45,798 INFO L384 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-10-23 18:28:45,798 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:45,801 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:45,801 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:45,801 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-23 18:28:45,847 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:45,848 INFO L384 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-10-23 18:28:45,849 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:45,856 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:45,856 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:45,857 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-10-23 18:28:45,895 INFO L384 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 13 treesize of output 9 [2020-10-23 18:28:45,895 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:45,908 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:45,917 INFO L384 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 13 treesize of output 9 [2020-10-23 18:28:45,918 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:45,930 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:45,937 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:45,937 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2020-10-23 18:28:45,971 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_43|], 2=[|v_#memory_$Pointer$.offset_43|, |v_#memory_$Pointer$.base_45|]} [2020-10-23 18:28:45,977 INFO L384 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 29 treesize of output 19 [2020-10-23 18:28:45,978 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:45,993 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:45,998 INFO L384 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 110 treesize of output 82 [2020-10-23 18:28:45,999 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:46,008 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:46,033 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:46,034 INFO L384 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 75 treesize of output 105 [2020-10-23 18:28:46,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-10-23 18:28:46,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-23 18:28:46,039 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:46,053 INFO L625 ElimStorePlain]: treesize reduction 48, result has 38.5 percent of original size [2020-10-23 18:28:46,054 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:46,054 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2020-10-23 18:28:46,093 INFO L384 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 39 treesize of output 21 [2020-10-23 18:28:46,094 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:46,102 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:46,106 INFO L384 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 23 treesize of output 11 [2020-10-23 18:28:46,106 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:46,115 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:46,119 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:46,120 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2020-10-23 18:28:46,167 INFO L384 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-10-23 18:28:46,168 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:46,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:46,170 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:46,170 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-10-23 18:28:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-23 18:28:46,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:28:46,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-10-23 18:28:46,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924107909] [2020-10-23 18:28:46,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-23 18:28:46,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:28:46,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-23 18:28:46,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-10-23 18:28:46,177 INFO L87 Difference]: Start difference. First operand 81 states and 108 transitions. Second operand 16 states. [2020-10-23 18:28:46,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:28:46,837 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2020-10-23 18:28:46,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 18:28:46,837 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2020-10-23 18:28:46,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:28:46,839 INFO L225 Difference]: With dead ends: 108 [2020-10-23 18:28:46,839 INFO L226 Difference]: Without dead ends: 96 [2020-10-23 18:28:46,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2020-10-23 18:28:46,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-10-23 18:28:46,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2020-10-23 18:28:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-23 18:28:46,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2020-10-23 18:28:46,848 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 39 [2020-10-23 18:28:46,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:28:46,848 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2020-10-23 18:28:46,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-23 18:28:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2020-10-23 18:28:46,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-23 18:28:46,849 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:28:46,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:28:47,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:28:47,063 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:28:47,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:28:47,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1237714927, now seen corresponding path program 1 times [2020-10-23 18:28:47,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:28:47,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176519308] [2020-10-23 18:28:47,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:28:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:47,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:28:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:47,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-23 18:28:47,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176519308] [2020-10-23 18:28:47,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489557098] [2020-10-23 18:28:47,323 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-10-23 18:28:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:47,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 34 conjunts are in the unsatisfiable core [2020-10-23 18:28:47,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:28:47,506 INFO L384 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-10-23 18:28:47,507 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:47,509 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:47,509 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:47,509 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-23 18:28:47,561 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:47,561 INFO L384 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-10-23 18:28:47,562 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:47,570 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:47,570 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:47,570 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-10-23 18:28:47,603 INFO L384 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 13 treesize of output 9 [2020-10-23 18:28:47,603 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:47,616 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:47,624 INFO L384 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 13 treesize of output 9 [2020-10-23 18:28:47,624 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:47,637 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:47,639 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:47,639 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2020-10-23 18:28:47,673 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 2=[|v_#memory_$Pointer$.offset_45|, |v_#memory_$Pointer$.base_47|]} [2020-10-23 18:28:47,678 INFO L384 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 29 treesize of output 19 [2020-10-23 18:28:47,679 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:47,693 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:47,698 INFO L384 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 110 treesize of output 82 [2020-10-23 18:28:47,699 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:47,710 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:47,737 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:47,737 INFO L384 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 75 treesize of output 105 [2020-10-23 18:28:47,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-10-23 18:28:47,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-23 18:28:47,741 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:47,756 INFO L625 ElimStorePlain]: treesize reduction 48, result has 38.5 percent of original size [2020-10-23 18:28:47,756 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:47,757 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2020-10-23 18:28:47,792 INFO L384 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 39 treesize of output 21 [2020-10-23 18:28:47,793 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:47,802 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:47,805 INFO L384 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 23 treesize of output 11 [2020-10-23 18:28:47,806 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:47,812 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:47,814 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:47,814 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2020-10-23 18:28:47,820 INFO L384 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-10-23 18:28:47,820 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:47,823 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:47,823 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:47,839 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-10-23 18:28:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-23 18:28:47,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:28:47,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-10-23 18:28:47,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706185868] [2020-10-23 18:28:47,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-23 18:28:47,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:28:47,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-23 18:28:47,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-10-23 18:28:47,873 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. Second operand 16 states. [2020-10-23 18:28:48,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:28:48,522 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2020-10-23 18:28:48,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 18:28:48,523 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2020-10-23 18:28:48,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:28:48,525 INFO L225 Difference]: With dead ends: 104 [2020-10-23 18:28:48,525 INFO L226 Difference]: Without dead ends: 84 [2020-10-23 18:28:48,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2020-10-23 18:28:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-23 18:28:48,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 71. [2020-10-23 18:28:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-23 18:28:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2020-10-23 18:28:48,542 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 41 [2020-10-23 18:28:48,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:28:48,542 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2020-10-23 18:28:48,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-23 18:28:48,542 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2020-10-23 18:28:48,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-23 18:28:48,547 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:28:48,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:28:48,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:28:48,748 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:28:48,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:28:48,749 INFO L82 PathProgramCache]: Analyzing trace with hash 791151008, now seen corresponding path program 2 times [2020-10-23 18:28:48,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:28:48,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855013332] [2020-10-23 18:28:48,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:28:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:48,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:28:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-23 18:28:48,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855013332] [2020-10-23 18:28:48,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026872081] [2020-10-23 18:28:48,973 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-10-23 18:28:49,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-23 18:28:49,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-23 18:28:49,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 43 conjunts are in the unsatisfiable core [2020-10-23 18:28:49,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:28:49,188 INFO L384 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-10-23 18:28:49,189 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:49,196 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:49,197 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:49,197 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-23 18:28:49,238 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:49,239 INFO L384 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-10-23 18:28:49,240 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:49,283 INFO L625 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-10-23 18:28:49,295 INFO L384 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-10-23 18:28:49,296 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:49,312 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:49,313 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:49,313 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2020-10-23 18:28:49,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-23 18:28:49,372 INFO L384 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-10-23 18:28:49,373 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:49,388 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:49,389 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:49,389 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2020-10-23 18:28:49,450 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:49,452 INFO L384 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-10-23 18:28:49,452 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:49,468 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:49,474 INFO L384 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-10-23 18:28:49,475 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:49,489 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:49,490 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:49,490 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2020-10-23 18:28:49,548 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-23 18:28:49,549 INFO L384 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-10-23 18:28:49,550 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:49,564 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:49,567 INFO L545 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-10-23 18:28:49,567 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2020-10-23 18:28:49,649 INFO L384 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-10-23 18:28:49,650 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:49,665 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:49,670 INFO L545 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-10-23 18:28:49,671 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-10-23 18:28:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-23 18:28:49,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:28:49,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2020-10-23 18:28:49,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338086484] [2020-10-23 18:28:49,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-23 18:28:49,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:28:49,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-23 18:28:49,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2020-10-23 18:28:49,799 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand 19 states. [2020-10-23 18:28:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:28:50,821 INFO L93 Difference]: Finished difference Result 108 states and 139 transitions. [2020-10-23 18:28:50,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-23 18:28:50,823 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2020-10-23 18:28:50,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:28:50,824 INFO L225 Difference]: With dead ends: 108 [2020-10-23 18:28:50,824 INFO L226 Difference]: Without dead ends: 98 [2020-10-23 18:28:50,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2020-10-23 18:28:50,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-23 18:28:50,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2020-10-23 18:28:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-23 18:28:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions. [2020-10-23 18:28:50,837 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 116 transitions. Word has length 41 [2020-10-23 18:28:50,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:28:50,837 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 116 transitions. [2020-10-23 18:28:50,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-23 18:28:50,838 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 116 transitions. [2020-10-23 18:28:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-23 18:28:50,839 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:28:50,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:28:51,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-10-23 18:28:51,040 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:28:51,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:28:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1041918048, now seen corresponding path program 1 times [2020-10-23 18:28:51,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:28:51,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011466827] [2020-10-23 18:28:51,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:28:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:51,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:28:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-23 18:28:51,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011466827] [2020-10-23 18:28:51,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742371135] [2020-10-23 18:28:51,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-10-23 18:28:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:51,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 38 conjunts are in the unsatisfiable core [2020-10-23 18:28:51,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:28:51,465 INFO L384 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-10-23 18:28:51,466 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:51,468 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:51,468 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:51,468 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-23 18:28:51,537 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:51,539 INFO L384 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-10-23 18:28:51,539 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:51,592 INFO L625 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2020-10-23 18:28:51,597 INFO L384 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-10-23 18:28:51,597 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:51,612 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:51,612 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:51,613 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2020-10-23 18:28:51,668 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-23 18:28:51,669 INFO L384 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 27 treesize of output 11 [2020-10-23 18:28:51,669 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:51,678 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:51,679 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:51,679 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2020-10-23 18:28:51,733 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:51,733 INFO L384 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-10-23 18:28:51,734 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:51,747 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:51,752 INFO L384 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-10-23 18:28:51,752 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:51,764 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:51,764 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:51,764 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2020-10-23 18:28:51,834 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-23 18:28:51,834 INFO L384 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-10-23 18:28:51,836 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:51,851 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:51,854 INFO L545 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-10-23 18:28:51,854 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2020-10-23 18:28:51,918 INFO L384 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-10-23 18:28:51,919 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:51,936 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:51,940 INFO L545 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-10-23 18:28:51,941 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2020-10-23 18:28:52,024 INFO L384 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-10-23 18:28:52,026 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:52,034 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:52,035 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:52,036 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2020-10-23 18:28:52,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-23 18:28:52,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:28:52,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2020-10-23 18:28:52,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612814937] [2020-10-23 18:28:52,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-23 18:28:52,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:28:52,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-23 18:28:52,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2020-10-23 18:28:52,065 INFO L87 Difference]: Start difference. First operand 89 states and 116 transitions. Second operand 21 states. [2020-10-23 18:28:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:28:53,353 INFO L93 Difference]: Finished difference Result 128 states and 163 transitions. [2020-10-23 18:28:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-23 18:28:53,354 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2020-10-23 18:28:53,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:28:53,356 INFO L225 Difference]: With dead ends: 128 [2020-10-23 18:28:53,356 INFO L226 Difference]: Without dead ends: 120 [2020-10-23 18:28:53,357 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2020-10-23 18:28:53,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-10-23 18:28:53,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97. [2020-10-23 18:28:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-23 18:28:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2020-10-23 18:28:53,365 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 41 [2020-10-23 18:28:53,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:28:53,365 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2020-10-23 18:28:53,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-23 18:28:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2020-10-23 18:28:53,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-23 18:28:53,366 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:28:53,366 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:28:53,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:28:53,580 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:28:53,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:28:53,581 INFO L82 PathProgramCache]: Analyzing trace with hash 799553499, now seen corresponding path program 2 times [2020-10-23 18:28:53,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:28:53,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756967728] [2020-10-23 18:28:53,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:28:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:53,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:28:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:28:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-23 18:28:53,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756967728] [2020-10-23 18:28:53,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195829164] [2020-10-23 18:28:53,963 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 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-10-23 18:28:54,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-23 18:28:54,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-23 18:28:54,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 53 conjunts are in the unsatisfiable core [2020-10-23 18:28:54,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:28:54,159 INFO L384 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-10-23 18:28:54,160 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:54,164 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:54,165 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:54,165 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-23 18:28:54,207 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:54,207 INFO L384 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-10-23 18:28:54,209 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:54,259 INFO L625 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2020-10-23 18:28:54,259 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:54,260 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-10-23 18:28:54,313 INFO L384 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-10-23 18:28:54,314 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:54,333 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:54,339 INFO L384 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-10-23 18:28:54,339 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:54,359 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:54,361 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:54,361 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2020-10-23 18:28:54,430 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:54,430 INFO L384 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-10-23 18:28:54,431 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:54,456 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:54,457 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_55|], 2=[|v_#memory_$Pointer$.base_53|, |v_#memory_$Pointer$.offset_47|]} [2020-10-23 18:28:54,466 INFO L384 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-10-23 18:28:54,466 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:54,493 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:54,527 INFO L350 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2020-10-23 18:28:54,528 INFO L384 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-10-23 18:28:54,528 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:54,568 INFO L625 ElimStorePlain]: treesize reduction 8, result has 86.7 percent of original size [2020-10-23 18:28:54,573 INFO L384 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 23 treesize of output 11 [2020-10-23 18:28:54,573 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:54,588 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:54,588 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:54,589 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:37 [2020-10-23 18:28:54,673 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:54,674 INFO L384 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 138 treesize of output 136 [2020-10-23 18:28:54,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-10-23 18:28:54,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-10-23 18:28:54,678 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:54,745 INFO L625 ElimStorePlain]: treesize reduction 26, result has 84.0 percent of original size [2020-10-23 18:28:54,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-23 18:28:54,752 INFO L384 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-10-23 18:28:54,752 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:54,772 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:54,777 INFO L384 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 75 treesize of output 61 [2020-10-23 18:28:54,778 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:54,797 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:54,798 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-23 18:28:54,798 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:145, output treesize:84 [2020-10-23 18:28:54,857 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_int_57|, |v_#memory_$Pointer$.offset_49|], 6=[|v_#memory_$Pointer$.base_55|]} [2020-10-23 18:28:54,862 INFO L384 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-10-23 18:28:54,863 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:54,890 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:54,914 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:54,914 INFO L384 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 191 treesize of output 185 [2020-10-23 18:28:54,917 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-10-23 18:28:54,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:54,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-23 18:28:54,922 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2020-10-23 18:28:54,992 INFO L625 ElimStorePlain]: treesize reduction 299, result has 32.7 percent of original size [2020-10-23 18:28:55,055 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:55,056 INFO L384 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-10-23 18:28:55,060 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-10-23 18:28:55,062 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-10-23 18:28:55,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,071 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-23 18:28:55,073 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-10-23 18:28:55,074 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-10-23 18:28:55,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,085 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-10-23 18:28:55,086 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-10-23 18:28:55,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,097 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-10-23 18:28:55,098 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-10-23 18:28:55,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,108 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-10-23 18:28:55,108 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-10-23 18:28:55,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,118 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-10-23 18:28:55,119 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-10-23 18:28:55,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,129 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-10-23 18:28:55,130 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-10-23 18:28:55,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,138 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-23 18:28:55,140 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-10-23 18:28:55,141 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-10-23 18:28:55,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,151 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-10-23 18:28:55,152 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-10-23 18:28:55,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,160 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-10-23 18:28:55,161 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-10-23 18:28:55,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,170 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-10-23 18:28:55,171 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-10-23 18:28:55,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,180 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-10-23 18:28:55,181 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-10-23 18:28:55,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-23 18:28:55,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-23 18:28:55,189 INFO L545 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-23 18:28:55,273 INFO L625 ElimStorePlain]: treesize reduction 92, result has 37.0 percent of original size [2020-10-23 18:28:55,276 INFO L545 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-10-23 18:28:55,276 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:220, output treesize:88 [2020-10-23 18:28:55,354 INFO L441 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2020-10-23 18:28:55,360 INFO L384 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-10-23 18:28:55,361 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-23 18:28:55,378 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:55,388 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-23 18:28:55,388 INFO L384 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-10-23 18:28:55,391 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-23 18:28:55,393 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-23 18:28:55,394 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-23 18:28:55,422 INFO L625 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2020-10-23 18:28:55,425 INFO L545 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-10-23 18:28:55,426 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:99, output treesize:19 [2020-10-23 18:28:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-23 18:28:55,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:28:55,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2020-10-23 18:28:55,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278592678] [2020-10-23 18:28:55,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-23 18:28:55,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:28:55,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-23 18:28:55,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2020-10-23 18:28:55,556 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand 20 states. [2020-10-23 18:28:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:28:56,632 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2020-10-23 18:28:56,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 18:28:56,633 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2020-10-23 18:28:56,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:28:56,634 INFO L225 Difference]: With dead ends: 124 [2020-10-23 18:28:56,634 INFO L226 Difference]: Without dead ends: 116 [2020-10-23 18:28:56,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2020-10-23 18:28:56,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-10-23 18:28:56,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2020-10-23 18:28:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-23 18:28:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 132 transitions. [2020-10-23 18:28:56,643 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 132 transitions. Word has length 43 [2020-10-23 18:28:56,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:28:56,643 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 132 transitions. [2020-10-23 18:28:56,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-23 18:28:56,643 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 132 transitions. [2020-10-23 18:28:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-23 18:28:56,644 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:28:56,644 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:28:56,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:28:56,860 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:28:56,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:28:56,861 INFO L82 PathProgramCache]: Analyzing trace with hash 76461211, now seen corresponding path program 1 times [2020-10-23 18:28:56,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:28:56,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942444408] [2020-10-23 18:28:56,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:28:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 18:28:56,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 18:28:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 18:28:56,909 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 18:28:56,952 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-23 18:28:56,952 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-23 18:28:56,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-23 18:28:57,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:28:57 BoogieIcfgContainer [2020-10-23 18:28:57,028 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 18:28:57,034 INFO L168 Benchmark]: Toolchain (without parser) took 19049.06 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 125.4 MB in the beginning and 129.8 MB in the end (delta: -4.5 MB). Peak memory consumption was 159.8 MB. Max. memory is 8.0 GB. [2020-10-23 18:28:57,034 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 125.8 MB. Free memory was 100.5 MB in the beginning and 100.4 MB in the end (delta: 69.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 18:28:57,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.27 ms. Allocated memory is still 151.0 MB. Free memory was 124.8 MB in the beginning and 132.8 MB in the end (delta: -8.0 MB). Peak memory consumption was 25.7 MB. Max. memory is 8.0 GB. [2020-10-23 18:28:57,035 INFO L168 Benchmark]: Boogie Preprocessor took 149.28 ms. Allocated memory is still 151.0 MB. Free memory was 132.8 MB in the beginning and 129.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-10-23 18:28:57,035 INFO L168 Benchmark]: RCFGBuilder took 1098.14 ms. Allocated memory is still 151.0 MB. Free memory was 129.7 MB in the beginning and 118.5 MB in the end (delta: 11.2 MB). Peak memory consumption was 44.7 MB. Max. memory is 8.0 GB. [2020-10-23 18:28:57,035 INFO L168 Benchmark]: TraceAbstraction took 17172.36 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 118.0 MB in the beginning and 129.8 MB in the end (delta: -11.9 MB). Peak memory consumption was 151.2 MB. Max. memory is 8.0 GB. [2020-10-23 18:28:57,039 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.18 ms. Allocated memory is still 125.8 MB. Free memory was 100.5 MB in the beginning and 100.4 MB in the end (delta: 69.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 618.27 ms. Allocated memory is still 151.0 MB. Free memory was 124.8 MB in the beginning and 132.8 MB in the end (delta: -8.0 MB). Peak memory consumption was 25.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 149.28 ms. Allocated memory is still 151.0 MB. Free memory was 132.8 MB in the beginning and 129.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1098.14 ms. Allocated memory is still 151.0 MB. Free memory was 129.7 MB in the beginning and 118.5 MB in the end (delta: 11.2 MB). Peak memory consumption was 44.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 17172.36 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 118.0 MB in the beginning and 129.8 MB in the end (delta: -11.9 MB). Peak memory consumption was 151.2 MB. 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: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, root={-1:0}] [L555] COND FALSE !(__VERIFIER_nondet_int()) [L574] n = ((void *)0) [L575] struct TreeNode* pred; VAL [malloc(sizeof(*root))={-1:0}, n={0:0}, root={-1:0}] [L576] COND TRUE \read(*root) [L577] pred = ((void *)0) [L578] n = root VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={-1:0}] [L579] EXPR n->left [L579] n->left || n->right [L579] EXPR n->right [L579] n->left || n->right VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={-1:0}] [L579] COND FALSE !(n->left || n->right) [L586] COND FALSE !(\read(*pred)) [L592] root = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={0:0}] [L576] COND FALSE !(\read(*root)) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={0:0}] [L595] List a = (List) malloc(sizeof(struct node)); VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, pred={0:0}, root={0:0}] [L596] COND FALSE !(a == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, pred={0:0}, root={0:0}] [L597] List t; [L598] List p = a; VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}] [L599] COND TRUE __VERIFIER_nondet_int() [L600] p->h = 1 [L601] t = (List) malloc(sizeof(struct node)) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-3:0}] [L602] COND FALSE !(t == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-3:0}] [L603] p->n = t [L604] EXPR p->n [L604] p = p->n [L599] COND FALSE !(__VERIFIER_nondet_int()) [L606] COND TRUE __VERIFIER_nondet_int() [L607] p->h = 2 [L608] t = (List) malloc(sizeof(struct node)) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L609] COND FALSE !(t == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L610] p->n = t [L611] EXPR p->n [L611] p = p->n [L606] COND FALSE !(__VERIFIER_nondet_int()) [L613] p->h = 3 [L614] p = a VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-4:0}] [L615] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L615] COND FALSE !(p->h == 2) [L617] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L617] COND TRUE p->h == 1 [L618] EXPR p->n [L618] p = p->n [L617] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L617] COND FALSE !(p->h == 1) [L619] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L619] COND TRUE p->h != 3 [L620] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "list_and_tree_cnstr-1.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.0s, OverallIterations: 14, TraceHistogramMax: 3, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 772 SDtfs, 675 SDslu, 3338 SDs, 0 SdLazy, 3175 SolverSat, 302 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 457 GetRequests, 274 SyntacticMatches, 5 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=13, 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, 13 MinimizatonAttempts, 125 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 786 NumberOfCodeBlocks, 786 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 723 ConstructedInterpolants, 19 QuantifiedInterpolants, 203661 SizeOfPredicates, 98 NumberOfNonLiveVariables, 1489 ConjunctsInSsa, 262 ConjunctsInUnsatCore, 20 InterpolantComputations, 6 PerfectInterpolantSequences, 26/94 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...