/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/ldv-sets/test_mutex_double_lock.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:21:24,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:21:24,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:21:24,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:21:24,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:21:24,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:21:24,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:21:24,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:21:24,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:21:24,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:21:24,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:21:24,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:21:24,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:21:24,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:21:24,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:21:24,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:21:24,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:21:24,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:21:24,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:21:24,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:21:24,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:21:24,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:21:24,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:21:24,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:21:24,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:21:24,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:21:24,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:21:24,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:21:24,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:21:24,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:21:24,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:21:24,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:21:24,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:21:24,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:21:24,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:21:24,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:21:24,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:21:24,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:21:24,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:21:24,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:21:24,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:21:24,770 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:21:24,796 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:21:24,797 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:21:24,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:21:24,802 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:21:24,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:21:24,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:21:24,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:21:24,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:21:24,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:21:24,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:21:24,804 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:21:24,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:21:24,805 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:21:24,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:21:24,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:21:24,806 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:21:24,806 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:21:24,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:21:24,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:21:24,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:21:24,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:21:24,807 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:21:24,807 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-11-07 05:21:25,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:21:25,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:21:25,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:21:25,280 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:21:25,280 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:21:25,281 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i [2020-11-07 05:21:25,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36acc1877/01e49bc8b65142a0807e4bd635950f5a/FLAG73e1d260d [2020-11-07 05:21:26,221 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:21:26,222 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i [2020-11-07 05:21:26,248 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36acc1877/01e49bc8b65142a0807e4bd635950f5a/FLAG73e1d260d [2020-11-07 05:21:26,454 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36acc1877/01e49bc8b65142a0807e4bd635950f5a [2020-11-07 05:21:26,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:21:26,469 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:21:26,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:21:26,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:21:26,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:21:26,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:21:26" (1/1) ... [2020-11-07 05:21:26,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626eb2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:26, skipping insertion in model container [2020-11-07 05:21:26,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:21:26" (1/1) ... [2020-11-07 05:21:26,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:21:26,554 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:21:26,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:21:26,904 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:21:27,008 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:21:27,125 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:21:27,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:27 WrapperNode [2020-11-07 05:21:27,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:21:27,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:21:27,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:21:27,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:21:27,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:27" (1/1) ... [2020-11-07 05:21:27,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:27" (1/1) ... [2020-11-07 05:21:27,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:27" (1/1) ... [2020-11-07 05:21:27,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:27" (1/1) ... [2020-11-07 05:21:27,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:27" (1/1) ... [2020-11-07 05:21:27,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:27" (1/1) ... [2020-11-07 05:21:27,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:27" (1/1) ... [2020-11-07 05:21:27,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:21:27,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:21:27,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:21:27,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:21:27,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:21:27,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:21:27,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:21:27,293 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-07 05:21:27,293 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-07 05:21:27,293 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:21:27,293 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-07 05:21:27,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2020-11-07 05:21:27,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2020-11-07 05:21:27,294 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2020-11-07 05:21:27,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2020-11-07 05:21:27,295 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2020-11-07 05:21:27,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2020-11-07 05:21:27,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2020-11-07 05:21:27,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2020-11-07 05:21:27,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_empty [2020-11-07 05:21:27,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_set [2020-11-07 05:21:27,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2020-11-07 05:21:27,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_del [2020-11-07 05:21:27,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2020-11-07 05:21:27,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_empty [2020-11-07 05:21:27,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2020-11-07 05:21:27,299 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2020-11-07 05:21:27,301 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2020-11-07 05:21:27,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2020-11-07 05:21:27,302 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2020-11-07 05:21:27,302 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:21:27,302 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-07 05:21:27,302 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-07 05:21:27,303 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-07 05:21:27,303 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-07 05:21:27,303 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-07 05:21:27,303 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-07 05:21:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-07 05:21:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-07 05:21:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-07 05:21:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-07 05:21:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-07 05:21:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-07 05:21:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-07 05:21:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-07 05:21:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-07 05:21:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-07 05:21:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-07 05:21:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-07 05:21:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-07 05:21:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-07 05:21:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-07 05:21:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-07 05:21:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-07 05:21:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-07 05:21:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-07 05:21:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-07 05:21:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-07 05:21:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-07 05:21:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-07 05:21:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-07 05:21:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-07 05:21:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-07 05:21:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-07 05:21:27,312 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-07 05:21:27,312 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-07 05:21:27,313 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-07 05:21:27,313 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-07 05:21:27,313 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-07 05:21:27,313 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-07 05:21:27,313 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-07 05:21:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-07 05:21:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-07 05:21:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-07 05:21:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-07 05:21:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-07 05:21:27,315 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-07 05:21:27,315 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-07 05:21:27,315 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-07 05:21:27,315 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-07 05:21:27,315 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-07 05:21:27,315 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-07 05:21:27,315 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-07 05:21:27,316 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-07 05:21:27,316 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-07 05:21:27,317 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-07 05:21:27,317 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-07 05:21:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-11-07 05:21:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-07 05:21:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-07 05:21:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-07 05:21:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:21:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-07 05:21:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-07 05:21:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-07 05:21:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-07 05:21:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-07 05:21:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-07 05:21:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-07 05:21:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-07 05:21:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-07 05:21:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-07 05:21:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-07 05:21:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-07 05:21:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-07 05:21:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-07 05:21:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-07 05:21:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-07 05:21:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-07 05:21:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-07 05:21:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-07 05:21:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-07 05:21:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-07 05:21:27,324 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-07 05:21:27,324 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-07 05:21:27,324 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-07 05:21:27,324 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-07 05:21:27,324 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-07 05:21:27,324 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-07 05:21:27,324 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-07 05:21:27,325 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-07 05:21:27,325 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-07 05:21:27,325 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-07 05:21:27,325 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-07 05:21:27,325 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-07 05:21:27,325 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-07 05:21:27,325 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-07 05:21:27,326 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-07 05:21:27,326 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-07 05:21:27,326 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-07 05:21:27,326 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-07 05:21:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-07 05:21:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-07 05:21:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:21:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-07 05:21:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-07 05:21:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:21:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:21:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-07 05:21:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:21:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2020-11-07 05:21:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-07 05:21:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2020-11-07 05:21:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2020-11-07 05:21:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-07 05:21:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2020-11-07 05:21:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2020-11-07 05:21:27,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2020-11-07 05:21:27,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-07 05:21:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2020-11-07 05:21:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2020-11-07 05:21:27,336 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_empty [2020-11-07 05:21:27,336 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_set [2020-11-07 05:21:27,336 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2020-11-07 05:21:27,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_del [2020-11-07 05:21:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2020-11-07 05:21:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_empty [2020-11-07 05:21:27,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:21:27,342 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2020-11-07 05:21:27,342 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2020-11-07 05:21:27,343 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2020-11-07 05:21:27,343 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2020-11-07 05:21:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2020-11-07 05:21:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:21:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:21:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:21:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-11-07 05:21:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:21:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:21:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:21:28,194 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:21:28,194 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-07 05:21:28,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:21:28 BoogieIcfgContainer [2020-11-07 05:21:28,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:21:28,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:21:28,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:21:28,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:21:28,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:21:26" (1/3) ... [2020-11-07 05:21:28,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2257532a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:21:28, skipping insertion in model container [2020-11-07 05:21:28,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:27" (2/3) ... [2020-11-07 05:21:28,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2257532a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:21:28, skipping insertion in model container [2020-11-07 05:21:28,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:21:28" (3/3) ... [2020-11-07 05:21:28,208 INFO L111 eAbstractionObserver]: Analyzing ICFG test_mutex_double_lock.i [2020-11-07 05:21:28,226 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:21:28,231 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:21:28,247 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:21:28,278 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:21:28,279 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:21:28,279 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:21:28,279 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:21:28,279 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:21:28,279 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:21:28,279 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:21:28,280 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:21:28,303 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2020-11-07 05:21:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-07 05:21:28,316 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:28,317 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2020-11-07 05:21:28,317 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:28,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:28,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1852376171, now seen corresponding path program 1 times [2020-11-07 05:21:28,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:28,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2051134161] [2020-11-07 05:21:28,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:28,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:28,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 05:21:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:28,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-07 05:21:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:28,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:21:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:28,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 05:21:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:28,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:21:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:28,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 05:21:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-07 05:21:28,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2051134161] [2020-11-07 05:21:28,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:21:28,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:21:28,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657960607] [2020-11-07 05:21:28,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:21:28,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:28,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:21:28,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:21:28,773 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 4 states. [2020-11-07 05:21:29,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:29,229 INFO L93 Difference]: Finished difference Result 373 states and 431 transitions. [2020-11-07 05:21:29,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:21:29,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-11-07 05:21:29,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:29,247 INFO L225 Difference]: With dead ends: 373 [2020-11-07 05:21:29,248 INFO L226 Difference]: Without dead ends: 192 [2020-11-07 05:21:29,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:21:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-11-07 05:21:29,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 172. [2020-11-07 05:21:29,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-11-07 05:21:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 184 transitions. [2020-11-07 05:21:29,357 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 184 transitions. Word has length 66 [2020-11-07 05:21:29,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:29,358 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 184 transitions. [2020-11-07 05:21:29,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:21:29,359 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 184 transitions. [2020-11-07 05:21:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-07 05:21:29,366 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:29,366 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2020-11-07 05:21:29,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:21:29,367 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:29,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:29,369 INFO L82 PathProgramCache]: Analyzing trace with hash 898138460, now seen corresponding path program 1 times [2020-11-07 05:21:29,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:29,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1454294334] [2020-11-07 05:21:29,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:29,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:29,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 05:21:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:29,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-07 05:21:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:29,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:21:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:29,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 05:21:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:29,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:21:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:29,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 05:21:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-07 05:21:29,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1454294334] [2020-11-07 05:21:29,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:21:29,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:21:29,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317435110] [2020-11-07 05:21:29,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:21:29,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:29,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:21:29,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:21:29,618 INFO L87 Difference]: Start difference. First operand 172 states and 184 transitions. Second operand 6 states. [2020-11-07 05:21:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:30,358 INFO L93 Difference]: Finished difference Result 201 states and 220 transitions. [2020-11-07 05:21:30,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 05:21:30,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-11-07 05:21:30,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:30,363 INFO L225 Difference]: With dead ends: 201 [2020-11-07 05:21:30,363 INFO L226 Difference]: Without dead ends: 196 [2020-11-07 05:21:30,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:21:30,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-11-07 05:21:30,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 176. [2020-11-07 05:21:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-11-07 05:21:30,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 190 transitions. [2020-11-07 05:21:30,408 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 190 transitions. Word has length 66 [2020-11-07 05:21:30,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:30,409 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 190 transitions. [2020-11-07 05:21:30,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:21:30,409 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 190 transitions. [2020-11-07 05:21:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-07 05:21:30,411 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:30,411 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:30,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:21:30,412 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:30,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:30,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1032759184, now seen corresponding path program 1 times [2020-11-07 05:21:30,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:30,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [434144558] [2020-11-07 05:21:30,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:30,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:30,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 05:21:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:30,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-07 05:21:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:30,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:21:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:30,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 05:21:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:30,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:21:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:30,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 05:21:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-07 05:21:30,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [434144558] [2020-11-07 05:21:30,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:21:30,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 05:21:30,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846353689] [2020-11-07 05:21:30,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:21:30,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:30,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:21:30,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:21:30,888 INFO L87 Difference]: Start difference. First operand 176 states and 190 transitions. Second operand 11 states. [2020-11-07 05:21:33,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:33,531 INFO L93 Difference]: Finished difference Result 499 states and 562 transitions. [2020-11-07 05:21:33,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 05:21:33,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2020-11-07 05:21:33,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:33,538 INFO L225 Difference]: With dead ends: 499 [2020-11-07 05:21:33,538 INFO L226 Difference]: Without dead ends: 348 [2020-11-07 05:21:33,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=216, Invalid=486, Unknown=0, NotChecked=0, Total=702 [2020-11-07 05:21:33,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2020-11-07 05:21:33,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 281. [2020-11-07 05:21:33,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2020-11-07 05:21:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 314 transitions. [2020-11-07 05:21:33,618 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 314 transitions. Word has length 69 [2020-11-07 05:21:33,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:33,619 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 314 transitions. [2020-11-07 05:21:33,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:21:33,620 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 314 transitions. [2020-11-07 05:21:33,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-11-07 05:21:33,627 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:33,628 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-11-07 05:21:33,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:21:33,628 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:33,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:33,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1557786990, now seen corresponding path program 1 times [2020-11-07 05:21:33,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:33,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2096498003] [2020-11-07 05:21:33,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:33,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:33,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 05:21:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:33,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-07 05:21:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:33,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:21:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:33,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 05:21:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:33,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:21:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:33,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:21:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:33,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:21:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:33,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 05:21:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:33,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:21:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:33,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-11-07 05:21:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:33,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:21:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:33,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 05:21:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:33,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:21:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:33,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 05:21:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2020-11-07 05:21:33,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2096498003] [2020-11-07 05:21:33,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:33,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:21:33,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011648407] [2020-11-07 05:21:33,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:21:33,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:33,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:21:33,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:21:33,920 INFO L87 Difference]: Start difference. First operand 281 states and 314 transitions. Second operand 7 states. [2020-11-07 05:21:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:34,813 INFO L93 Difference]: Finished difference Result 516 states and 576 transitions. [2020-11-07 05:21:34,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:21:34,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2020-11-07 05:21:34,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:34,823 INFO L225 Difference]: With dead ends: 516 [2020-11-07 05:21:34,824 INFO L226 Difference]: Without dead ends: 290 [2020-11-07 05:21:34,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:21:34,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-11-07 05:21:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2020-11-07 05:21:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2020-11-07 05:21:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 320 transitions. [2020-11-07 05:21:34,916 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 320 transitions. Word has length 144 [2020-11-07 05:21:34,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:34,920 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 320 transitions. [2020-11-07 05:21:34,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:21:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 320 transitions. [2020-11-07 05:21:34,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-11-07 05:21:34,930 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:34,930 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-11-07 05:21:34,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:21:34,931 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:34,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:34,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1819153246, now seen corresponding path program 1 times [2020-11-07 05:21:34,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:34,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [666200341] [2020-11-07 05:21:34,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:35,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:35,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 05:21:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:35,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-07 05:21:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:35,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:21:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:35,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 05:21:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:35,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:21:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:35,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:21:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:35,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:21:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:35,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 05:21:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:35,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:21:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:35,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 05:21:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:35,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:21:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:35,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 05:21:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:35,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:21:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:35,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-11-07 05:21:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-11-07 05:21:35,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [666200341] [2020-11-07 05:21:35,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:35,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 05:21:35,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138109513] [2020-11-07 05:21:35,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 05:21:35,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:35,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 05:21:35,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2020-11-07 05:21:35,695 INFO L87 Difference]: Start difference. First operand 287 states and 320 transitions. Second operand 22 states. [2020-11-07 05:21:43,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:43,824 INFO L93 Difference]: Finished difference Result 735 states and 814 transitions. [2020-11-07 05:21:43,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2020-11-07 05:21:43,825 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 150 [2020-11-07 05:21:43,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:43,829 INFO L225 Difference]: With dead ends: 735 [2020-11-07 05:21:43,829 INFO L226 Difference]: Without dead ends: 408 [2020-11-07 05:21:43,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1688 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1202, Invalid=4960, Unknown=0, NotChecked=0, Total=6162 [2020-11-07 05:21:43,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2020-11-07 05:21:43,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 293. [2020-11-07 05:21:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-11-07 05:21:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 318 transitions. [2020-11-07 05:21:43,924 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 318 transitions. Word has length 150 [2020-11-07 05:21:43,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:43,924 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 318 transitions. [2020-11-07 05:21:43,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 05:21:43,925 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 318 transitions. [2020-11-07 05:21:43,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-11-07 05:21:43,927 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:43,927 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:43,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:21:43,927 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:43,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:43,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1886257638, now seen corresponding path program 1 times [2020-11-07 05:21:43,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:43,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [841087186] [2020-11-07 05:21:43,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:21:43,966 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:21:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:21:43,999 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:21:44,057 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 05:21:44,058 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 05:21:44,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:21:44,104 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 59 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2020-11-07 05:21:44,105 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 57 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2020-11-07 05:21:44,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:21:44 BoogieIcfgContainer [2020-11-07 05:21:44,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:21:44,176 INFO L168 Benchmark]: Toolchain (without parser) took 17709.19 ms. Allocated memory was 172.0 MB in the beginning and 388.0 MB in the end (delta: 216.0 MB). Free memory was 146.0 MB in the beginning and 317.0 MB in the end (delta: -171.0 MB). Peak memory consumption was 45.8 MB. Max. memory is 8.0 GB. [2020-11-07 05:21:44,178 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 172.0 MB. Free memory is still 144.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:21:44,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 652.06 ms. Allocated memory is still 172.0 MB. Free memory was 145.4 MB in the beginning and 151.8 MB in the end (delta: -6.5 MB). Peak memory consumption was 31.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:21:44,183 INFO L168 Benchmark]: Boogie Preprocessor took 81.44 ms. Allocated memory is still 172.0 MB. Free memory was 151.8 MB in the beginning and 148.1 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:21:44,187 INFO L168 Benchmark]: RCFGBuilder took 987.45 ms. Allocated memory was 172.0 MB in the beginning and 212.9 MB in the end (delta: 40.9 MB). Free memory was 148.1 MB in the beginning and 177.2 MB in the end (delta: -29.1 MB). Peak memory consumption was 53.8 MB. Max. memory is 8.0 GB. [2020-11-07 05:21:44,188 INFO L168 Benchmark]: TraceAbstraction took 15973.20 ms. Allocated memory was 212.9 MB in the beginning and 388.0 MB in the end (delta: 175.1 MB). Free memory was 177.2 MB in the beginning and 317.0 MB in the end (delta: -139.8 MB). Peak memory consumption was 35.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:21:44,195 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 172.0 MB. Free memory is still 144.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 652.06 ms. Allocated memory is still 172.0 MB. Free memory was 145.4 MB in the beginning and 151.8 MB in the end (delta: -6.5 MB). Peak memory consumption was 31.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 81.44 ms. Allocated memory is still 172.0 MB. Free memory was 151.8 MB in the beginning and 148.1 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 987.45 ms. Allocated memory was 172.0 MB in the beginning and 212.9 MB in the end (delta: 40.9 MB). Free memory was 148.1 MB in the beginning and 177.2 MB in the end (delta: -29.1 MB). Peak memory consumption was 53.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 15973.20 ms. Allocated memory was 212.9 MB in the beginning and 388.0 MB in the end (delta: 175.1 MB). Free memory was 177.2 MB in the beginning and 317.0 MB in the end (delta: -139.8 MB). Peak memory consumption was 35.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 59 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 57 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 562]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L665] struct ldv_list_head mutexes = { &(mutexes), &(mutexes) }; VAL [\old(mutexes)=null, \old(mutexes)=null, mutexes={3:0}] [L692] CALL foo() VAL [mutexes={3:0}] [L681] FCALL ldv_initialize() VAL [mutexes={3:0}] [L682] CALL, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [\old(size)=8, mutexes={3:0}] [L576] void *ptr = malloc(size); VAL [\old(size)=8, malloc(size)={-1:0}, mutexes={3:0}, ptr={-1:0}, size=8] [L577] CALL assume_abort_if_not(ptr!=0) VAL [\old(cond)=1, mutexes={3:0}] [L565] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) VAL [\old(size)=8, malloc(size)={-1:0}, mutexes={3:0}, ptr={-1:0}, size=8] [L578] return ptr; VAL [\old(size)=8, \result={-1:0}, malloc(size)={-1:0}, mutexes={3:0}, ptr={-1:0}, size=8] [L682] RET, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [ldv_successful_malloc(sizeof(struct mutex))={-1:0}, mutexes={3:0}] [L682] struct mutex *m1 = ldv_successful_malloc(sizeof(struct mutex)); VAL [ldv_successful_malloc(sizeof(struct mutex))={-1:0}, m1={-1:0}, mutexes={3:0}] [L683] CALL, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [\old(size)=8, mutexes={3:0}] [L576] void *ptr = malloc(size); VAL [\old(size)=8, malloc(size)={-2:0}, mutexes={3:0}, ptr={-2:0}, size=8] [L577] CALL assume_abort_if_not(ptr!=0) VAL [\old(cond)=1, mutexes={3:0}] [L565] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) VAL [\old(size)=8, malloc(size)={-2:0}, mutexes={3:0}, ptr={-2:0}, size=8] [L578] return ptr; VAL [\old(size)=8, \result={-2:0}, malloc(size)={-2:0}, mutexes={3:0}, ptr={-2:0}, size=8] [L683] RET, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [ldv_successful_malloc(sizeof(struct mutex))={-2:0}, m1={-1:0}, mutexes={3:0}] [L683] struct mutex *m2 = ldv_successful_malloc(sizeof(struct mutex)); VAL [ldv_successful_malloc(sizeof(struct mutex))={-2:0}, m1={-1:0}, m2={-2:0}, mutexes={3:0}] [L684] CALL mutex_lock(m1) VAL [m={-1:0}, mutexes={3:0}] [L669] CALL ldv_is_in_set(m, &mutexes) VAL [e={-1:0}, mutexes={3:0}, s={3:0}] [L654] struct ldv_list_element *m; VAL [e={-1:0}, e={-1:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L655] EXPR (s)->next VAL [(s)->next={3:0}, e={-1:0}, e={-1:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L655] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); VAL [(s)->next={3:0}, __mptr={3:0}, e={-1:0}, e={-1:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L655] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [__mptr={3:0}, e={-1:0}, e={-1:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L655] COND FALSE !(&m->list != (s)) VAL [__mptr={3:0}, e={-1:0}, e={-1:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L660] return 0; VAL [\result=0, __mptr={3:0}, e={-1:0}, e={-1:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L669] RET ldv_is_in_set(m, &mutexes) VAL [ldv_is_in_set(m, &mutexes)=0, m={-1:0}, m={-1:0}, mutexes={3:0}] [L669] COND FALSE !(ldv_is_in_set(m, &mutexes)) VAL [ldv_is_in_set(m, &mutexes)=0, m={-1:0}, m={-1:0}, mutexes={3:0}] [L670] CALL ldv_set_add(m, &mutexes) VAL [mutexes={3:0}, new={-1:0}, s={3:0}] [L636] CALL, EXPR ldv_is_in_set(new, s) VAL [e={-1:0}, mutexes={3:0}, s={3:0}] [L654] struct ldv_list_element *m; VAL [e={-1:0}, e={-1:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L655] EXPR (s)->next VAL [(s)->next={3:0}, e={-1:0}, e={-1:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L655] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); VAL [(s)->next={3:0}, __mptr={3:0}, e={-1:0}, e={-1:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L655] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [__mptr={3:0}, e={-1:0}, e={-1:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L655] COND FALSE !(&m->list != (s)) VAL [__mptr={3:0}, e={-1:0}, e={-1:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L660] return 0; VAL [\result=0, __mptr={3:0}, e={-1:0}, e={-1:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L636] RET, EXPR ldv_is_in_set(new, s) VAL [ldv_is_in_set(new, s)=0, mutexes={3:0}, new={-1:0}, new={-1:0}, s={3:0}, s={3:0}] [L636] COND TRUE !ldv_is_in_set(new, s) VAL [ldv_is_in_set(new, s)=0, mutexes={3:0}, new={-1:0}, new={-1:0}, s={3:0}, s={3:0}] [L637] struct ldv_list_element *le; VAL [mutexes={3:0}, new={-1:0}, new={-1:0}, s={3:0}, s={3:0}] [L638] CALL, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) VAL [\old(size)=12, mutexes={3:0}] [L576] void *ptr = malloc(size); VAL [\old(size)=12, malloc(size)={-3:0}, mutexes={3:0}, ptr={-3:0}, size=12] [L577] CALL assume_abort_if_not(ptr!=0) VAL [\old(cond)=1, mutexes={3:0}] [L565] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) VAL [\old(size)=12, malloc(size)={-3:0}, mutexes={3:0}, ptr={-3:0}, size=12] [L578] return ptr; VAL [\old(size)=12, \result={-3:0}, malloc(size)={-3:0}, mutexes={3:0}, ptr={-3:0}, size=12] [L638] RET, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) VAL [ldv_successful_malloc(sizeof(struct ldv_list_element))={-3:0}, mutexes={3:0}, new={-1:0}, new={-1:0}, s={3:0}, s={3:0}] [L638] le = (struct ldv_list_element*)ldv_successful_malloc(sizeof(struct ldv_list_element)) VAL [ldv_successful_malloc(sizeof(struct ldv_list_element))={-3:0}, le={-3:0}, mutexes={3:0}, new={-1:0}, new={-1:0}, s={3:0}, s={3:0}] [L639] le->e = new VAL [le={-3:0}, mutexes={3:0}, new={-1:0}, new={-1:0}, s={3:0}, s={3:0}] [L640] CALL ldv_list_add(&le->list, s) VAL [head={3:0}, mutexes={3:0}, new={-3:4}] [L608] EXPR head->next VAL [head={3:0}, head={3:0}, head->next={3:0}, mutexes={3:0}, new={-3:4}, new={-3:4}] [L608] CALL __ldv_list_add(new, head, head->next) VAL [mutexes={3:0}, new={-3:4}, next={3:0}, prev={3:0}] [L596] next->prev = new VAL [mutexes={3:0}, new={-3:4}, new={-3:4}, next={3:0}, next={3:0}, prev={3:0}, prev={3:0}] [L597] new->next = next VAL [mutexes={3:0}, new={-3:4}, new={-3:4}, next={3:0}, next={3:0}, prev={3:0}, prev={3:0}] [L598] new->prev = prev VAL [mutexes={3:0}, new={-3:4}, new={-3:4}, next={3:0}, next={3:0}, prev={3:0}, prev={3:0}] [L599] prev->next = new VAL [mutexes={3:0}, new={-3:4}, new={-3:4}, next={3:0}, next={3:0}, prev={3:0}, prev={3:0}] [L608] RET __ldv_list_add(new, head, head->next) VAL [head={3:0}, head={3:0}, head->next={3:0}, mutexes={3:0}, new={-3:4}, new={-3:4}] [L640] RET ldv_list_add(&le->list, s) VAL [le={-3:0}, mutexes={3:0}, new={-1:0}, new={-1:0}, s={3:0}, s={3:0}] [L670] RET ldv_set_add(m, &mutexes) VAL [m={-1:0}, m={-1:0}, mutexes={3:0}] [L684] RET mutex_lock(m1) VAL [m1={-1:0}, m2={-2:0}, mutexes={3:0}] [L685] CALL mutex_lock(m1) VAL [m={-1:0}, mutexes={3:0}] [L669] CALL ldv_is_in_set(m, &mutexes) VAL [e={-1:0}, mutexes={3:0}, s={3:0}] [L654] struct ldv_list_element *m; VAL [e={-1:0}, e={-1:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L655] EXPR (s)->next VAL [(s)->next={-3:4}, e={-1:0}, e={-1:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L655] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); VAL [(s)->next={-3:4}, __mptr={-3:4}, e={-1:0}, e={-1:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L655] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [__mptr={-3:4}, e={-1:0}, e={-1:0}, m={-3:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L655] COND TRUE &m->list != (s) VAL [__mptr={-3:4}, e={-1:0}, e={-1:0}, m={-3:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L656] EXPR m->e VAL [__mptr={-3:4}, e={-1:0}, e={-1:0}, m={-3:0}, m->e={-1:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L656] COND TRUE m->e == e VAL [__mptr={-3:4}, e={-1:0}, e={-1:0}, m={-3:0}, m->e={-1:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L657] return 1; VAL [\result=1, __mptr={-3:4}, e={-1:0}, e={-1:0}, m={-3:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L669] RET ldv_is_in_set(m, &mutexes) VAL [ldv_is_in_set(m, &mutexes)=1, m={-1:0}, m={-1:0}, mutexes={3:0}] [L669] COND TRUE ldv_is_in_set(m, &mutexes) VAL [ldv_is_in_set(m, &mutexes)=1, m={-1:0}, m={-1:0}, mutexes={3:0}] [L669] CALL reach_error() VAL [mutexes={3:0}] [L562] COND FALSE !(0) VAL [mutexes={3:0}] [L562] __assert_fail ("0", "model/ldv.h", 3, __extension__ __PRETTY_FUNCTION__) VAL [mutexes={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 26 procedures, 225 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.7s, OverallIterations: 6, TraceHistogramMax: 5, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 899 SDtfs, 2375 SDslu, 677 SDs, 0 SdLazy, 4867 SolverSat, 637 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1818 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=293occurred in iteration=5, 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, 5 MinimizatonAttempts, 225 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 636 NumberOfCodeBlocks, 636 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 490 ConstructedInterpolants, 0 QuantifiedInterpolants, 210046 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 221/304 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...