java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/mutex_lock_struct_true-termination.c_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:53:36,067 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:53:36,069 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:53:36,089 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:53:36,090 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:53:36,093 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:53:36,095 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:53:36,099 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:53:36,101 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:53:36,103 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:53:36,105 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:53:36,106 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:53:36,107 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:53:36,108 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:53:36,112 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:53:36,113 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:53:36,114 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:53:36,117 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:53:36,127 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:53:36,130 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:53:36,135 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:53:36,136 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:53:36,143 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:53:36,144 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:53:36,144 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:53:36,146 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:53:36,147 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:53:36,150 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:53:36,151 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:53:36,155 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:53:36,155 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:53:36,157 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:53:36,157 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:53:36,158 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:53:36,159 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:53:36,159 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:53:36,160 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:53:36,187 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:53:36,188 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:53:36,188 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:53:36,189 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:53:36,190 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:53:36,190 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:53:36,191 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:53:36,191 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:53:36,191 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:53:36,191 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:53:36,191 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:53:36,193 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:53:36,193 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:53:36,193 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:53:36,193 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:53:36,193 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:53:36,194 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:53:36,194 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:53:36,194 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:53:36,194 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:53:36,194 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:53:36,194 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:53:36,196 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:53:36,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:53:36,197 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:53:36,197 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:53:36,197 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:53:36,197 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:53:36,197 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:53:36,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:53:36,198 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:53:36,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:53:36,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:53:36,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:53:36,285 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:53:36,286 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:53:36,287 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/mutex_lock_struct_true-termination.c_false-unreach-call.i [2018-11-23 12:53:36,354 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72647bd82/251e19dcd89e4eb8abe511324a2b2afd/FLAGbb3421792 [2018-11-23 12:53:36,860 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:53:36,861 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/mutex_lock_struct_true-termination.c_false-unreach-call.i [2018-11-23 12:53:36,867 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72647bd82/251e19dcd89e4eb8abe511324a2b2afd/FLAGbb3421792 [2018-11-23 12:53:37,208 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72647bd82/251e19dcd89e4eb8abe511324a2b2afd [2018-11-23 12:53:37,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:53:37,220 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:53:37,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:37,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:53:37,225 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:53:37,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:37" (1/1) ... [2018-11-23 12:53:37,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4244bc19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:37, skipping insertion in model container [2018-11-23 12:53:37,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:37" (1/1) ... [2018-11-23 12:53:37,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:53:37,264 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:53:37,473 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:37,489 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:53:37,512 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:37,542 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:53:37,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:37 WrapperNode [2018-11-23 12:53:37,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:37,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:37,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:53:37,544 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:53:37,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:37" (1/1) ... [2018-11-23 12:53:37,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:37" (1/1) ... [2018-11-23 12:53:37,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:37,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:53:37,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:53:37,576 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:53:37,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:37" (1/1) ... [2018-11-23 12:53:37,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:37" (1/1) ... [2018-11-23 12:53:37,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:37" (1/1) ... [2018-11-23 12:53:37,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:37" (1/1) ... [2018-11-23 12:53:37,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:37" (1/1) ... [2018-11-23 12:53:37,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:37" (1/1) ... [2018-11-23 12:53:37,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:37" (1/1) ... [2018-11-23 12:53:37,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:53:37,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:53:37,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:53:37,613 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:53:37,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:37" (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 [2018-11-23 12:53:37,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:53:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:53:37,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:53:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:53:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure err [2018-11-23 12:53:37,784 INFO L138 BoogieDeclarations]: Found implementation of procedure err [2018-11-23 12:53:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2018-11-23 12:53:37,785 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2018-11-23 12:53:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:53:37,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:53:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:53:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:53:37,786 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:53:37,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:53:38,220 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:53:38,221 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:53:38,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:38 BoogieIcfgContainer [2018-11-23 12:53:38,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:53:38,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:53:38,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:53:38,226 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:53:38,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:53:37" (1/3) ... [2018-11-23 12:53:38,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7729bd5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:38, skipping insertion in model container [2018-11-23 12:53:38,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:37" (2/3) ... [2018-11-23 12:53:38,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7729bd5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:38, skipping insertion in model container [2018-11-23 12:53:38,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:38" (3/3) ... [2018-11-23 12:53:38,230 INFO L112 eAbstractionObserver]: Analyzing ICFG mutex_lock_struct_true-termination.c_false-unreach-call.i [2018-11-23 12:53:38,241 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:53:38,250 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:53:38,268 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:53:38,303 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:53:38,304 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:53:38,304 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:53:38,304 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:53:38,305 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:53:38,305 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:53:38,305 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:53:38,305 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:53:38,305 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:53:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 12:53:38,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 12:53:38,348 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:38,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:38,356 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:38,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:38,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1740940083, now seen corresponding path program 1 times [2018-11-23 12:53:38,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:38,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:38,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:38,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:38,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:38,672 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-23 12:53:38,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26#true} is VALID [2018-11-23 12:53:38,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-23 12:53:38,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #26#return; {26#true} is VALID [2018-11-23 12:53:38,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret2 := main(); {26#true} is VALID [2018-11-23 12:53:38,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4);call write~int(0, ~#m~0.base, ~#m~0.offset, 4); {28#(= 0 (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|))} is VALID [2018-11-23 12:53:38,699 INFO L256 TraceCheckUtils]: 6: Hoare triple {28#(= 0 (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|))} call mutex_lock(~#m~0.base, ~#m~0.offset); {29#(= 0 (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|))} is VALID [2018-11-23 12:53:38,709 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#(= 0 (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem0 := read~int(~a.base, ~a.offset, 4); {30#(= 0 |mutex_lock_#t~mem0|)} is VALID [2018-11-23 12:53:38,720 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#(= 0 |mutex_lock_#t~mem0|)} assume 1 == #t~mem0;havoc #t~mem0; {27#false} is VALID [2018-11-23 12:53:38,721 INFO L256 TraceCheckUtils]: 9: Hoare triple {27#false} call err(); {27#false} is VALID [2018-11-23 12:53:38,721 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-23 12:53:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:38,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:38,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:53:38,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 12:53:38,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:38,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:53:38,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:38,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:53:38,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:53:38,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:53:38,847 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-11-23 12:53:39,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:39,346 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-23 12:53:39,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:53:39,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 12:53:39,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:53:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-23 12:53:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:53:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-23 12:53:39,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2018-11-23 12:53:39,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:39,603 INFO L225 Difference]: With dead ends: 40 [2018-11-23 12:53:39,604 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 12:53:39,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:53:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 12:53:39,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 12:53:39,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:39,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 12:53:39,661 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 12:53:39,661 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 12:53:39,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:39,665 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2018-11-23 12:53:39,665 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2018-11-23 12:53:39,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:39,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:39,667 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 12:53:39,667 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 12:53:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:39,670 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2018-11-23 12:53:39,671 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2018-11-23 12:53:39,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:39,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:39,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:39,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:53:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2018-11-23 12:53:39,676 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 11 [2018-11-23 12:53:39,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:39,677 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2018-11-23 12:53:39,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:53:39,677 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2018-11-23 12:53:39,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:53:39,678 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:39,678 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:39,679 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:39,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:39,680 INFO L82 PathProgramCache]: Analyzing trace with hash 68232763, now seen corresponding path program 1 times [2018-11-23 12:53:39,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:39,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:39,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:39,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:39,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:53:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:53:39,740 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=7, |#NULL.offset|=5, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] RET #26#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret2 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4);call write~int(0, ~#m~0.base, ~#m~0.offset, 4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#m~0.base|=6, |main_~#m~0.offset|=0] [?] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] ~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0, |mutex_lock_#t~mem0|=0] [?] assume !(1 == #t~mem0);havoc #t~mem0; VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] call write~int(1, ~a.base, ~a.offset, 4); VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] assume true; VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] RET #30#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#m~0.base|=6, |main_~#m~0.offset|=0] [?] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] ~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0, |mutex_lock_#t~mem0|=1] [?] assume 1 == #t~mem0;havoc #t~mem0; VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] CALL call err(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L33] call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4); [L34] call write~int(0, ~#m~0.base, ~#m~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#m~0.base=6, ~#m~0.offset=0] [L36] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=0, ~a.base=6, ~a.offset=0] [L21] assume !(1 == #t~mem0); [L21] havoc #t~mem0; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L22] call write~int(1, ~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L19-L23] ensures true; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L36] RET call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#m~0.base=6, ~#m~0.offset=0] [L40] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=1, ~a.base=6, ~a.offset=0] [L21] assume 1 == #t~mem0; [L21] havoc #t~mem0; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L21] CALL call err(); VAL [#NULL.base=0, #NULL.offset=0] [L13] assert false; VAL [#NULL.base=0, #NULL.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L33] call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4); [L34] call write~int(0, ~#m~0.base, ~#m~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#m~0.base=6, ~#m~0.offset=0] [L36] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=0, ~a.base=6, ~a.offset=0] [L21] assume !(1 == #t~mem0); [L21] havoc #t~mem0; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L22] call write~int(1, ~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L19-L23] ensures true; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L36] RET call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#m~0.base=6, ~#m~0.offset=0] [L40] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=1, ~a.base=6, ~a.offset=0] [L21] assume 1 == #t~mem0; [L21] havoc #t~mem0; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L21] CALL call err(); VAL [#NULL.base=0, #NULL.offset=0] [L13] assert false; VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4); [L34] FCALL call write~int(0, { base: ~#m~0!base, offset: ~#m~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=0, ~a!base=6, ~a!offset=0] [L21] COND FALSE !(1 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L22] FCALL call write~int(1, { base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~a!base=6, ~a!offset=0] [L21] COND TRUE 1 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L21] CALL call err(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4); [L34] FCALL call write~int(0, { base: ~#m~0!base, offset: ~#m~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=0, ~a!base=6, ~a!offset=0] [L21] COND FALSE !(1 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L22] FCALL call write~int(1, { base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~a!base=6, ~a!offset=0] [L21] COND TRUE 1 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L21] CALL call err(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assert false; VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4); [L34] FCALL call write~int(0, { base: ~#m~0!base, offset: ~#m~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=0, ~a!base=6, ~a!offset=0] [L21] COND FALSE !(1 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L22] FCALL call write~int(1, { base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~a!base=6, ~a!offset=0] [L21] COND TRUE 1 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L21] CALL call err(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4); [L34] FCALL call write~int(0, { base: ~#m~0!base, offset: ~#m~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=0, ~a!base=6, ~a!offset=0] [L21] COND FALSE !(1 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L22] FCALL call write~int(1, { base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~a!base=6, ~a!offset=0] [L21] COND TRUE 1 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L21] CALL call err(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L33] struct mutex m; [L34] m.is_locked = 0 VAL [m={6:0}] [L36] CALL mutex_lock(&m) VAL [a={6:0}] [L21] EXPR a->is_locked VAL [a={6:0}, a={6:0}, a->is_locked=0] [L21] COND FALSE !(a->is_locked == 1) [L22] a->is_locked = 1 VAL [a={6:0}, a={6:0}] [L36] RET mutex_lock(&m) VAL [m={6:0}] [L40] CALL mutex_lock(&m) VAL [a={6:0}] [L21] EXPR a->is_locked VAL [a={6:0}, a={6:0}, a->is_locked=1] [L21] COND TRUE a->is_locked == 1 [L21] CALL err() [L13] __VERIFIER_error() ----- [2018-11-23 12:53:39,787 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:53:39,788 WARN L170 areAnnotationChecker]: errENTRY has no Hoare annotation [2018-11-23 12:53:39,788 WARN L170 areAnnotationChecker]: errENTRY has no Hoare annotation [2018-11-23 12:53:39,788 WARN L170 areAnnotationChecker]: mutex_lockENTRY has no Hoare annotation [2018-11-23 12:53:39,788 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:53:39,788 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:53:39,788 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:53:39,789 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:53:39,789 WARN L170 areAnnotationChecker]: errFINAL has no Hoare annotation [2018-11-23 12:53:39,789 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 12:53:39,789 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 12:53:39,789 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:53:39,789 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:53:39,790 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2018-11-23 12:53:39,790 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2018-11-23 12:53:39,790 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:53:39,790 WARN L170 areAnnotationChecker]: errEXIT has no Hoare annotation [2018-11-23 12:53:39,790 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-23 12:53:39,790 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-23 12:53:39,790 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2018-11-23 12:53:39,790 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:53:39,791 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2018-11-23 12:53:39,791 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2018-11-23 12:53:39,791 WARN L170 areAnnotationChecker]: mutex_lockFINAL has no Hoare annotation [2018-11-23 12:53:39,791 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-23 12:53:39,791 WARN L170 areAnnotationChecker]: mutex_lockEXIT has no Hoare annotation [2018-11-23 12:53:39,791 WARN L170 areAnnotationChecker]: mutex_lockEXIT has no Hoare annotation [2018-11-23 12:53:39,791 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:53:39,792 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:53:39,792 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:53:39,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:53:39 BoogieIcfgContainer [2018-11-23 12:53:39,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:53:39,795 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:53:39,795 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:53:39,795 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:53:39,796 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:38" (3/4) ... [2018-11-23 12:53:39,799 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=7, |#NULL.offset|=5, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] RET #26#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret2 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4);call write~int(0, ~#m~0.base, ~#m~0.offset, 4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#m~0.base|=6, |main_~#m~0.offset|=0] [?] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] ~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0, |mutex_lock_#t~mem0|=0] [?] assume !(1 == #t~mem0);havoc #t~mem0; VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] call write~int(1, ~a.base, ~a.offset, 4); VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] assume true; VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] RET #30#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#m~0.base|=6, |main_~#m~0.offset|=0] [?] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] ~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0, |mutex_lock_#t~mem0|=1] [?] assume 1 == #t~mem0;havoc #t~mem0; VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] CALL call err(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L33] call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4); [L34] call write~int(0, ~#m~0.base, ~#m~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#m~0.base=6, ~#m~0.offset=0] [L36] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=0, ~a.base=6, ~a.offset=0] [L21] assume !(1 == #t~mem0); [L21] havoc #t~mem0; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L22] call write~int(1, ~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L19-L23] ensures true; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L36] RET call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#m~0.base=6, ~#m~0.offset=0] [L40] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=1, ~a.base=6, ~a.offset=0] [L21] assume 1 == #t~mem0; [L21] havoc #t~mem0; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L21] CALL call err(); VAL [#NULL.base=0, #NULL.offset=0] [L13] assert false; VAL [#NULL.base=0, #NULL.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L33] call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4); [L34] call write~int(0, ~#m~0.base, ~#m~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#m~0.base=6, ~#m~0.offset=0] [L36] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=0, ~a.base=6, ~a.offset=0] [L21] assume !(1 == #t~mem0); [L21] havoc #t~mem0; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L22] call write~int(1, ~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L19-L23] ensures true; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L36] RET call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#m~0.base=6, ~#m~0.offset=0] [L40] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=1, ~a.base=6, ~a.offset=0] [L21] assume 1 == #t~mem0; [L21] havoc #t~mem0; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L21] CALL call err(); VAL [#NULL.base=0, #NULL.offset=0] [L13] assert false; VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4); [L34] FCALL call write~int(0, { base: ~#m~0!base, offset: ~#m~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=0, ~a!base=6, ~a!offset=0] [L21] COND FALSE !(1 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L22] FCALL call write~int(1, { base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~a!base=6, ~a!offset=0] [L21] COND TRUE 1 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L21] CALL call err(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4); [L34] FCALL call write~int(0, { base: ~#m~0!base, offset: ~#m~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=0, ~a!base=6, ~a!offset=0] [L21] COND FALSE !(1 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L22] FCALL call write~int(1, { base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~a!base=6, ~a!offset=0] [L21] COND TRUE 1 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L21] CALL call err(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assert false; VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4); [L34] FCALL call write~int(0, { base: ~#m~0!base, offset: ~#m~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=0, ~a!base=6, ~a!offset=0] [L21] COND FALSE !(1 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L22] FCALL call write~int(1, { base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~a!base=6, ~a!offset=0] [L21] COND TRUE 1 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L21] CALL call err(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4); [L34] FCALL call write~int(0, { base: ~#m~0!base, offset: ~#m~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=0, ~a!base=6, ~a!offset=0] [L21] COND FALSE !(1 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L22] FCALL call write~int(1, { base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~a!base=6, ~a!offset=0] [L21] COND TRUE 1 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L21] CALL call err(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L33] struct mutex m; [L34] m.is_locked = 0 VAL [m={6:0}] [L36] CALL mutex_lock(&m) VAL [a={6:0}] [L21] EXPR a->is_locked VAL [a={6:0}, a={6:0}, a->is_locked=0] [L21] COND FALSE !(a->is_locked == 1) [L22] a->is_locked = 1 VAL [a={6:0}, a={6:0}] [L36] RET mutex_lock(&m) VAL [m={6:0}] [L40] CALL mutex_lock(&m) VAL [a={6:0}] [L21] EXPR a->is_locked VAL [a={6:0}, a={6:0}, a->is_locked=1] [L21] COND TRUE a->is_locked == 1 [L21] CALL err() [L13] __VERIFIER_error() ----- [2018-11-23 12:53:39,862 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/mutex_lock_struct_true-termination.c_false-unreach-call.i-witness.graphml [2018-11-23 12:53:39,862 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:53:39,864 INFO L168 Benchmark]: Toolchain (without parser) took 2644.79 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -695.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:39,865 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:53:39,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:39,867 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:53:39,867 INFO L168 Benchmark]: Boogie Preprocessor took 35.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:53:39,868 INFO L168 Benchmark]: RCFGBuilder took 609.16 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.0 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:39,869 INFO L168 Benchmark]: TraceAbstraction took 1572.23 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 68.0 MB). Peak memory consumption was 68.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:39,870 INFO L168 Benchmark]: Witness Printer took 67.39 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:53:39,874 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 322.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 32.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 609.16 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.0 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1572.23 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 68.0 MB). Peak memory consumption was 68.0 MB. Max. memory is 7.1 GB. * Witness Printer took 67.39 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L33] struct mutex m; [L34] m.is_locked = 0 VAL [m={6:0}] [L36] CALL mutex_lock(&m) VAL [a={6:0}] [L21] EXPR a->is_locked VAL [a={6:0}, a={6:0}, a->is_locked=0] [L21] COND FALSE !(a->is_locked == 1) [L22] a->is_locked = 1 VAL [a={6:0}, a={6:0}] [L36] RET mutex_lock(&m) VAL [m={6:0}] [L40] CALL mutex_lock(&m) VAL [a={6:0}] [L21] EXPR a->is_locked VAL [a={6:0}, a={6:0}, a->is_locked=1] [L21] COND TRUE a->is_locked == 1 [L21] CALL err() [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. UNSAFE Result, 1.4s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 1 SDslu, 47 SDs, 0 SdLazy, 17 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...