/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 01:09:40,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 01:09:40,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 01:09:40,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 01:09:40,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 01:09:40,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 01:09:40,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 01:09:40,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 01:09:40,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 01:09:40,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 01:09:40,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 01:09:40,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 01:09:40,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 01:09:40,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 01:09:40,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 01:09:40,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 01:09:40,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 01:09:40,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 01:09:40,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 01:09:40,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 01:09:40,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 01:09:40,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 01:09:40,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 01:09:40,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 01:09:40,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 01:09:40,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 01:09:40,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 01:09:40,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 01:09:40,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 01:09:40,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 01:09:40,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 01:09:40,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 01:09:40,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 01:09:40,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 01:09:40,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 01:09:40,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 01:09:40,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 01:09:40,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 01:09:40,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 01:09:40,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 01:09:40,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 01:09:40,921 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 01:09:40,947 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 01:09:40,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 01:09:40,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 01:09:40,951 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 01:09:40,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 01:09:40,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 01:09:40,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 01:09:40,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 01:09:40,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 01:09:40,953 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 01:09:40,954 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 01:09:40,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 01:09:40,954 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 01:09:40,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 01:09:40,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 01:09:40,956 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 01:09:40,956 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 01:09:40,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 01:09:40,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 01:09:40,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 01:09:40,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 01:09:40,957 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 01:09:40,958 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 01:09:41,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 01:09:41,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 01:09:41,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 01:09:41,545 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 01:09:41,546 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 01:09:41,547 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i [2020-10-24 01:09:41,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1043192/99fa448d6dcd4f6c946bad72c9a07e5e/FLAGa919cdd17 [2020-10-24 01:09:42,362 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 01:09:42,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i [2020-10-24 01:09:42,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1043192/99fa448d6dcd4f6c946bad72c9a07e5e/FLAGa919cdd17 [2020-10-24 01:09:42,652 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1043192/99fa448d6dcd4f6c946bad72c9a07e5e [2020-10-24 01:09:42,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 01:09:42,667 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 01:09:42,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 01:09:42,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 01:09:42,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 01:09:42,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:09:42" (1/1) ... [2020-10-24 01:09:42,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a7f9ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:42, skipping insertion in model container [2020-10-24 01:09:42,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:09:42" (1/1) ... [2020-10-24 01:09:42,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 01:09:42,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 01:09:43,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 01:09:43,237 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 01:09:43,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 01:09:43,362 INFO L208 MainTranslator]: Completed translation [2020-10-24 01:09:43,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:43 WrapperNode [2020-10-24 01:09:43,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 01:09:43,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 01:09:43,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 01:09:43,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 01:09:43,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:43" (1/1) ... [2020-10-24 01:09:43,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:43" (1/1) ... [2020-10-24 01:09:43,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:43" (1/1) ... [2020-10-24 01:09:43,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:43" (1/1) ... [2020-10-24 01:09:43,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:43" (1/1) ... [2020-10-24 01:09:43,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:43" (1/1) ... [2020-10-24 01:09:43,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:43" (1/1) ... [2020-10-24 01:09:43,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 01:09:43,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 01:09:43,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 01:09:43,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 01:09:43,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 01:09:43,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 01:09:43,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 01:09:43,610 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 01:09:43,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-10-24 01:09:43,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-10-24 01:09:43,611 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-10-24 01:09:43,612 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2020-10-24 01:09:43,612 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 01:09:43,612 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 01:09:43,612 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 01:09:43,612 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-10-24 01:09:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-10-24 01:09:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 01:09:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 01:09:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 01:09:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-10-24 01:09:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-10-24 01:09:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-10-24 01:09:43,615 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-10-24 01:09:43,615 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-10-24 01:09:43,616 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-10-24 01:09:43,616 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-10-24 01:09:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-10-24 01:09:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-10-24 01:09:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-10-24 01:09:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-10-24 01:09:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-10-24 01:09:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-10-24 01:09:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-10-24 01:09:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-10-24 01:09:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-10-24 01:09:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-10-24 01:09:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-10-24 01:09:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-10-24 01:09:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-10-24 01:09:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-10-24 01:09:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-10-24 01:09:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-10-24 01:09:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-10-24 01:09:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-10-24 01:09:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-10-24 01:09:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-10-24 01:09:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-10-24 01:09:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-10-24 01:09:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-10-24 01:09:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-10-24 01:09:43,623 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-10-24 01:09:43,623 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-10-24 01:09:43,623 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-10-24 01:09:43,623 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-10-24 01:09:43,623 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-10-24 01:09:43,623 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-10-24 01:09:43,623 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-10-24 01:09:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-10-24 01:09:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-10-24 01:09:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-10-24 01:09:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-10-24 01:09:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-10-24 01:09:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-10-24 01:09:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-10-24 01:09:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-10-24 01:09:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-10-24 01:09:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-10-24 01:09:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-10-24 01:09:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-10-24 01:09:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-10-24 01:09:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-10-24 01:09:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-10-24 01:09:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-24 01:09:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-10-24 01:09:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-24 01:09:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-10-24 01:09:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-10-24 01:09:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-10-24 01:09:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-10-24 01:09:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-10-24 01:09:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-10-24 01:09:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-10-24 01:09:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-10-24 01:09:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-24 01:09:43,629 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-10-24 01:09:43,630 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-10-24 01:09:43,630 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-10-24 01:09:43,630 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-10-24 01:09:43,631 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-10-24 01:09:43,631 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-10-24 01:09:43,631 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-10-24 01:09:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-10-24 01:09:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-10-24 01:09:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-10-24 01:09:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-10-24 01:09:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-10-24 01:09:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-10-24 01:09:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-10-24 01:09:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-10-24 01:09:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-10-24 01:09:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-10-24 01:09:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-10-24 01:09:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-10-24 01:09:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-10-24 01:09:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-10-24 01:09:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-10-24 01:09:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-10-24 01:09:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-10-24 01:09:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-10-24 01:09:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-10-24 01:09:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-10-24 01:09:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-10-24 01:09:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-10-24 01:09:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-10-24 01:09:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-10-24 01:09:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-10-24 01:09:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-10-24 01:09:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-10-24 01:09:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-10-24 01:09:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-10-24 01:09:43,637 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-10-24 01:09:43,637 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-10-24 01:09:43,637 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-10-24 01:09:43,637 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-10-24 01:09:43,637 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2020-10-24 01:09:43,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-24 01:09:43,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 01:09:43,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-24 01:09:43,638 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 01:09:43,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-24 01:09:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 01:09:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 01:09:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 01:09:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 01:09:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 01:09:44,068 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-10-24 01:09:44,406 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 01:09:44,407 INFO L298 CfgBuilder]: Removed 3 assume(true) statements. [2020-10-24 01:09:44,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:09:44 BoogieIcfgContainer [2020-10-24 01:09:44,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 01:09:44,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 01:09:44,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 01:09:44,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 01:09:44,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:09:42" (1/3) ... [2020-10-24 01:09:44,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320fe544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:09:44, skipping insertion in model container [2020-10-24 01:09:44,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:09:43" (2/3) ... [2020-10-24 01:09:44,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320fe544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:09:44, skipping insertion in model container [2020-10-24 01:09:44,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:09:44" (3/3) ... [2020-10-24 01:09:44,420 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2020-10-24 01:09:44,433 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 01:09:44,439 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 01:09:44,453 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 01:09:44,478 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 01:09:44,478 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 01:09:44,478 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 01:09:44,478 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 01:09:44,479 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 01:09:44,479 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 01:09:44,479 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 01:09:44,479 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 01:09:44,499 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2020-10-24 01:09:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-24 01:09:44,511 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:44,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, 1, 1, 1, 1, 1] [2020-10-24 01:09:44,513 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:44,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:44,519 INFO L82 PathProgramCache]: Analyzing trace with hash 395394382, now seen corresponding path program 1 times [2020-10-24 01:09:44,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:44,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [309272703] [2020-10-24 01:09:44,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:44,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:44,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-24 01:09:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:09:44,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [309272703] [2020-10-24 01:09:44,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:09:44,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-24 01:09:44,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188057867] [2020-10-24 01:09:44,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 01:09:44,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:45,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 01:09:45,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 01:09:45,014 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 7 states. [2020-10-24 01:09:45,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:45,564 INFO L93 Difference]: Finished difference Result 202 states and 233 transitions. [2020-10-24 01:09:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 01:09:45,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-10-24 01:09:45,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:45,577 INFO L225 Difference]: With dead ends: 202 [2020-10-24 01:09:45,577 INFO L226 Difference]: Without dead ends: 118 [2020-10-24 01:09:45,582 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-24 01:09:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-24 01:09:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2020-10-24 01:09:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-24 01:09:45,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2020-10-24 01:09:45,641 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 38 [2020-10-24 01:09:45,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:45,641 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2020-10-24 01:09:45,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 01:09:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2020-10-24 01:09:45,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-24 01:09:45,644 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:45,644 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:45,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 01:09:45,645 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:45,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:45,646 INFO L82 PathProgramCache]: Analyzing trace with hash -346510149, now seen corresponding path program 1 times [2020-10-24 01:09:45,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:45,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1510454905] [2020-10-24 01:09:45,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:45,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:45,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-24 01:09:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:46,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:09:46,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1510454905] [2020-10-24 01:09:46,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:09:46,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-24 01:09:46,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421630000] [2020-10-24 01:09:46,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 01:09:46,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:46,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 01:09:46,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-10-24 01:09:46,011 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 11 states. [2020-10-24 01:09:46,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:46,666 INFO L93 Difference]: Finished difference Result 230 states and 254 transitions. [2020-10-24 01:09:46,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-24 01:09:46,667 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2020-10-24 01:09:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:46,671 INFO L225 Difference]: With dead ends: 230 [2020-10-24 01:09:46,671 INFO L226 Difference]: Without dead ends: 173 [2020-10-24 01:09:46,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2020-10-24 01:09:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-10-24 01:09:46,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 115. [2020-10-24 01:09:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-10-24 01:09:46,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2020-10-24 01:09:46,704 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 57 [2020-10-24 01:09:46,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:46,705 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2020-10-24 01:09:46,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 01:09:46,705 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2020-10-24 01:09:46,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-10-24 01:09:46,707 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:46,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:46,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 01:09:46,708 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:46,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:46,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1373842663, now seen corresponding path program 1 times [2020-10-24 01:09:46,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:46,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [627817947] [2020-10-24 01:09:46,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:46,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:46,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-24 01:09:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:09:46,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [627817947] [2020-10-24 01:09:46,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:09:46,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-24 01:09:46,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030670319] [2020-10-24 01:09:46,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 01:09:46,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:46,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 01:09:46,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 01:09:46,876 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 5 states. [2020-10-24 01:09:47,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:47,163 INFO L93 Difference]: Finished difference Result 229 states and 253 transitions. [2020-10-24 01:09:47,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 01:09:47,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2020-10-24 01:09:47,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:47,166 INFO L225 Difference]: With dead ends: 229 [2020-10-24 01:09:47,166 INFO L226 Difference]: Without dead ends: 130 [2020-10-24 01:09:47,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-24 01:09:47,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-10-24 01:09:47,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-10-24 01:09:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-24 01:09:47,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2020-10-24 01:09:47,194 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 58 [2020-10-24 01:09:47,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:47,194 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2020-10-24 01:09:47,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 01:09:47,194 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2020-10-24 01:09:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-24 01:09:47,197 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:47,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:47,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 01:09:47,197 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:47,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:47,198 INFO L82 PathProgramCache]: Analyzing trace with hash -526711592, now seen corresponding path program 1 times [2020-10-24 01:09:47,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:47,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1814260634] [2020-10-24 01:09:47,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:47,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:47,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-24 01:09:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:47,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:09:47,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1814260634] [2020-10-24 01:09:47,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:47,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 01:09:47,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419287092] [2020-10-24 01:09:47,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 01:09:47,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:47,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 01:09:47,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 01:09:47,353 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 9 states. [2020-10-24 01:09:47,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:47,857 INFO L93 Difference]: Finished difference Result 225 states and 247 transitions. [2020-10-24 01:09:47,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 01:09:47,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2020-10-24 01:09:47,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:47,862 INFO L225 Difference]: With dead ends: 225 [2020-10-24 01:09:47,862 INFO L226 Difference]: Without dead ends: 157 [2020-10-24 01:09:47,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-10-24 01:09:47,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-10-24 01:09:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 135. [2020-10-24 01:09:47,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-24 01:09:47,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2020-10-24 01:09:47,908 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 59 [2020-10-24 01:09:47,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:47,909 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2020-10-24 01:09:47,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 01:09:47,909 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2020-10-24 01:09:47,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-24 01:09:47,915 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:47,915 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:47,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 01:09:47,916 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:47,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:47,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2013836794, now seen corresponding path program 1 times [2020-10-24 01:09:47,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:47,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1454187086] [2020-10-24 01:09:47,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:48,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:48,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-24 01:09:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:48,228 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:09:48,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1454187086] [2020-10-24 01:09:48,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:48,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 01:09:48,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878794175] [2020-10-24 01:09:48,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 01:09:48,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:48,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 01:09:48,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-24 01:09:48,231 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand 11 states. [2020-10-24 01:09:48,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:48,813 INFO L93 Difference]: Finished difference Result 256 states and 281 transitions. [2020-10-24 01:09:48,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 01:09:48,819 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2020-10-24 01:09:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:48,821 INFO L225 Difference]: With dead ends: 256 [2020-10-24 01:09:48,821 INFO L226 Difference]: Without dead ends: 183 [2020-10-24 01:09:48,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2020-10-24 01:09:48,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-10-24 01:09:48,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 156. [2020-10-24 01:09:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-10-24 01:09:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2020-10-24 01:09:48,847 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 77 [2020-10-24 01:09:48,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:48,848 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2020-10-24 01:09:48,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 01:09:48,848 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2020-10-24 01:09:48,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-10-24 01:09:48,850 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:48,850 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:48,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 01:09:48,851 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:48,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:48,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1518302727, now seen corresponding path program 2 times [2020-10-24 01:09:48,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:48,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [43372484] [2020-10-24 01:09:48,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:48,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:48,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-24 01:09:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 42 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-24 01:09:49,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [43372484] [2020-10-24 01:09:49,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:49,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 01:09:49,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387193826] [2020-10-24 01:09:49,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 01:09:49,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:49,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 01:09:49,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 01:09:49,016 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand 7 states. [2020-10-24 01:09:49,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:49,443 INFO L93 Difference]: Finished difference Result 244 states and 267 transitions. [2020-10-24 01:09:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 01:09:49,443 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2020-10-24 01:09:49,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:49,445 INFO L225 Difference]: With dead ends: 244 [2020-10-24 01:09:49,446 INFO L226 Difference]: Without dead ends: 140 [2020-10-24 01:09:49,447 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-24 01:09:49,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-10-24 01:09:49,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2020-10-24 01:09:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-10-24 01:09:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2020-10-24 01:09:49,471 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 96 [2020-10-24 01:09:49,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:49,471 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2020-10-24 01:09:49,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 01:09:49,472 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2020-10-24 01:09:49,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-24 01:09:49,474 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:49,474 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:49,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 01:09:49,474 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:49,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:49,475 INFO L82 PathProgramCache]: Analyzing trace with hash 687166417, now seen corresponding path program 3 times [2020-10-24 01:09:49,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:49,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [404606467] [2020-10-24 01:09:49,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:49,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:49,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-24 01:09:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:09:49,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [404606467] [2020-10-24 01:09:49,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:49,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 01:09:49,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651295522] [2020-10-24 01:09:49,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 01:09:49,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:49,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 01:09:49,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-10-24 01:09:49,750 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 13 states. [2020-10-24 01:09:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:50,362 INFO L93 Difference]: Finished difference Result 242 states and 261 transitions. [2020-10-24 01:09:50,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-24 01:09:50,363 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2020-10-24 01:09:50,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:50,365 INFO L225 Difference]: With dead ends: 242 [2020-10-24 01:09:50,365 INFO L226 Difference]: Without dead ends: 180 [2020-10-24 01:09:50,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2020-10-24 01:09:50,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-24 01:09:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 161. [2020-10-24 01:09:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-10-24 01:09:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 172 transitions. [2020-10-24 01:09:50,412 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 172 transitions. Word has length 97 [2020-10-24 01:09:50,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:50,414 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 172 transitions. [2020-10-24 01:09:50,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 01:09:50,414 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 172 transitions. [2020-10-24 01:09:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-10-24 01:09:50,422 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:50,422 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:50,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 01:09:50,423 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:50,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:50,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1126200804, now seen corresponding path program 4 times [2020-10-24 01:09:50,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:50,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [190529593] [2020-10-24 01:09:50,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:50,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:50,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-24 01:09:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:09:50,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [190529593] [2020-10-24 01:09:50,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:50,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 01:09:50,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229217586] [2020-10-24 01:09:50,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 01:09:50,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:50,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 01:09:50,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2020-10-24 01:09:50,800 INFO L87 Difference]: Start difference. First operand 161 states and 172 transitions. Second operand 15 states. [2020-10-24 01:09:51,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:51,464 INFO L93 Difference]: Finished difference Result 263 states and 283 transitions. [2020-10-24 01:09:51,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 01:09:51,465 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 117 [2020-10-24 01:09:51,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:51,467 INFO L225 Difference]: With dead ends: 263 [2020-10-24 01:09:51,467 INFO L226 Difference]: Without dead ends: 201 [2020-10-24 01:09:51,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2020-10-24 01:09:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-24 01:09:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 182. [2020-10-24 01:09:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-10-24 01:09:51,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 194 transitions. [2020-10-24 01:09:51,494 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 194 transitions. Word has length 117 [2020-10-24 01:09:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:51,494 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 194 transitions. [2020-10-24 01:09:51,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 01:09:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 194 transitions. [2020-10-24 01:09:51,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-10-24 01:09:51,496 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:51,497 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:51,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 01:09:51,497 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:51,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:51,498 INFO L82 PathProgramCache]: Analyzing trace with hash 744664295, now seen corresponding path program 5 times [2020-10-24 01:09:51,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:51,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1808104638] [2020-10-24 01:09:51,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:51,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:51,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-24 01:09:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2020-10-24 01:09:52,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1808104638] [2020-10-24 01:09:52,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:52,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 01:09:52,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080023642] [2020-10-24 01:09:52,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 01:09:52,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:52,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 01:09:52,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2020-10-24 01:09:52,128 INFO L87 Difference]: Start difference. First operand 182 states and 194 transitions. Second operand 17 states. [2020-10-24 01:09:53,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:53,143 INFO L93 Difference]: Finished difference Result 292 states and 317 transitions. [2020-10-24 01:09:53,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-24 01:09:53,143 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 137 [2020-10-24 01:09:53,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:53,145 INFO L225 Difference]: With dead ends: 292 [2020-10-24 01:09:53,146 INFO L226 Difference]: Without dead ends: 235 [2020-10-24 01:09:53,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2020-10-24 01:09:53,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-10-24 01:09:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 188. [2020-10-24 01:09:53,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-10-24 01:09:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2020-10-24 01:09:53,176 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 137 [2020-10-24 01:09:53,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:53,176 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2020-10-24 01:09:53,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 01:09:53,176 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2020-10-24 01:09:53,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-10-24 01:09:53,186 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:53,186 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:53,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 01:09:53,187 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:53,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:53,187 INFO L82 PathProgramCache]: Analyzing trace with hash 119908868, now seen corresponding path program 1 times [2020-10-24 01:09:53,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:53,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1948820939] [2020-10-24 01:09:53,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:53,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:53,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-24 01:09:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:53,875 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2020-10-24 01:09:53,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1948820939] [2020-10-24 01:09:53,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:53,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 01:09:53,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633899635] [2020-10-24 01:09:53,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 01:09:53,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:53,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 01:09:53,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2020-10-24 01:09:53,877 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand 18 states. [2020-10-24 01:09:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:55,371 INFO L93 Difference]: Finished difference Result 292 states and 316 transitions. [2020-10-24 01:09:55,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 01:09:55,376 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 139 [2020-10-24 01:09:55,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:55,378 INFO L225 Difference]: With dead ends: 292 [2020-10-24 01:09:55,378 INFO L226 Difference]: Without dead ends: 235 [2020-10-24 01:09:55,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2020-10-24 01:09:55,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-10-24 01:09:55,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 192. [2020-10-24 01:09:55,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-10-24 01:09:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2020-10-24 01:09:55,410 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 139 [2020-10-24 01:09:55,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:55,410 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2020-10-24 01:09:55,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 01:09:55,410 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2020-10-24 01:09:55,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-10-24 01:09:55,412 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:55,412 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:55,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 01:09:55,413 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:55,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:55,413 INFO L82 PathProgramCache]: Analyzing trace with hash -181313322, now seen corresponding path program 1 times [2020-10-24 01:09:55,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:55,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1756270279] [2020-10-24 01:09:55,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:55,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:55,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-24 01:09:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2020-10-24 01:09:55,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1756270279] [2020-10-24 01:09:55,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:55,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 01:09:55,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954769824] [2020-10-24 01:09:55,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 01:09:55,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:55,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 01:09:55,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2020-10-24 01:09:55,990 INFO L87 Difference]: Start difference. First operand 192 states and 205 transitions. Second operand 17 states. [2020-10-24 01:09:56,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:56,883 INFO L93 Difference]: Finished difference Result 265 states and 284 transitions. [2020-10-24 01:09:56,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-24 01:09:56,883 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 141 [2020-10-24 01:09:56,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:56,885 INFO L225 Difference]: With dead ends: 265 [2020-10-24 01:09:56,886 INFO L226 Difference]: Without dead ends: 235 [2020-10-24 01:09:56,887 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2020-10-24 01:09:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-10-24 01:09:56,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 200. [2020-10-24 01:09:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-10-24 01:09:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 213 transitions. [2020-10-24 01:09:56,917 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 213 transitions. Word has length 141 [2020-10-24 01:09:56,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:56,918 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 213 transitions. [2020-10-24 01:09:56,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 01:09:56,918 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 213 transitions. [2020-10-24 01:09:56,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-10-24 01:09:56,920 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:09:56,920 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:09:56,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 01:09:56,921 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:09:56,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:09:56,921 INFO L82 PathProgramCache]: Analyzing trace with hash -917975359, now seen corresponding path program 1 times [2020-10-24 01:09:56,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:09:56,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1965455306] [2020-10-24 01:09:56,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:09:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 01:09:56,986 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 01:09:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 01:09:57,046 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 01:09:57,112 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-24 01:09:57,112 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 01:09:57,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 01:09:57,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 01:09:57 BoogieIcfgContainer [2020-10-24 01:09:57,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 01:09:57,198 INFO L168 Benchmark]: Toolchain (without parser) took 14537.69 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 125.9 MB in the beginning and 182.3 MB in the end (delta: -56.4 MB). Peak memory consumption was 108.2 MB. Max. memory is 8.0 GB. [2020-10-24 01:09:57,199 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 125.8 MB. Free memory was 95.4 MB in the beginning and 95.2 MB in the end (delta: 167.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 01:09:57,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 690.94 ms. Allocated memory is still 151.0 MB. Free memory was 125.3 MB in the beginning and 103.4 MB in the end (delta: 21.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2020-10-24 01:09:57,200 INFO L168 Benchmark]: Boogie Preprocessor took 146.08 ms. Allocated memory is still 151.0 MB. Free memory was 103.4 MB in the beginning and 132.3 MB in the end (delta: -28.9 MB). Peak memory consumption was 4.6 MB. Max. memory is 8.0 GB. [2020-10-24 01:09:57,201 INFO L168 Benchmark]: RCFGBuilder took 895.02 ms. Allocated memory is still 151.0 MB. Free memory was 132.3 MB in the beginning and 131.5 MB in the end (delta: 812.2 kB). Peak memory consumption was 50.6 MB. Max. memory is 8.0 GB. [2020-10-24 01:09:57,201 INFO L168 Benchmark]: TraceAbstraction took 12784.36 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 131.0 MB in the beginning and 182.3 MB in the end (delta: -51.4 MB). Peak memory consumption was 111.7 MB. Max. memory is 8.0 GB. [2020-10-24 01:09:57,204 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.21 ms. Allocated memory is still 125.8 MB. Free memory was 95.4 MB in the beginning and 95.2 MB in the end (delta: 167.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 690.94 ms. Allocated memory is still 151.0 MB. Free memory was 125.3 MB in the beginning and 103.4 MB in the end (delta: 21.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 146.08 ms. Allocated memory is still 151.0 MB. Free memory was 103.4 MB in the beginning and 132.3 MB in the end (delta: -28.9 MB). Peak memory consumption was 4.6 MB. Max. memory is 8.0 GB. * RCFGBuilder took 895.02 ms. Allocated memory is still 151.0 MB. Free memory was 132.3 MB in the beginning and 131.5 MB in the end (delta: 812.2 kB). Peak memory consumption was 50.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 12784.36 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 131.0 MB in the beginning and 182.3 MB in the end (delta: -51.4 MB). Peak memory consumption was 111.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L599] const int len = 5; VAL [len=5] [L600] CALL, EXPR dll_create(len) VAL [\old(len)=5] [L579] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L580] COND TRUE len > 0 VAL [\old(len)=5, head={0:0}, len=5] [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L588] new_head->next = head VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L590] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L593] head = new_head VAL [\old(len)=5, head={-1:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L594] len-- VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L580] COND TRUE len > 0 VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L593] head = new_head VAL [\old(len)=5, head={-2:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L594] len-- VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L580] COND TRUE len > 0 VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L593] head = new_head VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L594] len-- VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L580] COND TRUE len > 0 VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L593] head = new_head VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L594] len-- VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L580] COND TRUE len > 0 VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L593] head = new_head VAL [\old(len)=5, head={-5:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L594] len-- VAL [\old(len)=5, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L580] COND FALSE !(len > 0) VAL [\old(len)=5, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L596] return head; VAL [\old(len)=5, \result={-5:0}, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L600] RET, EXPR dll_create(len) VAL [dll_create(len)={-5:0}, len=5] [L600] DLL head = dll_create(len); VAL [dll_create(len)={-5:0}, head={-5:0}, len=5] [L601] head->next VAL [head={-5:0}, head->next={-4:0}, len=5] [L601] COND TRUE head->next VAL [head={-5:0}, head->next={-4:0}, len=5] [L602] EXPR head->data_0 VAL [head={-5:0}, head->data_0=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, len=5] [L602] EXPR head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L616] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "dll_nullified-1.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.6s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1098 SDtfs, 1430 SDslu, 7009 SDs, 0 SdLazy, 4041 SolverSat, 232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 67 SyntacticMatches, 12 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 289 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1157 NumberOfCodeBlocks, 1157 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1005 ConstructedInterpolants, 0 QuantifiedInterpolants, 402888 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 595/869 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...