./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/lazy01.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/lazy01.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ab0d24246c157035db17326bff34412824264885 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:56:24,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:56:24,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:56:24,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:56:24,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:56:24,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:56:24,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:56:24,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:56:24,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:56:24,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:56:24,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:56:24,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:56:24,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:56:24,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:56:24,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:56:24,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:56:24,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:56:24,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:56:24,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:56:24,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:56:24,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:56:24,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:56:24,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:56:24,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:56:24,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:56:24,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:56:24,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:56:24,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:56:24,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:56:24,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:56:24,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:56:24,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:56:24,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:56:24,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:56:24,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:56:24,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:56:24,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:56:24,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:56:24,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:56:24,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:56:24,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:56:24,396 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:56:24,432 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:56:24,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:56:24,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:56:24,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:56:24,434 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:56:24,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:56:24,435 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:56:24,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:56:24,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:56:24,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:56:24,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:56:24,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:56:24,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:56:24,437 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:56:24,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:56:24,438 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:56:24,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:56:24,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:56:24,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:56:24,439 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:56:24,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:56:24,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:56:24,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:56:24,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:56:24,440 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:56:24,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:56:24,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:56:24,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:56:24,441 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:56:24,442 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ab0d24246c157035db17326bff34412824264885 [2019-11-28 17:56:24,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:56:24,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:56:24,778 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:56:24,780 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:56:24,780 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:56:24,783 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/lazy01.i [2019-11-28 17:56:24,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/829154a65/432837ba6e4f454d8d62381ab85dc382/FLAG684c6b087 [2019-11-28 17:56:25,388 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:56:25,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/lazy01.i [2019-11-28 17:56:25,402 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/829154a65/432837ba6e4f454d8d62381ab85dc382/FLAG684c6b087 [2019-11-28 17:56:25,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/829154a65/432837ba6e4f454d8d62381ab85dc382 [2019-11-28 17:56:25,723 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:56:25,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:56:25,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:56:25,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:56:25,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:56:25,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:56:25" (1/1) ... [2019-11-28 17:56:25,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27020a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:25, skipping insertion in model container [2019-11-28 17:56:25,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:56:25" (1/1) ... [2019-11-28 17:56:25,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:56:25,792 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:56:26,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:56:26,279 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:56:26,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:56:26,446 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:56:26,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:26 WrapperNode [2019-11-28 17:56:26,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:56:26,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:56:26,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:56:26,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:56:26,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:26" (1/1) ... [2019-11-28 17:56:26,473 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:26" (1/1) ... [2019-11-28 17:56:26,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:56:26,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:56:26,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:56:26,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:56:26,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:26" (1/1) ... [2019-11-28 17:56:26,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:26" (1/1) ... [2019-11-28 17:56:26,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:26" (1/1) ... [2019-11-28 17:56:26,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:26" (1/1) ... [2019-11-28 17:56:26,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:26" (1/1) ... [2019-11-28 17:56:26,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:26" (1/1) ... [2019-11-28 17:56:26,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:26" (1/1) ... [2019-11-28 17:56:26,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:56:26,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:56:26,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:56:26,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:56:26,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:26" (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 [2019-11-28 17:56:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 17:56:26,597 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2019-11-28 17:56:26,597 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2019-11-28 17:56:26,598 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2019-11-28 17:56:26,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2019-11-28 17:56:26,599 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2019-11-28 17:56:26,599 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2019-11-28 17:56:26,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 17:56:26,599 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-11-28 17:56:26,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:56:26,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 17:56:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:56:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:56:26,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:56:26,603 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 17:56:26,993 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:56:26,993 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 17:56:26,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:56:26 BoogieIcfgContainer [2019-11-28 17:56:26,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:56:26,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:56:26,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:56:27,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:56:27,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:56:25" (1/3) ... [2019-11-28 17:56:27,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f83e180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:56:27, skipping insertion in model container [2019-11-28 17:56:27,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:26" (2/3) ... [2019-11-28 17:56:27,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f83e180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:56:27, skipping insertion in model container [2019-11-28 17:56:27,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:56:26" (3/3) ... [2019-11-28 17:56:27,004 INFO L109 eAbstractionObserver]: Analyzing ICFG lazy01.i [2019-11-28 17:56:27,014 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 17:56:27,015 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:56:27,023 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:56:27,024 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 17:56:27,054 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,055 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,055 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,055 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,056 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,056 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,057 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,057 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,057 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,058 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,058 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,059 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,059 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,059 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,059 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,060 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,060 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,061 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,061 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,062 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,062 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,062 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,063 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,063 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,064 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,065 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,065 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:56:27,131 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 17:56:27,148 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:56:27,148 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:56:27,149 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:56:27,149 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:56:27,149 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:56:27,149 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:56:27,149 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:56:27,149 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:56:27,164 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 78 transitions [2019-11-28 17:56:27,166 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 81 places, 78 transitions [2019-11-28 17:56:27,220 INFO L134 PetriNetUnfolder]: 6/86 cut-off events. [2019-11-28 17:56:27,220 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 17:56:27,227 INFO L76 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 86 events. 6/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 153 event pairs. 43/127 useless extension candidates. Maximal degree in co-relation 52. Up to 6 conditions per place. [2019-11-28 17:56:27,232 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 81 places, 78 transitions [2019-11-28 17:56:27,262 INFO L134 PetriNetUnfolder]: 6/86 cut-off events. [2019-11-28 17:56:27,263 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 17:56:27,265 INFO L76 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 86 events. 6/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 153 event pairs. 43/127 useless extension candidates. Maximal degree in co-relation 52. Up to 6 conditions per place. [2019-11-28 17:56:27,269 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1116 [2019-11-28 17:56:27,270 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 17:56:29,034 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2019-11-28 17:56:29,168 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-28 17:56:29,180 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2319 [2019-11-28 17:56:29,180 INFO L214 etLargeBlockEncoding]: Total number of compositions: 46 [2019-11-28 17:56:29,185 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 37 transitions [2019-11-28 17:56:29,244 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 492 states. [2019-11-28 17:56:29,247 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states. [2019-11-28 17:56:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 17:56:29,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:56:29,257 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:56:29,257 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thread3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:56:29,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:56:29,266 INFO L82 PathProgramCache]: Analyzing trace with hash 835949709, now seen corresponding path program 1 times [2019-11-28 17:56:29,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:56:29,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671015844] [2019-11-28 17:56:29,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:56:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:56:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:56:29,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671015844] [2019-11-28 17:56:29,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:56:29,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 17:56:29,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85219678] [2019-11-28 17:56:29,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:56:29,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:56:29,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:56:29,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:56:29,526 INFO L87 Difference]: Start difference. First operand 492 states. Second operand 3 states. [2019-11-28 17:56:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:56:29,607 INFO L93 Difference]: Finished difference Result 480 states and 1245 transitions. [2019-11-28 17:56:29,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:56:29,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-28 17:56:29,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:56:29,627 INFO L225 Difference]: With dead ends: 480 [2019-11-28 17:56:29,627 INFO L226 Difference]: Without dead ends: 250 [2019-11-28 17:56:29,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:56:29,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-28 17:56:29,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2019-11-28 17:56:29,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-28 17:56:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 622 transitions. [2019-11-28 17:56:29,704 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 622 transitions. Word has length 8 [2019-11-28 17:56:29,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:56:29,706 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 622 transitions. [2019-11-28 17:56:29,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:56:29,706 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 622 transitions. [2019-11-28 17:56:29,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:56:29,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:56:29,708 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:56:29,709 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thread3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:56:29,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:56:29,709 INFO L82 PathProgramCache]: Analyzing trace with hash 188784817, now seen corresponding path program 1 times [2019-11-28 17:56:29,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:56:29,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795242192] [2019-11-28 17:56:29,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:56:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:56:29,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:56:29,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795242192] [2019-11-28 17:56:29,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:56:29,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:56:29,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843175235] [2019-11-28 17:56:29,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:56:29,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:56:29,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:56:29,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:56:29,799 INFO L87 Difference]: Start difference. First operand 250 states and 622 transitions. Second operand 3 states. [2019-11-28 17:56:29,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:56:29,823 INFO L93 Difference]: Finished difference Result 142 states and 253 transitions. [2019-11-28 17:56:29,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:56:29,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 17:56:29,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:56:29,826 INFO L225 Difference]: With dead ends: 142 [2019-11-28 17:56:29,826 INFO L226 Difference]: Without dead ends: 140 [2019-11-28 17:56:29,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:56:29,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-28 17:56:29,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-11-28 17:56:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-28 17:56:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 250 transitions. [2019-11-28 17:56:29,840 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 250 transitions. Word has length 10 [2019-11-28 17:56:29,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:56:29,841 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 250 transitions. [2019-11-28 17:56:29,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:56:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 250 transitions. [2019-11-28 17:56:29,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 17:56:29,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:56:29,843 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:56:29,843 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thread3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:56:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:56:29,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1562794345, now seen corresponding path program 1 times [2019-11-28 17:56:29,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:56:29,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566401999] [2019-11-28 17:56:29,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:56:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:56:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:56:29,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566401999] [2019-11-28 17:56:29,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:56:29,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:56:29,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599111333] [2019-11-28 17:56:29,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:56:29,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:56:29,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:56:29,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:56:29,969 INFO L87 Difference]: Start difference. First operand 140 states and 250 transitions. Second operand 4 states. [2019-11-28 17:56:30,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:56:30,003 INFO L93 Difference]: Finished difference Result 135 states and 241 transitions. [2019-11-28 17:56:30,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:56:30,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 17:56:30,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:56:30,006 INFO L225 Difference]: With dead ends: 135 [2019-11-28 17:56:30,007 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 17:56:30,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:56:30,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 17:56:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-28 17:56:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 17:56:30,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 232 transitions. [2019-11-28 17:56:30,018 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 232 transitions. Word has length 11 [2019-11-28 17:56:30,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:56:30,019 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 232 transitions. [2019-11-28 17:56:30,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:56:30,019 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 232 transitions. [2019-11-28 17:56:30,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 17:56:30,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:56:30,021 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:56:30,021 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thread3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:56:30,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:56:30,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1580374126, now seen corresponding path program 1 times [2019-11-28 17:56:30,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:56:30,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244026044] [2019-11-28 17:56:30,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:56:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:56:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:56:30,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244026044] [2019-11-28 17:56:30,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:56:30,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:56:30,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782403410] [2019-11-28 17:56:30,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:56:30,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:56:30,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:56:30,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:56:30,092 INFO L87 Difference]: Start difference. First operand 130 states and 232 transitions. Second operand 5 states. [2019-11-28 17:56:30,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:56:30,129 INFO L93 Difference]: Finished difference Result 125 states and 223 transitions. [2019-11-28 17:56:30,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:56:30,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 17:56:30,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:56:30,131 INFO L225 Difference]: With dead ends: 125 [2019-11-28 17:56:30,131 INFO L226 Difference]: Without dead ends: 120 [2019-11-28 17:56:30,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:56:30,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-28 17:56:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-28 17:56:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 17:56:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 214 transitions. [2019-11-28 17:56:30,139 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 214 transitions. Word has length 12 [2019-11-28 17:56:30,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:56:30,140 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 214 transitions. [2019-11-28 17:56:30,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:56:30,140 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 214 transitions. [2019-11-28 17:56:30,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 17:56:30,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:56:30,141 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:56:30,142 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thread3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:56:30,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:56:30,142 INFO L82 PathProgramCache]: Analyzing trace with hash -500515352, now seen corresponding path program 1 times [2019-11-28 17:56:30,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:56:30,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438431177] [2019-11-28 17:56:30,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:56:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:56:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:56:30,219 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:56:30,219 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:56:30,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [231] [231] ULTIMATE.startENTRY-->L713: Formula: (let ((.cse1 (store |v_#valid_58| 0 0))) (let ((.cse3 (store .cse1 |v_~#mutex~0.base_104| 1))) (let ((.cse4 (store .cse3 |v_ULTIMATE.start_main_~#t1~0.base_22| 1))) (let ((.cse0 (select |v_#memory_int_32| |v_~#mutex~0.base_104|)) (.cse2 (store .cse4 |v_ULTIMATE.start_main_~#t2~0.base_20| 1))) (and (= (select .cse0 (+ |v_~#mutex~0.offset_104| 16)) 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2~0.base_20|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t3~0.base_20|) (= |v_ULTIMATE.start_main_~#t1~0.offset_18| 0) (= (store (store (store (store |v_#length_31| |v_~#mutex~0.base_104| 24) |v_ULTIMATE.start_main_~#t1~0.base_22| 4) |v_ULTIMATE.start_main_~#t2~0.base_20| 4) |v_ULTIMATE.start_main_~#t3~0.base_20| 4) |v_#length_29|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1~0.base_22|) (< |v_#StackHeapBarrier_15| |v_~#mutex~0.base_104|) (= (select .cse0 (+ |v_~#mutex~0.offset_104| 12)) 0) (= v_~data~0_78 0) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t1~0.base_22| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t1~0.base_22|) |v_ULTIMATE.start_main_~#t1~0.offset_18| 0))) (= (select .cse1 |v_~#mutex~0.base_104|) 0) (= |v_#pthreadsMutex_242| (store |v_#pthreadsMutex_243| |v_~#mutex~0.base_104| (store (select |v_#pthreadsMutex_243| |v_~#mutex~0.base_104|) |v_~#mutex~0.offset_104| 0))) (= 0 (select .cse2 |v_ULTIMATE.start_main_~#t3~0.base_20|)) (< 0 |v_#StackHeapBarrier_15|) (= 0 (select .cse0 (+ |v_~#mutex~0.offset_104| 8))) (= |v_ULTIMATE.start_main_~#t3~0.offset_17| 0) (= |v_#NULL.offset_5| 0) (= |v_ULTIMATE.start_main_~#t2~0.offset_16| 0) (= 0 |v_~#mutex~0.offset_104|) (= (select .cse0 |v_~#mutex~0.offset_104|) 0) (= 0 |v_#NULL.base_5|) (= 0 (select .cse3 |v_ULTIMATE.start_main_~#t1~0.base_22|)) (= (select .cse0 (+ |v_~#mutex~0.offset_104| 4)) 0) (= |v_#valid_56| (store .cse2 |v_ULTIMATE.start_main_~#t3~0.base_20| 1)) (= 0 (select .cse4 |v_ULTIMATE.start_main_~#t2~0.base_20|))))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_243|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_31|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_13|, #pthreadsMutex=|v_#pthreadsMutex_242|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_13|, ~#mutex~0.base=|v_~#mutex~0.base_104|, ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_16|, ~#mutex~0.offset=|v_~#mutex~0.offset_104|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_7|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_20|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_7|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_7|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_22|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_14|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_17|, #length=|v_#length_29|, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_18|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_20|, ~data~0=v_~data~0_78} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, #pthreadsMutex, ULTIMATE.start_main_#t~mem11, ~#mutex~0.base, ULTIMATE.start_main_~#t2~0.offset, ~#mutex~0.offset, ULTIMATE.start_main_#t~nondet8, #NULL.offset, ULTIMATE.start_main_~#t3~0.base, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_~#t1~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t3~0.offset, #length, ULTIMATE.start_main_~#t1~0.offset, ULTIMATE.start_main_~#t2~0.base, ~data~0] because there is no mapped edge [2019-11-28 17:56:30,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [195] [195] L713-1-->L714-1: Formula: (= (store |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0.base_9| (store (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0.base_9|) |v_ULTIMATE.start_main_~#t2~0.offset_8| 1)) |v_#memory_int_18|) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_8|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_9|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_8|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_3|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_9|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet6] because there is no mapped edge [2019-11-28 17:56:30,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [194] [194] L714-2-->L715-1: Formula: (= (store |v_#memory_int_17| |v_ULTIMATE.start_main_~#t3~0.base_8| (store (select |v_#memory_int_17| |v_ULTIMATE.start_main_~#t3~0.base_8|) |v_ULTIMATE.start_main_~#t3~0.offset_8| 2)) |v_#memory_int_16|) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_8|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_8|} OutVars{#memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_8|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_8|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_3|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet7] because there is no mapped edge [2019-11-28 17:56:30,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [222] [222] thread1ENTRY-->L688: Formula: (let ((.cse0 (select |v_#pthreadsMutex_157| |v_~#mutex~0.base_70|))) (and (= (select .cse0 |v_~#mutex~0.offset_70|) 0) (= (store |v_#pthreadsMutex_157| |v_~#mutex~0.base_70| (store .cse0 |v_~#mutex~0.offset_70| 1)) |v_#pthreadsMutex_156|) (= |v_thread1Thread1of1ForFork0_#in~arg.offset_4| v_thread1Thread1of1ForFork0_~arg.offset_2) (= |v_thread1Thread1of1ForFork0_#in~arg.base_4| v_thread1Thread1of1ForFork0_~arg.base_2))) InVars {#pthreadsMutex=|v_#pthreadsMutex_157|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_4|, ~#mutex~0.base=|v_~#mutex~0.base_70|, ~#mutex~0.offset=|v_~#mutex~0.offset_70|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_4|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_156|, thread1Thread1of1ForFork0_#t~nondet2=|v_thread1Thread1of1ForFork0_#t~nondet2_27|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_4|, ~#mutex~0.base=|v_~#mutex~0.base_70|, thread1Thread1of1ForFork0_~arg.offset=v_thread1Thread1of1ForFork0_~arg.offset_2, thread1Thread1of1ForFork0_~arg.base=v_thread1Thread1of1ForFork0_~arg.base_2, ~#mutex~0.offset=|v_~#mutex~0.offset_70|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_4|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork0_#t~nondet2, thread1Thread1of1ForFork0_~arg.offset, thread1Thread1of1ForFork0_~arg.base] because there is no mapped edge [2019-11-28 17:56:30,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [205] [205] L688-1-->L689: Formula: (= v_~data~0_30 (+ |v_thread1Thread1of1ForFork0_#t~post3_13| 1)) InVars {thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_13|} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_12|, ~data~0=v_~data~0_30} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~data~0] because there is no mapped edge [2019-11-28 17:56:30,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [216] [216] L689-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_3| 0) (= |v_#pthreadsMutex_154| (store |v_#pthreadsMutex_155| |v_~#mutex~0.base_67| (store (select |v_#pthreadsMutex_155| |v_~#mutex~0.base_67|) |v_~#mutex~0.offset_67| 0))) (= |v_thread1Thread1of1ForFork0_#res.base_3| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_155|, ~#mutex~0.base=|v_~#mutex~0.base_67|, ~#mutex~0.offset=|v_~#mutex~0.offset_67|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_154|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_3|, ~#mutex~0.base=|v_~#mutex~0.base_67|, ~#mutex~0.offset=|v_~#mutex~0.offset_67|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-11-28 17:56:30,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [207] [207] thread2ENTRY-->L694-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_42| |v_~#mutex~0.base_26|))) (and (= v_thread2Thread1of1ForFork1_~arg.offset_2 |v_thread2Thread1of1ForFork1_#in~arg.offset_4|) (= |v_thread2Thread1of1ForFork1_#t~nondet4_6| 0) (= |v_thread2Thread1of1ForFork1_#in~arg.base_4| v_thread2Thread1of1ForFork1_~arg.base_2) (= (select .cse0 |v_~#mutex~0.offset_26|) 0) (= (store |v_#pthreadsMutex_42| |v_~#mutex~0.base_26| (store .cse0 |v_~#mutex~0.offset_26| 1)) |v_#pthreadsMutex_41|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_42|, thread2Thread1of1ForFork1_#in~arg.offset=|v_thread2Thread1of1ForFork1_#in~arg.offset_4|, ~#mutex~0.base=|v_~#mutex~0.base_26|, ~#mutex~0.offset=|v_~#mutex~0.offset_26|, thread2Thread1of1ForFork1_#in~arg.base=|v_thread2Thread1of1ForFork1_#in~arg.base_4|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_41|, thread2Thread1of1ForFork1_#in~arg.offset=|v_thread2Thread1of1ForFork1_#in~arg.offset_4|, thread2Thread1of1ForFork1_~arg.base=v_thread2Thread1of1ForFork1_~arg.base_2, ~#mutex~0.base=|v_~#mutex~0.base_26|, thread2Thread1of1ForFork1_~arg.offset=v_thread2Thread1of1ForFork1_~arg.offset_2, ~#mutex~0.offset=|v_~#mutex~0.offset_26|, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_6|, thread2Thread1of1ForFork1_#in~arg.base=|v_thread2Thread1of1ForFork1_#in~arg.base_4|} AuxVars[] AssignedVars[#pthreadsMutex, thread2Thread1of1ForFork1_~arg.base, thread2Thread1of1ForFork1_~arg.offset, thread2Thread1of1ForFork1_#t~nondet4] because there is no mapped edge [2019-11-28 17:56:30,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [203] [203] L694-1-->L696: Formula: (= (+ v_~data~0_24 2) v_~data~0_23) InVars {~data~0=v_~data~0_24} OutVars{thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_3|, ~data~0=v_~data~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet4, ~data~0] because there is no mapped edge [2019-11-28 17:56:30,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [214] [214] L696-->thread2EXIT: Formula: (and (= (store |v_#pthreadsMutex_105| |v_~#mutex~0.base_50| (store (select |v_#pthreadsMutex_105| |v_~#mutex~0.base_50|) |v_~#mutex~0.offset_50| 0)) |v_#pthreadsMutex_104|) (= |v_thread2Thread1of1ForFork1_#res.base_7| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_7| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_105|, ~#mutex~0.base=|v_~#mutex~0.base_50|, ~#mutex~0.offset=|v_~#mutex~0.offset_50|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_7|, #pthreadsMutex=|v_#pthreadsMutex_104|, ~#mutex~0.base=|v_~#mutex~0.base_50|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_7|, ~#mutex~0.offset=|v_~#mutex~0.offset_50|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, #pthreadsMutex, thread2Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 17:56:30,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [201] [201] thread3ENTRY-->L701-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_26| |v_~#mutex~0.base_20|))) (and (= |v_thread3Thread1of1ForFork2_#in~arg.offset_4| v_thread3Thread1of1ForFork2_~arg.offset_2) (= 0 |v_thread3Thread1of1ForFork2_#t~nondet5_5|) (= |v_thread3Thread1of1ForFork2_#in~arg.base_4| v_thread3Thread1of1ForFork2_~arg.base_2) (= (select .cse0 |v_~#mutex~0.offset_20|) 0) (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#mutex~0.base_20| (store .cse0 |v_~#mutex~0.offset_20| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#mutex~0.base=|v_~#mutex~0.base_20|, thread3Thread1of1ForFork2_#in~arg.offset=|v_thread3Thread1of1ForFork2_#in~arg.offset_4|, ~#mutex~0.offset=|v_~#mutex~0.offset_20|, thread3Thread1of1ForFork2_#in~arg.base=|v_thread3Thread1of1ForFork2_#in~arg.base_4|} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_5|, #pthreadsMutex=|v_#pthreadsMutex_25|, ~#mutex~0.base=|v_~#mutex~0.base_20|, thread3Thread1of1ForFork2_#in~arg.offset=|v_thread3Thread1of1ForFork2_#in~arg.offset_4|, ~#mutex~0.offset=|v_~#mutex~0.offset_20|, thread3Thread1of1ForFork2_~arg.offset=v_thread3Thread1of1ForFork2_~arg.offset_2, thread3Thread1of1ForFork2_#in~arg.base=|v_thread3Thread1of1ForFork2_#in~arg.base_4|, thread3Thread1of1ForFork2_~arg.base=v_thread3Thread1of1ForFork2_~arg.base_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, #pthreadsMutex, thread3Thread1of1ForFork2_~arg.offset, thread3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-11-28 17:56:30,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [215] [215] L701-1-->thread3Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (<= 3 v_~data~0_53) InVars {~data~0=v_~data~0_53} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_22|, ~data~0=v_~data~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5] because there is no mapped edge [2019-11-28 17:56:30,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:56:30 BasicIcfg [2019-11-28 17:56:30,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:56:30,261 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:56:30,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:56:30,262 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:56:30,263 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:56:26" (3/4) ... [2019-11-28 17:56:30,265 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:56:30,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [231] [231] ULTIMATE.startENTRY-->L713: Formula: (let ((.cse1 (store |v_#valid_58| 0 0))) (let ((.cse3 (store .cse1 |v_~#mutex~0.base_104| 1))) (let ((.cse4 (store .cse3 |v_ULTIMATE.start_main_~#t1~0.base_22| 1))) (let ((.cse0 (select |v_#memory_int_32| |v_~#mutex~0.base_104|)) (.cse2 (store .cse4 |v_ULTIMATE.start_main_~#t2~0.base_20| 1))) (and (= (select .cse0 (+ |v_~#mutex~0.offset_104| 16)) 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2~0.base_20|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t3~0.base_20|) (= |v_ULTIMATE.start_main_~#t1~0.offset_18| 0) (= (store (store (store (store |v_#length_31| |v_~#mutex~0.base_104| 24) |v_ULTIMATE.start_main_~#t1~0.base_22| 4) |v_ULTIMATE.start_main_~#t2~0.base_20| 4) |v_ULTIMATE.start_main_~#t3~0.base_20| 4) |v_#length_29|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1~0.base_22|) (< |v_#StackHeapBarrier_15| |v_~#mutex~0.base_104|) (= (select .cse0 (+ |v_~#mutex~0.offset_104| 12)) 0) (= v_~data~0_78 0) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t1~0.base_22| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t1~0.base_22|) |v_ULTIMATE.start_main_~#t1~0.offset_18| 0))) (= (select .cse1 |v_~#mutex~0.base_104|) 0) (= |v_#pthreadsMutex_242| (store |v_#pthreadsMutex_243| |v_~#mutex~0.base_104| (store (select |v_#pthreadsMutex_243| |v_~#mutex~0.base_104|) |v_~#mutex~0.offset_104| 0))) (= 0 (select .cse2 |v_ULTIMATE.start_main_~#t3~0.base_20|)) (< 0 |v_#StackHeapBarrier_15|) (= 0 (select .cse0 (+ |v_~#mutex~0.offset_104| 8))) (= |v_ULTIMATE.start_main_~#t3~0.offset_17| 0) (= |v_#NULL.offset_5| 0) (= |v_ULTIMATE.start_main_~#t2~0.offset_16| 0) (= 0 |v_~#mutex~0.offset_104|) (= (select .cse0 |v_~#mutex~0.offset_104|) 0) (= 0 |v_#NULL.base_5|) (= 0 (select .cse3 |v_ULTIMATE.start_main_~#t1~0.base_22|)) (= (select .cse0 (+ |v_~#mutex~0.offset_104| 4)) 0) (= |v_#valid_56| (store .cse2 |v_ULTIMATE.start_main_~#t3~0.base_20| 1)) (= 0 (select .cse4 |v_ULTIMATE.start_main_~#t2~0.base_20|))))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_243|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_31|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_13|, #pthreadsMutex=|v_#pthreadsMutex_242|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_13|, ~#mutex~0.base=|v_~#mutex~0.base_104|, ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_16|, ~#mutex~0.offset=|v_~#mutex~0.offset_104|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_7|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_20|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_7|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_7|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_22|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_14|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_17|, #length=|v_#length_29|, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_18|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_20|, ~data~0=v_~data~0_78} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, #pthreadsMutex, ULTIMATE.start_main_#t~mem11, ~#mutex~0.base, ULTIMATE.start_main_~#t2~0.offset, ~#mutex~0.offset, ULTIMATE.start_main_#t~nondet8, #NULL.offset, ULTIMATE.start_main_~#t3~0.base, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_~#t1~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t3~0.offset, #length, ULTIMATE.start_main_~#t1~0.offset, ULTIMATE.start_main_~#t2~0.base, ~data~0] because there is no mapped edge [2019-11-28 17:56:30,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [195] [195] L713-1-->L714-1: Formula: (= (store |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0.base_9| (store (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0.base_9|) |v_ULTIMATE.start_main_~#t2~0.offset_8| 1)) |v_#memory_int_18|) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_8|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_9|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_8|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_3|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_9|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet6] because there is no mapped edge [2019-11-28 17:56:30,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [194] [194] L714-2-->L715-1: Formula: (= (store |v_#memory_int_17| |v_ULTIMATE.start_main_~#t3~0.base_8| (store (select |v_#memory_int_17| |v_ULTIMATE.start_main_~#t3~0.base_8|) |v_ULTIMATE.start_main_~#t3~0.offset_8| 2)) |v_#memory_int_16|) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_8|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_8|} OutVars{#memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_8|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_8|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_3|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet7] because there is no mapped edge [2019-11-28 17:56:30,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [222] [222] thread1ENTRY-->L688: Formula: (let ((.cse0 (select |v_#pthreadsMutex_157| |v_~#mutex~0.base_70|))) (and (= (select .cse0 |v_~#mutex~0.offset_70|) 0) (= (store |v_#pthreadsMutex_157| |v_~#mutex~0.base_70| (store .cse0 |v_~#mutex~0.offset_70| 1)) |v_#pthreadsMutex_156|) (= |v_thread1Thread1of1ForFork0_#in~arg.offset_4| v_thread1Thread1of1ForFork0_~arg.offset_2) (= |v_thread1Thread1of1ForFork0_#in~arg.base_4| v_thread1Thread1of1ForFork0_~arg.base_2))) InVars {#pthreadsMutex=|v_#pthreadsMutex_157|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_4|, ~#mutex~0.base=|v_~#mutex~0.base_70|, ~#mutex~0.offset=|v_~#mutex~0.offset_70|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_4|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_156|, thread1Thread1of1ForFork0_#t~nondet2=|v_thread1Thread1of1ForFork0_#t~nondet2_27|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_4|, ~#mutex~0.base=|v_~#mutex~0.base_70|, thread1Thread1of1ForFork0_~arg.offset=v_thread1Thread1of1ForFork0_~arg.offset_2, thread1Thread1of1ForFork0_~arg.base=v_thread1Thread1of1ForFork0_~arg.base_2, ~#mutex~0.offset=|v_~#mutex~0.offset_70|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_4|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork0_#t~nondet2, thread1Thread1of1ForFork0_~arg.offset, thread1Thread1of1ForFork0_~arg.base] because there is no mapped edge [2019-11-28 17:56:30,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [205] [205] L688-1-->L689: Formula: (= v_~data~0_30 (+ |v_thread1Thread1of1ForFork0_#t~post3_13| 1)) InVars {thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_13|} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_12|, ~data~0=v_~data~0_30} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~data~0] because there is no mapped edge [2019-11-28 17:56:30,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [216] [216] L689-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_3| 0) (= |v_#pthreadsMutex_154| (store |v_#pthreadsMutex_155| |v_~#mutex~0.base_67| (store (select |v_#pthreadsMutex_155| |v_~#mutex~0.base_67|) |v_~#mutex~0.offset_67| 0))) (= |v_thread1Thread1of1ForFork0_#res.base_3| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_155|, ~#mutex~0.base=|v_~#mutex~0.base_67|, ~#mutex~0.offset=|v_~#mutex~0.offset_67|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_154|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_3|, ~#mutex~0.base=|v_~#mutex~0.base_67|, ~#mutex~0.offset=|v_~#mutex~0.offset_67|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-11-28 17:56:30,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [207] [207] thread2ENTRY-->L694-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_42| |v_~#mutex~0.base_26|))) (and (= v_thread2Thread1of1ForFork1_~arg.offset_2 |v_thread2Thread1of1ForFork1_#in~arg.offset_4|) (= |v_thread2Thread1of1ForFork1_#t~nondet4_6| 0) (= |v_thread2Thread1of1ForFork1_#in~arg.base_4| v_thread2Thread1of1ForFork1_~arg.base_2) (= (select .cse0 |v_~#mutex~0.offset_26|) 0) (= (store |v_#pthreadsMutex_42| |v_~#mutex~0.base_26| (store .cse0 |v_~#mutex~0.offset_26| 1)) |v_#pthreadsMutex_41|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_42|, thread2Thread1of1ForFork1_#in~arg.offset=|v_thread2Thread1of1ForFork1_#in~arg.offset_4|, ~#mutex~0.base=|v_~#mutex~0.base_26|, ~#mutex~0.offset=|v_~#mutex~0.offset_26|, thread2Thread1of1ForFork1_#in~arg.base=|v_thread2Thread1of1ForFork1_#in~arg.base_4|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_41|, thread2Thread1of1ForFork1_#in~arg.offset=|v_thread2Thread1of1ForFork1_#in~arg.offset_4|, thread2Thread1of1ForFork1_~arg.base=v_thread2Thread1of1ForFork1_~arg.base_2, ~#mutex~0.base=|v_~#mutex~0.base_26|, thread2Thread1of1ForFork1_~arg.offset=v_thread2Thread1of1ForFork1_~arg.offset_2, ~#mutex~0.offset=|v_~#mutex~0.offset_26|, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_6|, thread2Thread1of1ForFork1_#in~arg.base=|v_thread2Thread1of1ForFork1_#in~arg.base_4|} AuxVars[] AssignedVars[#pthreadsMutex, thread2Thread1of1ForFork1_~arg.base, thread2Thread1of1ForFork1_~arg.offset, thread2Thread1of1ForFork1_#t~nondet4] because there is no mapped edge [2019-11-28 17:56:30,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [203] [203] L694-1-->L696: Formula: (= (+ v_~data~0_24 2) v_~data~0_23) InVars {~data~0=v_~data~0_24} OutVars{thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_3|, ~data~0=v_~data~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet4, ~data~0] because there is no mapped edge [2019-11-28 17:56:30,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [214] [214] L696-->thread2EXIT: Formula: (and (= (store |v_#pthreadsMutex_105| |v_~#mutex~0.base_50| (store (select |v_#pthreadsMutex_105| |v_~#mutex~0.base_50|) |v_~#mutex~0.offset_50| 0)) |v_#pthreadsMutex_104|) (= |v_thread2Thread1of1ForFork1_#res.base_7| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_7| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_105|, ~#mutex~0.base=|v_~#mutex~0.base_50|, ~#mutex~0.offset=|v_~#mutex~0.offset_50|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_7|, #pthreadsMutex=|v_#pthreadsMutex_104|, ~#mutex~0.base=|v_~#mutex~0.base_50|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_7|, ~#mutex~0.offset=|v_~#mutex~0.offset_50|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, #pthreadsMutex, thread2Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 17:56:30,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [201] [201] thread3ENTRY-->L701-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_26| |v_~#mutex~0.base_20|))) (and (= |v_thread3Thread1of1ForFork2_#in~arg.offset_4| v_thread3Thread1of1ForFork2_~arg.offset_2) (= 0 |v_thread3Thread1of1ForFork2_#t~nondet5_5|) (= |v_thread3Thread1of1ForFork2_#in~arg.base_4| v_thread3Thread1of1ForFork2_~arg.base_2) (= (select .cse0 |v_~#mutex~0.offset_20|) 0) (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#mutex~0.base_20| (store .cse0 |v_~#mutex~0.offset_20| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#mutex~0.base=|v_~#mutex~0.base_20|, thread3Thread1of1ForFork2_#in~arg.offset=|v_thread3Thread1of1ForFork2_#in~arg.offset_4|, ~#mutex~0.offset=|v_~#mutex~0.offset_20|, thread3Thread1of1ForFork2_#in~arg.base=|v_thread3Thread1of1ForFork2_#in~arg.base_4|} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_5|, #pthreadsMutex=|v_#pthreadsMutex_25|, ~#mutex~0.base=|v_~#mutex~0.base_20|, thread3Thread1of1ForFork2_#in~arg.offset=|v_thread3Thread1of1ForFork2_#in~arg.offset_4|, ~#mutex~0.offset=|v_~#mutex~0.offset_20|, thread3Thread1of1ForFork2_~arg.offset=v_thread3Thread1of1ForFork2_~arg.offset_2, thread3Thread1of1ForFork2_#in~arg.base=|v_thread3Thread1of1ForFork2_#in~arg.base_4|, thread3Thread1of1ForFork2_~arg.base=v_thread3Thread1of1ForFork2_~arg.base_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, #pthreadsMutex, thread3Thread1of1ForFork2_~arg.offset, thread3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-11-28 17:56:30,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [215] [215] L701-1-->thread3Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (<= 3 v_~data~0_53) InVars {~data~0=v_~data~0_53} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_22|, ~data~0=v_~data~0_53} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5] because there is no mapped edge [2019-11-28 17:56:30,333 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:56:30,334 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:56:30,336 INFO L168 Benchmark]: Toolchain (without parser) took 4610.83 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -222.9 MB). Peak memory consumption was 1.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:56:30,337 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:56:30,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 720.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:56:30,344 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:56:30,345 INFO L168 Benchmark]: Boogie Preprocessor took 28.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:56:30,345 INFO L168 Benchmark]: RCFGBuilder took 470.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2019-11-28 17:56:30,346 INFO L168 Benchmark]: TraceAbstraction took 3264.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -95.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:56:30,347 INFO L168 Benchmark]: Witness Printer took 72.57 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:56:30,356 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 720.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 470.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3264.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -95.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 72.57 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 81 ProgramPointsBefore, 39 ProgramPointsAfterwards, 78 TransitionsBefore, 37 TransitionsAfterwards, 1116 CoEnabledTransitionPairs, 6 FixpointIterations, 24 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 502 VarBasedMoverChecksPositive, 39 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 27 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.2s, 0 MoverChecksTotal, 2319 CheckedPairsTotal, 46 TotalNumberOfCompositions - CounterExampleResult [Line: 703]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L713] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, data=0, mutex={5:0}] [L714] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, data=0, mutex={5:0}] [L715] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, data=0, mutex={5:0}] [L688] 1 data++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=0, data++=0, mutex={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 72 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.0s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 115 SDtfs, 66 SDslu, 136 SDs, 0 SdLazy, 36 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=492occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 945 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...