/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-7d8eed3 [2020-11-06 22:31:06,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:31:06,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:31:06,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:31:06,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:31:06,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:31:06,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:31:06,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:31:06,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:31:06,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:31:06,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:31:06,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:31:06,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:31:06,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:31:06,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:31:06,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:31:06,590 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:31:06,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:31:06,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:31:06,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:31:06,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:31:06,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:31:06,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:31:06,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:31:06,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:31:06,625 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:31:06,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:31:06,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:31:06,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:31:06,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:31:06,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:31:06,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:31:06,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:31:06,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:31:06,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:31:06,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:31:06,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:31:06,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:31:06,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:31:06,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:31:06,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:31:06,638 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:31:06,673 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:31:06,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:31:06,674 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:31:06,675 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:31:06,675 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:31:06,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:31:06,675 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:31:06,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:31:06,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:31:06,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:31:06,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:31:06,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:31:06,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:31:06,677 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:31:06,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:31:06,677 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:31:06,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:31:06,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:31:06,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:31:06,678 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:31:06,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:31:06,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:31:06,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:31:06,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:31:06,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:31:06,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:31:06,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:31:06,680 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:31:06,680 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:31:06,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-06 22:31:07,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:31:07,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:31:07,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:31:07,081 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:31:07,082 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:31:07,083 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-11-06 22:31:07,173 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d04396ef/c222f63e3b9b439fa47c651a6c7793da/FLAG18e35e05c [2020-11-06 22:31:07,966 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:31:07,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2020-11-06 22:31:07,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d04396ef/c222f63e3b9b439fa47c651a6c7793da/FLAG18e35e05c [2020-11-06 22:31:08,265 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d04396ef/c222f63e3b9b439fa47c651a6c7793da [2020-11-06 22:31:08,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:31:08,278 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:31:08,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:31:08,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:31:08,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:31:08,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:31:08" (1/1) ... [2020-11-06 22:31:08,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b0f7c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:08, skipping insertion in model container [2020-11-06 22:31:08,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:31:08" (1/1) ... [2020-11-06 22:31:08,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:31:08,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:31:08,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:31:08,903 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:31:08,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:31:09,029 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:31:09,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:09 WrapperNode [2020-11-06 22:31:09,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:31:09,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:31:09,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:31:09,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:31:09,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:09" (1/1) ... [2020-11-06 22:31:09,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:09" (1/1) ... [2020-11-06 22:31:09,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:09" (1/1) ... [2020-11-06 22:31:09,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:09" (1/1) ... [2020-11-06 22:31:09,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:09" (1/1) ... [2020-11-06 22:31:09,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:09" (1/1) ... [2020-11-06 22:31:09,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:09" (1/1) ... [2020-11-06 22:31:09,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:31:09,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:31:09,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:31:09,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:31:09,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:31:09,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:31:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:31:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:31:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-06 22:31:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-06 22:31:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-11-06 22:31:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:31:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:31:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:31:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-06 22:31:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-06 22:31:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:31:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:31:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:31:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-06 22:31:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-06 22:31:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-06 22:31:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-06 22:31:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-06 22:31:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-06 22:31:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-06 22:31:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-06 22:31:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-06 22:31:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-06 22:31:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-06 22:31:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-06 22:31:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-06 22:31:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-06 22:31:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-06 22:31:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-06 22:31:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-06 22:31:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-06 22:31:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-06 22:31:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-06 22:31:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-06 22:31:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-06 22:31:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-06 22:31:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-06 22:31:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-06 22:31:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-06 22:31:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-06 22:31:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-06 22:31:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-06 22:31:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-06 22:31:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-06 22:31:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-06 22:31:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-06 22:31:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-06 22:31:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-06 22:31:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-06 22:31:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-06 22:31:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-06 22:31:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-06 22:31:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-06 22:31:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-06 22:31:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-06 22:31:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-06 22:31:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-06 22:31:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-06 22:31:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-06 22:31:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-06 22:31:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-06 22:31:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-06 22:31:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-06 22:31:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-06 22:31:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-06 22:31:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-06 22:31:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-06 22:31:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-06 22:31:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-06 22:31:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-11-06 22:31:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-06 22:31:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-06 22:31:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-06 22:31:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-06 22:31:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-06 22:31:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-06 22:31:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-06 22:31:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-06 22:31:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-06 22:31:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-06 22:31:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-06 22:31:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-06 22:31:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-06 22:31:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-06 22:31:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-06 22:31:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-06 22:31:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-06 22:31:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-06 22:31:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-06 22:31:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-06 22:31:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-06 22:31:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-06 22:31:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-06 22:31:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-06 22:31:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-06 22:31:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-06 22:31:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-06 22:31:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-06 22:31:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-06 22:31:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-06 22:31:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-06 22:31:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-06 22:31:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-06 22:31:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-06 22:31:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-06 22:31:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-06 22:31:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-06 22:31:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-06 22:31:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-06 22:31:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-06 22:31:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-06 22:31:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-06 22:31:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-06 22:31:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-06 22:31:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-06 22:31:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-06 22:31:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-06 22:31:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-11-06 22:31:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:31:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-06 22:31:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-06 22:31:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-06 22:31:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:31:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:31:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:31:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:31:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:31:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:31:09,639 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-11-06 22:31:10,043 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:31:10,044 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-11-06 22:31:10,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:31:10 BoogieIcfgContainer [2020-11-06 22:31:10,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:31:10,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:31:10,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:31:10,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:31:10,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:31:08" (1/3) ... [2020-11-06 22:31:10,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f2131d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:31:10, skipping insertion in model container [2020-11-06 22:31:10,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:09" (2/3) ... [2020-11-06 22:31:10,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f2131d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:31:10, skipping insertion in model container [2020-11-06 22:31:10,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:31:10" (3/3) ... [2020-11-06 22:31:10,056 INFO L111 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2020-11-06 22:31:10,073 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:31:10,077 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:31:10,091 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:31:10,119 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:31:10,119 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:31:10,119 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:31:10,119 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:31:10,119 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:31:10,120 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:31:10,120 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:31:10,120 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:31:10,140 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2020-11-06 22:31:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-06 22:31:10,148 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:10,149 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:31:10,149 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:10,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:10,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1723059971, now seen corresponding path program 1 times [2020-11-06 22:31:10,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:10,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974897716] [2020-11-06 22:31:10,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:10,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:31:10,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974897716] [2020-11-06 22:31:10,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:31:10,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-06 22:31:10,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357710821] [2020-11-06 22:31:10,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:31:10,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:10,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:31:10,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-06 22:31:10,469 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2020-11-06 22:31:10,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:10,769 INFO L93 Difference]: Finished difference Result 115 states and 176 transitions. [2020-11-06 22:31:10,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:31:10,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-11-06 22:31:10,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:10,787 INFO L225 Difference]: With dead ends: 115 [2020-11-06 22:31:10,787 INFO L226 Difference]: Without dead ends: 49 [2020-11-06 22:31:10,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-06 22:31:10,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-06 22:31:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-11-06 22:31:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-11-06 22:31:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2020-11-06 22:31:10,854 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 22 [2020-11-06 22:31:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:10,855 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2020-11-06 22:31:10,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:31:10,855 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2020-11-06 22:31:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-06 22:31:10,858 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:10,858 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-11-06 22:31:10,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:31:10,859 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:10,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:10,860 INFO L82 PathProgramCache]: Analyzing trace with hash 80260039, now seen corresponding path program 1 times [2020-11-06 22:31:10,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:10,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103222238] [2020-11-06 22:31:10,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:11,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:31:11,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103222238] [2020-11-06 22:31:11,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:31:11,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:31:11,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951824195] [2020-11-06 22:31:11,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:31:11,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:11,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:31:11,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:31:11,082 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand 4 states. [2020-11-06 22:31:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:11,243 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2020-11-06 22:31:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:31:11,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-11-06 22:31:11,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:11,247 INFO L225 Difference]: With dead ends: 79 [2020-11-06 22:31:11,247 INFO L226 Difference]: Without dead ends: 57 [2020-11-06 22:31:11,248 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-11-06 22:31:11,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-06 22:31:11,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-06 22:31:11,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-06 22:31:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2020-11-06 22:31:11,260 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 27 [2020-11-06 22:31:11,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:11,260 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2020-11-06 22:31:11,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:31:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2020-11-06 22:31:11,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-06 22:31:11,262 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:11,262 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-11-06 22:31:11,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:31:11,263 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:11,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:11,264 INFO L82 PathProgramCache]: Analyzing trace with hash 510744340, now seen corresponding path program 1 times [2020-11-06 22:31:11,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:11,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348978898] [2020-11-06 22:31:11,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:11,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:31:11,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348978898] [2020-11-06 22:31:11,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:31:11,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:31:11,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805998790] [2020-11-06 22:31:11,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:31:11,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:11,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:31:11,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:31:11,349 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand 4 states. [2020-11-06 22:31:11,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:11,498 INFO L93 Difference]: Finished difference Result 97 states and 135 transitions. [2020-11-06 22:31:11,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:31:11,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-11-06 22:31:11,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:11,500 INFO L225 Difference]: With dead ends: 97 [2020-11-06 22:31:11,500 INFO L226 Difference]: Without dead ends: 59 [2020-11-06 22:31:11,501 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-11-06 22:31:11,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-06 22:31:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-06 22:31:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-06 22:31:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2020-11-06 22:31:11,510 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 33 [2020-11-06 22:31:11,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:11,511 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2020-11-06 22:31:11,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:31:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2020-11-06 22:31:11,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-06 22:31:11,512 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:11,512 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-11-06 22:31:11,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:31:11,513 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:11,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:11,514 INFO L82 PathProgramCache]: Analyzing trace with hash 729599058, now seen corresponding path program 1 times [2020-11-06 22:31:11,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:11,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153886197] [2020-11-06 22:31:11,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:11,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:11,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:11,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153886197] [2020-11-06 22:31:11,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:31:11,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:31:11,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657824137] [2020-11-06 22:31:11,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:31:11,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:11,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:31:11,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:31:11,620 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand 6 states. [2020-11-06 22:31:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:11,836 INFO L93 Difference]: Finished difference Result 85 states and 112 transitions. [2020-11-06 22:31:11,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:31:11,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-11-06 22:31:11,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:11,838 INFO L225 Difference]: With dead ends: 85 [2020-11-06 22:31:11,839 INFO L226 Difference]: Without dead ends: 79 [2020-11-06 22:31:11,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:31:11,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-06 22:31:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2020-11-06 22:31:11,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-06 22:31:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2020-11-06 22:31:11,849 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 93 transitions. Word has length 33 [2020-11-06 22:31:11,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:11,849 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 93 transitions. [2020-11-06 22:31:11,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:31:11,850 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2020-11-06 22:31:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-06 22:31:11,851 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:11,851 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-11-06 22:31:11,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:31:11,852 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:11,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:11,852 INFO L82 PathProgramCache]: Analyzing trace with hash 585622541, now seen corresponding path program 1 times [2020-11-06 22:31:11,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:11,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042194911] [2020-11-06 22:31:11,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:11,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:11,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042194911] [2020-11-06 22:31:11,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:31:11,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:31:11,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163400656] [2020-11-06 22:31:11,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:31:11,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:11,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:31:11,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:31:11,955 INFO L87 Difference]: Start difference. First operand 68 states and 93 transitions. Second operand 6 states. [2020-11-06 22:31:12,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:12,210 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2020-11-06 22:31:12,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:31:12,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-11-06 22:31:12,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:12,213 INFO L225 Difference]: With dead ends: 87 [2020-11-06 22:31:12,213 INFO L226 Difference]: Without dead ends: 77 [2020-11-06 22:31:12,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:31:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-06 22:31:12,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 66. [2020-11-06 22:31:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-06 22:31:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2020-11-06 22:31:12,221 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 90 transitions. Word has length 35 [2020-11-06 22:31:12,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:12,222 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 90 transitions. [2020-11-06 22:31:12,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:31:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2020-11-06 22:31:12,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-06 22:31:12,223 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:12,224 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-11-06 22:31:12,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:31:12,224 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:12,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:12,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1777671693, now seen corresponding path program 1 times [2020-11-06 22:31:12,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:12,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427587575] [2020-11-06 22:31:12,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:12,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:12,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427587575] [2020-11-06 22:31:12,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:31:12,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:31:12,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589102533] [2020-11-06 22:31:12,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:31:12,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:12,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:31:12,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:31:12,320 INFO L87 Difference]: Start difference. First operand 66 states and 90 transitions. Second operand 6 states. [2020-11-06 22:31:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:12,552 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2020-11-06 22:31:12,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:31:12,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-11-06 22:31:12,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:12,554 INFO L225 Difference]: With dead ends: 87 [2020-11-06 22:31:12,554 INFO L226 Difference]: Without dead ends: 74 [2020-11-06 22:31:12,555 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:31:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-06 22:31:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2020-11-06 22:31:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-06 22:31:12,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2020-11-06 22:31:12,562 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 35 [2020-11-06 22:31:12,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:12,562 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2020-11-06 22:31:12,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:31:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2020-11-06 22:31:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-06 22:31:12,564 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:12,564 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-11-06 22:31:12,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-06 22:31:12,564 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:12,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:12,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1980453703, now seen corresponding path program 1 times [2020-11-06 22:31:12,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:12,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131424971] [2020-11-06 22:31:12,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:12,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:12,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:12,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131424971] [2020-11-06 22:31:12,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936146593] [2020-11-06 22:31:12,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:12,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 28 conjunts are in the unsatisfiable core [2020-11-06 22:31:12,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:31:13,057 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-06 22:31:13,062 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:13,068 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:13,069 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:13,069 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-06 22:31:13,117 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:13,117 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-06 22:31:13,119 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:13,131 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:13,140 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:31:13,141 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:13,151 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:13,152 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:13,152 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2020-11-06 22:31:13,178 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-11-06 22:31:13,179 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2020-11-06 22:31:13,181 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:13,193 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:13,193 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:13,194 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2020-11-06 22:31:13,229 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-06 22:31:13,230 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:13,242 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:13,247 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-06 22:31:13,247 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-11-06 22:31:13,329 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-11-06 22:31:13,333 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:13,341 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:13,344 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:13,345 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-11-06 22:31:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:13,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:31:13,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-11-06 22:31:13,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700580710] [2020-11-06 22:31:13,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:31:13,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:13,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:31:13,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:31:13,363 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand 10 states. [2020-11-06 22:31:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:13,867 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2020-11-06 22:31:13,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-06 22:31:13,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-11-06 22:31:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:13,869 INFO L225 Difference]: With dead ends: 89 [2020-11-06 22:31:13,869 INFO L226 Difference]: Without dead ends: 81 [2020-11-06 22:31:13,870 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-11-06 22:31:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-11-06 22:31:13,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2020-11-06 22:31:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-06 22:31:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2020-11-06 22:31:13,878 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 37 [2020-11-06 22:31:13,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:13,878 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 94 transitions. [2020-11-06 22:31:13,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:31:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2020-11-06 22:31:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-06 22:31:13,880 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:13,880 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-11-06 22:31:14,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-06 22:31:14,095 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:14,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:14,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1180142727, now seen corresponding path program 1 times [2020-11-06 22:31:14,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:14,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412263455] [2020-11-06 22:31:14,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:14,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:14,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412263455] [2020-11-06 22:31:14,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480087468] [2020-11-06 22:31:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:14,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 28 conjunts are in the unsatisfiable core [2020-11-06 22:31:14,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:31:14,454 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-06 22:31:14,454 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:14,457 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:14,457 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:14,457 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-06 22:31:14,480 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:14,480 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-06 22:31:14,481 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:14,498 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:14,504 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:31:14,504 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:14,514 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:14,515 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:14,515 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2020-11-06 22:31:14,536 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-11-06 22:31:14,537 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2020-11-06 22:31:14,538 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:14,544 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:14,544 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:14,545 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2020-11-06 22:31:14,558 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-06 22:31:14,559 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:14,567 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:14,569 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-06 22:31:14,569 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-11-06 22:31:14,624 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-11-06 22:31:14,625 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:14,631 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:14,633 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:14,633 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-11-06 22:31:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:14,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:31:14,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-11-06 22:31:14,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727244508] [2020-11-06 22:31:14,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:31:14,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:14,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:31:14,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:31:14,643 INFO L87 Difference]: Start difference. First operand 70 states and 94 transitions. Second operand 10 states. [2020-11-06 22:31:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:15,090 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2020-11-06 22:31:15,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-06 22:31:15,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-11-06 22:31:15,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:15,092 INFO L225 Difference]: With dead ends: 98 [2020-11-06 22:31:15,092 INFO L226 Difference]: Without dead ends: 92 [2020-11-06 22:31:15,093 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-11-06 22:31:15,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-06 22:31:15,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2020-11-06 22:31:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-06 22:31:15,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 108 transitions. [2020-11-06 22:31:15,100 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 108 transitions. Word has length 37 [2020-11-06 22:31:15,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:15,100 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 108 transitions. [2020-11-06 22:31:15,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:31:15,101 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 108 transitions. [2020-11-06 22:31:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-06 22:31:15,102 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:15,102 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-11-06 22:31:15,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:15,316 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:15,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:15,317 INFO L82 PathProgramCache]: Analyzing trace with hash 167149748, now seen corresponding path program 1 times [2020-11-06 22:31:15,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:15,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701700906] [2020-11-06 22:31:15,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:15,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:15,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701700906] [2020-11-06 22:31:15,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786598053] [2020-11-06 22:31:15,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:15,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 38 conjunts are in the unsatisfiable core [2020-11-06 22:31:15,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:31:15,809 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-06 22:31:15,809 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:15,811 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:15,812 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:15,812 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-06 22:31:15,856 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:15,857 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-06 22:31:15,858 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:15,864 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:15,865 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:15,865 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-11-06 22:31:15,896 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-06 22:31:15,897 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:15,909 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:15,914 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-06 22:31:15,914 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:15,925 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:15,927 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:15,927 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2020-11-06 22:31:15,959 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_43|], 2=[|v_#memory_$Pointer$.offset_43|, |v_#memory_$Pointer$.base_45|]} [2020-11-06 22:31:15,966 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2020-11-06 22:31:15,966 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:15,979 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:15,984 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 82 [2020-11-06 22:31:15,985 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:15,994 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:16,015 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:16,016 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 105 [2020-11-06 22:31:16,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-11-06 22:31:16,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-06 22:31:16,022 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:16,034 INFO L625 ElimStorePlain]: treesize reduction 48, result has 38.5 percent of original size [2020-11-06 22:31:16,035 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:16,035 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2020-11-06 22:31:16,063 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2020-11-06 22:31:16,064 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:16,071 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:16,073 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-11-06 22:31:16,074 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:16,078 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:16,080 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:16,080 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2020-11-06 22:31:16,114 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-06 22:31:16,115 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:16,116 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:16,117 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:16,117 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-11-06 22:31:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:16,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:31:16,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-11-06 22:31:16,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727081971] [2020-11-06 22:31:16,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-06 22:31:16,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:16,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-06 22:31:16,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-11-06 22:31:16,124 INFO L87 Difference]: Start difference. First operand 81 states and 108 transitions. Second operand 16 states. [2020-11-06 22:31:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:16,784 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2020-11-06 22:31:16,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-06 22:31:16,785 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2020-11-06 22:31:16,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:16,786 INFO L225 Difference]: With dead ends: 108 [2020-11-06 22:31:16,787 INFO L226 Difference]: Without dead ends: 96 [2020-11-06 22:31:16,787 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-11-06 22:31:16,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-11-06 22:31:16,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2020-11-06 22:31:16,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-11-06 22:31:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2020-11-06 22:31:16,795 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 39 [2020-11-06 22:31:16,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:16,795 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2020-11-06 22:31:16,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-06 22:31:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2020-11-06 22:31:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-06 22:31:16,796 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:16,797 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-11-06 22:31:17,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:17,013 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:17,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:17,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1237714927, now seen corresponding path program 1 times [2020-11-06 22:31:17,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:17,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460965933] [2020-11-06 22:31:17,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:17,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:17,340 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:17,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460965933] [2020-11-06 22:31:17,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051069699] [2020-11-06 22:31:17,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:17,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 34 conjunts are in the unsatisfiable core [2020-11-06 22:31:17,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:31:17,539 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-06 22:31:17,539 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:17,541 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:17,542 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:17,542 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-06 22:31:17,592 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:17,593 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-06 22:31:17,594 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:17,602 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:17,602 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:17,602 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-11-06 22:31:17,635 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-06 22:31:17,635 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:17,647 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:17,654 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-06 22:31:17,654 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:17,666 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:17,668 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:17,669 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2020-11-06 22:31:17,712 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 2=[|v_#memory_$Pointer$.offset_45|, |v_#memory_$Pointer$.base_47|]} [2020-11-06 22:31:17,718 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11-06 22:31:17,718 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:17,733 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:17,738 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 82 [2020-11-06 22:31:17,739 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:17,754 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:17,781 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:17,782 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 105 [2020-11-06 22:31:17,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-11-06 22:31:17,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-06 22:31:17,789 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:17,804 INFO L625 ElimStorePlain]: treesize reduction 48, result has 38.5 percent of original size [2020-11-06 22:31:17,804 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:17,805 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2020-11-06 22:31:17,858 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2020-11-06 22:31:17,859 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:17,868 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:17,873 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-11-06 22:31:17,874 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:17,878 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:17,880 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:17,880 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2020-11-06 22:31:17,889 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-06 22:31:17,890 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:17,892 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:17,893 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:17,893 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-11-06 22:31:17,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:17,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:31:17,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-11-06 22:31:17,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837109179] [2020-11-06 22:31:17,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-06 22:31:17,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:17,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-06 22:31:17,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-11-06 22:31:17,925 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. Second operand 16 states. [2020-11-06 22:31:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:18,637 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2020-11-06 22:31:18,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:31:18,638 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2020-11-06 22:31:18,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:18,640 INFO L225 Difference]: With dead ends: 104 [2020-11-06 22:31:18,640 INFO L226 Difference]: Without dead ends: 84 [2020-11-06 22:31:18,642 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-11-06 22:31:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-06 22:31:18,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 71. [2020-11-06 22:31:18,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-06 22:31:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2020-11-06 22:31:18,649 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 41 [2020-11-06 22:31:18,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:18,649 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2020-11-06 22:31:18,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-06 22:31:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2020-11-06 22:31:18,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-06 22:31:18,650 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:18,651 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-11-06 22:31:18,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:18,864 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:18,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:18,865 INFO L82 PathProgramCache]: Analyzing trace with hash 791151008, now seen corresponding path program 2 times [2020-11-06 22:31:18,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:18,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314355855] [2020-11-06 22:31:18,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:19,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:19,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314355855] [2020-11-06 22:31:19,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388022568] [2020-11-06 22:31:19,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:19,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-06 22:31:19,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:31:19,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 43 conjunts are in the unsatisfiable core [2020-11-06 22:31:19,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:31:19,304 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-06 22:31:19,305 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:19,317 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:19,318 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:19,318 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-06 22:31:19,350 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:19,351 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-11-06 22:31:19,352 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:19,389 INFO L625 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-11-06 22:31:19,397 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:31:19,397 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:19,416 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:19,416 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:19,417 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2020-11-06 22:31:19,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:31:19,467 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-06 22:31:19,467 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:19,487 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:19,488 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:19,488 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2020-11-06 22:31:19,546 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:19,547 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-11-06 22:31:19,548 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:19,562 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:19,569 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-06 22:31:19,570 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:19,586 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:19,586 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:19,586 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2020-11-06 22:31:19,646 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-11-06 22:31:19,646 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-11-06 22:31:19,647 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:19,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:19,662 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-06 22:31:19,662 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2020-11-06 22:31:19,743 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-11-06 22:31:19,744 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:19,758 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:19,764 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-06 22:31:19,765 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-11-06 22:31:19,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:19,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:31:19,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2020-11-06 22:31:19,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051857905] [2020-11-06 22:31:19,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-06 22:31:19,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:19,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-06 22:31:19,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:31:19,892 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand 19 states. [2020-11-06 22:31:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:20,936 INFO L93 Difference]: Finished difference Result 108 states and 139 transitions. [2020-11-06 22:31:20,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-06 22:31:20,936 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2020-11-06 22:31:20,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:20,938 INFO L225 Difference]: With dead ends: 108 [2020-11-06 22:31:20,938 INFO L226 Difference]: Without dead ends: 98 [2020-11-06 22:31:20,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2020-11-06 22:31:20,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-11-06 22:31:20,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2020-11-06 22:31:20,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-06 22:31:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions. [2020-11-06 22:31:20,950 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 116 transitions. Word has length 41 [2020-11-06 22:31:20,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:20,951 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 116 transitions. [2020-11-06 22:31:20,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-06 22:31:20,951 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 116 transitions. [2020-11-06 22:31:20,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-06 22:31:20,954 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:20,954 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-11-06 22:31:21,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-11-06 22:31:21,161 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:21,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:21,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1041918048, now seen corresponding path program 1 times [2020-11-06 22:31:21,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:21,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602578100] [2020-11-06 22:31:21,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:21,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:21,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602578100] [2020-11-06 22:31:21,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214229304] [2020-11-06 22:31:21,443 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-11-06 22:31:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:21,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 38 conjunts are in the unsatisfiable core [2020-11-06 22:31:21,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:31:21,625 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-06 22:31:21,625 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:21,627 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:21,627 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:21,628 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-06 22:31:21,711 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:21,711 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-11-06 22:31:21,713 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:21,755 INFO L625 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2020-11-06 22:31:21,759 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:31:21,760 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:21,778 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:21,778 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:21,779 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2020-11-06 22:31:21,841 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-11-06 22:31:21,842 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2020-11-06 22:31:21,842 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:21,852 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:21,852 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:21,852 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2020-11-06 22:31:21,908 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:21,909 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-11-06 22:31:21,910 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:21,926 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:21,934 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-06 22:31:21,935 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:21,951 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:21,951 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:21,951 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2020-11-06 22:31:22,016 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-11-06 22:31:22,017 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-11-06 22:31:22,018 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:22,030 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:22,032 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-06 22:31:22,032 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2020-11-06 22:31:22,104 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-11-06 22:31:22,105 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:22,147 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:22,159 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-06 22:31:22,162 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2020-11-06 22:31:22,268 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-11-06 22:31:22,270 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:22,278 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:22,279 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:22,280 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2020-11-06 22:31:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:22,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:31:22,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2020-11-06 22:31:22,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473072964] [2020-11-06 22:31:22,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-06 22:31:22,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:22,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-06 22:31:22,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2020-11-06 22:31:22,313 INFO L87 Difference]: Start difference. First operand 89 states and 116 transitions. Second operand 21 states. [2020-11-06 22:31:23,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:23,626 INFO L93 Difference]: Finished difference Result 128 states and 163 transitions. [2020-11-06 22:31:23,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-06 22:31:23,627 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2020-11-06 22:31:23,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:23,628 INFO L225 Difference]: With dead ends: 128 [2020-11-06 22:31:23,629 INFO L226 Difference]: Without dead ends: 120 [2020-11-06 22:31:23,630 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-11-06 22:31:23,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-11-06 22:31:23,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97. [2020-11-06 22:31:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-06 22:31:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2020-11-06 22:31:23,635 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 41 [2020-11-06 22:31:23,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:23,636 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2020-11-06 22:31:23,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-06 22:31:23,636 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2020-11-06 22:31:23,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-06 22:31:23,637 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:23,637 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-11-06 22:31:23,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:23,840 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:23,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:23,841 INFO L82 PathProgramCache]: Analyzing trace with hash 799553499, now seen corresponding path program 2 times [2020-11-06 22:31:23,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:23,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133622746] [2020-11-06 22:31:23,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:24,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:24,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133622746] [2020-11-06 22:31:24,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841691136] [2020-11-06 22:31:24,328 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-11-06 22:31:24,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-06 22:31:24,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:31:24,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 53 conjunts are in the unsatisfiable core [2020-11-06 22:31:24,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:31:24,513 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-06 22:31:24,514 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:24,518 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:24,519 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:24,519 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-06 22:31:24,550 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:24,550 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-11-06 22:31:24,551 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:24,584 INFO L625 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2020-11-06 22:31:24,585 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:24,585 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-11-06 22:31:24,637 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:31:24,637 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:24,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:24,660 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:31:24,661 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:24,683 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:24,685 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:24,685 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2020-11-06 22:31:24,745 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:24,745 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2020-11-06 22:31:24,746 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:24,774 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:24,775 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_55|], 2=[|v_#memory_$Pointer$.base_53|, |v_#memory_$Pointer$.offset_47|]} [2020-11-06 22:31:24,781 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-06 22:31:24,782 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:24,806 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:24,832 INFO L348 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2020-11-06 22:31:24,833 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2020-11-06 22:31:24,833 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:24,876 INFO L625 ElimStorePlain]: treesize reduction 8, result has 86.7 percent of original size [2020-11-06 22:31:24,882 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-11-06 22:31:24,882 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:24,900 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:24,900 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:24,900 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:37 [2020-11-06 22:31:24,982 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:24,982 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 136 [2020-11-06 22:31:24,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-11-06 22:31:24,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-06 22:31:24,986 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:25,050 INFO L625 ElimStorePlain]: treesize reduction 26, result has 84.0 percent of original size [2020-11-06 22:31:25,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:31:25,058 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2020-11-06 22:31:25,058 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:25,080 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:25,087 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 61 [2020-11-06 22:31:25,088 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:25,108 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:25,110 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:25,111 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:145, output treesize:84 [2020-11-06 22:31:25,196 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_57|, |v_#memory_$Pointer$.offset_49|], 6=[|v_#memory_$Pointer$.base_55|]} [2020-11-06 22:31:25,203 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40 [2020-11-06 22:31:25,204 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:25,227 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:25,253 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:25,253 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 185 [2020-11-06 22:31:25,255 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-06 22:31:25,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-06 22:31:25,260 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2020-11-06 22:31:25,316 INFO L625 ElimStorePlain]: treesize reduction 299, result has 32.7 percent of original size [2020-11-06 22:31:25,368 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:25,368 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 160 [2020-11-06 22:31:25,371 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-06 22:31:25,372 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:31:25,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,388 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-06 22:31:25,390 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-06 22:31:25,391 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:31:25,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,406 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-06 22:31:25,406 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:31:25,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,414 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-06 22:31:25,416 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:31:25,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,428 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-06 22:31:25,429 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:31:25,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,437 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-06 22:31:25,438 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:31:25,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,452 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-06 22:31:25,453 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:31:25,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,461 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-06 22:31:25,463 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-06 22:31:25,464 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:31:25,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,473 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-06 22:31:25,474 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:31:25,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,483 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-06 22:31:25,484 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:31:25,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,493 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-06 22:31:25,494 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:31:25,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,504 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-06 22:31:25,505 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-06 22:31:25,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-06 22:31:25,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-06 22:31:25,513 INFO L547 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-06 22:31:25,573 INFO L625 ElimStorePlain]: treesize reduction 92, result has 37.0 percent of original size [2020-11-06 22:31:25,575 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-06 22:31:25,576 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:220, output treesize:88 [2020-11-06 22:31:25,647 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2020-11-06 22:31:25,653 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2020-11-06 22:31:25,654 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:25,673 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:25,683 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:25,683 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 47 [2020-11-06 22:31:25,685 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-06 22:31:25,687 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-06 22:31:25,689 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-06 22:31:25,725 INFO L625 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2020-11-06 22:31:25,728 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-06 22:31:25,728 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:99, output treesize:19 [2020-11-06 22:31:25,834 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:25,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:31:25,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2020-11-06 22:31:25,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044830112] [2020-11-06 22:31:25,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-06 22:31:25,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:25,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-06 22:31:25,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2020-11-06 22:31:25,840 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand 20 states. [2020-11-06 22:31:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:26,895 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2020-11-06 22:31:26,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-06 22:31:26,896 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2020-11-06 22:31:26,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:26,897 INFO L225 Difference]: With dead ends: 124 [2020-11-06 22:31:26,898 INFO L226 Difference]: Without dead ends: 116 [2020-11-06 22:31:26,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2020-11-06 22:31:26,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-11-06 22:31:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2020-11-06 22:31:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-11-06 22:31:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 132 transitions. [2020-11-06 22:31:26,905 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 132 transitions. Word has length 43 [2020-11-06 22:31:26,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:26,906 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 132 transitions. [2020-11-06 22:31:26,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-06 22:31:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 132 transitions. [2020-11-06 22:31:26,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-06 22:31:26,906 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:26,907 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-11-06 22:31:27,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:27,116 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:27,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:27,117 INFO L82 PathProgramCache]: Analyzing trace with hash 76461211, now seen corresponding path program 1 times [2020-11-06 22:31:27,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:27,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794109784] [2020-11-06 22:31:27,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:31:27,144 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:31:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:31:27,167 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:31:27,213 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-06 22:31:27,214 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-06 22:31:27,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-06 22:31:27,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:31:27 BoogieIcfgContainer [2020-11-06 22:31:27,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:31:27,271 INFO L168 Benchmark]: Toolchain (without parser) took 18998.58 ms. Allocated memory was 165.7 MB in the beginning and 336.6 MB in the end (delta: 170.9 MB). Free memory was 139.2 MB in the beginning and 280.3 MB in the end (delta: -141.2 MB). Peak memory consumption was 30.8 MB. Max. memory is 8.0 GB. [2020-11-06 22:31:27,271 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 165.7 MB. Free memory is still 137.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:31:27,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.70 ms. Allocated memory is still 165.7 MB. Free memory was 138.4 MB in the beginning and 116.1 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2020-11-06 22:31:27,272 INFO L168 Benchmark]: Boogie Preprocessor took 75.96 ms. Allocated memory is still 165.7 MB. Free memory was 116.1 MB in the beginning and 113.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:31:27,272 INFO L168 Benchmark]: RCFGBuilder took 936.82 ms. Allocated memory is still 165.7 MB. Free memory was 113.0 MB in the beginning and 94.9 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 8.0 GB. [2020-11-06 22:31:27,273 INFO L168 Benchmark]: TraceAbstraction took 17221.76 ms. Allocated memory was 165.7 MB in the beginning and 336.6 MB in the end (delta: 170.9 MB). Free memory was 94.4 MB in the beginning and 280.3 MB in the end (delta: -185.9 MB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:31:27,274 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 165.7 MB. Free memory is still 137.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 746.70 ms. Allocated memory is still 165.7 MB. Free memory was 138.4 MB in the beginning and 116.1 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 75.96 ms. Allocated memory is still 165.7 MB. Free memory was 116.1 MB in the beginning and 113.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 936.82 ms. Allocated memory is still 165.7 MB. Free memory was 113.0 MB in the beginning and 94.9 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 17221.76 ms. Allocated memory was 165.7 MB in the beginning and 336.6 MB in the end (delta: 170.9 MB). Free memory was 94.4 MB in the beginning and 280.3 MB in the end (delta: -185.9 MB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [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))={-3:0}, malloc(sizeof(struct node))={-2: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))={-3:0}, malloc(sizeof(struct node))={-2: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))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4: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))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4: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))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4: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))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4: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))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4: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))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4: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))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4: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, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 457 GetRequests, 274 SyntacticMatches, 5 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 4.3s 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...