./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_67-pthread_cond_wait_true.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/goblint-regression/13-privatized_67-pthread_cond_wait_true.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f5c1949da3ffd7703b26279578bf3cad55c86e8b0ffaff69f49645cdd541f53 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:40:58,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:40:58,132 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:40:58,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:40:58,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:40:58,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:40:58,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:40:58,174 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:40:58,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:40:58,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:40:58,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:40:58,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:40:58,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:40:58,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:40:58,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:40:58,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:40:58,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:40:58,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:40:58,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:40:58,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:40:58,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:40:58,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:40:58,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:40:58,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:40:58,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:40:58,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:40:58,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:40:58,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:40:58,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:40:58,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:40:58,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:40:58,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:40:58,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:40:58,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:40:58,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:40:58,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:40:58,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:40:58,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:40:58,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:40:58,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:40:58,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:40:58,211 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 20:40:58,237 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:40:58,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:40:58,237 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:40:58,237 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:40:58,238 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:40:58,238 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:40:58,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:40:58,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:40:58,239 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:40:58,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:40:58,240 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:40:58,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:40:58,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:40:58,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:40:58,240 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:40:58,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:40:58,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:40:58,241 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:40:58,241 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:40:58,241 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:40:58,241 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:40:58,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:40:58,242 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:40:58,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:40:58,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:58,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:40:58,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:40:58,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:40:58,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:40:58,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:40:58,243 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:40:58,243 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:40:58,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:40:58,243 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 4f5c1949da3ffd7703b26279578bf3cad55c86e8b0ffaff69f49645cdd541f53 [2022-02-20 20:40:58,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:40:58,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:40:58,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:40:58,543 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:40:58,544 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:40:58,545 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_67-pthread_cond_wait_true.i [2022-02-20 20:40:58,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd45d12d8/ea3547c63ffb4257a4105e0340323cf9/FLAG97a2fa0b5 [2022-02-20 20:40:59,118 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:40:59,123 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_67-pthread_cond_wait_true.i [2022-02-20 20:40:59,146 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd45d12d8/ea3547c63ffb4257a4105e0340323cf9/FLAG97a2fa0b5 [2022-02-20 20:40:59,614 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd45d12d8/ea3547c63ffb4257a4105e0340323cf9 [2022-02-20 20:40:59,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:40:59,617 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:40:59,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:59,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:40:59,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:40:59,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:59" (1/1) ... [2022-02-20 20:40:59,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@471c4ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:59, skipping insertion in model container [2022-02-20 20:40:59,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:59" (1/1) ... [2022-02-20 20:40:59,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:40:59,662 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:40:59,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_67-pthread_cond_wait_true.i[1094,1107] [2022-02-20 20:41:00,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:41:00,086 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:41:00,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_67-pthread_cond_wait_true.i[1094,1107] [2022-02-20 20:41:00,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:41:00,206 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:41:00,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:41:00 WrapperNode [2022-02-20 20:41:00,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:41:00,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:41:00,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:41:00,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:41:00,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:41:00" (1/1) ... [2022-02-20 20:41:00,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:41:00" (1/1) ... [2022-02-20 20:41:00,251 INFO L137 Inliner]: procedures = 354, calls = 39, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2022-02-20 20:41:00,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:41:00,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:41:00,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:41:00,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:41:00,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:41:00" (1/1) ... [2022-02-20 20:41:00,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:41:00" (1/1) ... [2022-02-20 20:41:00,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:41:00" (1/1) ... [2022-02-20 20:41:00,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:41:00" (1/1) ... [2022-02-20 20:41:00,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:41:00" (1/1) ... [2022-02-20 20:41:00,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:41:00" (1/1) ... [2022-02-20 20:41:00,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:41:00" (1/1) ... [2022-02-20 20:41:00,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:41:00,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:41:00,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:41:00,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:41:00,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:41:00" (1/1) ... [2022-02-20 20:41:00,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:41:00,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:41:00,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 20:41:00,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 20:41:00,376 INFO L130 BoogieDeclarations]: Found specification of procedure sleep [2022-02-20 20:41:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2022-02-20 20:41:00,377 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2022-02-20 20:41:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2022-02-20 20:41:00,378 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2022-02-20 20:41:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:41:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:41:00,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:41:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:41:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:41:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:41:00,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:41:00,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:41:00,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:41:00,383 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-20 20:41:00,598 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:41:00,599 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:41:00,775 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:41:00,781 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:41:00,784 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:41:00,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:41:00 BoogieIcfgContainer [2022-02-20 20:41:00,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:41:00,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:41:00,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:41:00,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:41:00,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:40:59" (1/3) ... [2022-02-20 20:41:00,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7d3f6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:41:00, skipping insertion in model container [2022-02-20 20:41:00,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:41:00" (2/3) ... [2022-02-20 20:41:00,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7d3f6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:41:00, skipping insertion in model container [2022-02-20 20:41:00,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:41:00" (3/3) ... [2022-02-20 20:41:00,801 INFO L111 eAbstractionObserver]: Analyzing ICFG 13-privatized_67-pthread_cond_wait_true.i [2022-02-20 20:41:00,805 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:41:00,805 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:41:00,806 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:41:00,806 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:41:00,870 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#in~ptr#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,871 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#in~ptr#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,871 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_~ptr#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,871 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_~ptr#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,871 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#in~ptr#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,872 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#in~ptr#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,872 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_~ptr#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,872 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_~ptr#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,872 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,873 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,873 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,873 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,874 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,874 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,874 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,875 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,875 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,875 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,875 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,876 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,876 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,876 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,876 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,877 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,877 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,877 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,878 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,878 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,878 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,879 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,879 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,879 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,879 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,879 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,881 WARN L322 ript$VariableManager]: TermVariabe |f2Thread1of1ForFork0_#in~ptr.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,881 WARN L322 ript$VariableManager]: TermVariabe |f2Thread1of1ForFork0_#in~ptr.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,881 WARN L322 ript$VariableManager]: TermVariabe f2Thread1of1ForFork0_~ptr.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,881 WARN L322 ript$VariableManager]: TermVariabe f2Thread1of1ForFork0_~ptr.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,881 WARN L322 ript$VariableManager]: TermVariabe |f2Thread1of1ForFork0_#in~ptr.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,882 WARN L322 ript$VariableManager]: TermVariabe |f2Thread1of1ForFork0_#in~ptr.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,882 WARN L322 ript$VariableManager]: TermVariabe f2Thread1of1ForFork0_~ptr.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,882 WARN L322 ript$VariableManager]: TermVariabe f2Thread1of1ForFork0_~ptr.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,882 WARN L322 ript$VariableManager]: TermVariabe |f2Thread1of1ForFork0_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,882 WARN L322 ript$VariableManager]: TermVariabe |f2Thread1of1ForFork0_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,882 WARN L322 ript$VariableManager]: TermVariabe |f2Thread1of1ForFork0_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,883 WARN L322 ript$VariableManager]: TermVariabe |f2Thread1of1ForFork0_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,883 WARN L322 ript$VariableManager]: TermVariabe |f2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,883 WARN L322 ript$VariableManager]: TermVariabe |f2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,883 WARN L322 ript$VariableManager]: TermVariabe |f2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,884 WARN L322 ript$VariableManager]: TermVariabe |f2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,887 WARN L322 ript$VariableManager]: TermVariabe f2Thread1of1ForFork0_~ptr.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,888 WARN L322 ript$VariableManager]: TermVariabe |f2Thread1of1ForFork0_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,888 WARN L322 ript$VariableManager]: TermVariabe f2Thread1of1ForFork0_~ptr.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,888 WARN L322 ript$VariableManager]: TermVariabe |f2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,888 WARN L322 ript$VariableManager]: TermVariabe |f2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,891 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,892 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,892 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,892 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,892 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,892 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,893 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,893 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_~ptr#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,893 WARN L322 ript$VariableManager]: TermVariabe |f1Thread1of1ForFork1_~ptr#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:41:00,903 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-20 20:41:00,950 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:41:00,958 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 20:41:00,959 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 20:41:00,971 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 95 transitions, 206 flow [2022-02-20 20:41:01,016 INFO L129 PetriNetUnfolder]: 1/93 cut-off events. [2022-02-20 20:41:01,016 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:41:01,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 93 events. 1/93 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-02-20 20:41:01,020 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 95 transitions, 206 flow [2022-02-20 20:41:01,024 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 71 transitions, 148 flow [2022-02-20 20:41:01,048 INFO L129 PetriNetUnfolder]: 0/68 cut-off events. [2022-02-20 20:41:01,048 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:41:01,048 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:41:01,049 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:41:01,050 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, f1Err0ASSERT_VIOLATIONERROR_FUNCTION, f1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:41:01,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:41:01,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1366006769, now seen corresponding path program 1 times [2022-02-20 20:41:01,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:41:01,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313965199] [2022-02-20 20:41:01,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:41:01,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:41:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:41:01,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {104#true} [170] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {104#true} [151] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {104#true} is VALID [2022-02-20 20:41:01,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {104#true} [178] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {104#true} [179] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,514 INFO L290 TraceCheckUtils]: 4: Hoare triple {104#true} [133] L18-->L18-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {104#true} [171] L18-1-->L18-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {104#true} [158] L18-2-->L18-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {104#true} [162] L18-3-->L18-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 42 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {104#true} [163] L18-4-->L1359: Formula: (and (= (select |v_#valid_4| 3) 1) (= 8 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {104#true} [127] L1359-->L1352: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {104#true} is VALID [2022-02-20 20:41:01,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {104#true} [152] L1352-->L1352-1: Formula: (and (= |v_~#mut~0.offset_1| 0) (= |v_~#mut~0.base_1| 4)) InVars {} OutVars{~#mut~0.offset=|v_~#mut~0.offset_1|, ~#mut~0.base=|v_~#mut~0.base_1|} AuxVars[] AssignedVars[~#mut~0.base, ~#mut~0.offset] {104#true} is VALID [2022-02-20 20:41:01,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {104#true} [149] L1352-1-->L1352-2: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {104#true} [144] L1352-2-->L1352-3: Formula: (= (select (select |v_#memory_int_3| |v_~#mut~0.base_2|) |v_~#mut~0.offset_2|) 0) InVars {~#mut~0.offset=|v_~#mut~0.offset_2|, #memory_int=|v_#memory_int_3|, ~#mut~0.base=|v_~#mut~0.base_2|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_2|, #memory_int=|v_#memory_int_3|, ~#mut~0.base=|v_~#mut~0.base_2|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {104#true} [181] L1352-3-->L1352-4: Formula: (= (select (select |v_#memory_int_4| |v_~#mut~0.base_3|) (+ |v_~#mut~0.offset_3| 4)) 0) InVars {~#mut~0.offset=|v_~#mut~0.offset_3|, #memory_int=|v_#memory_int_4|, ~#mut~0.base=|v_~#mut~0.base_3|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_3|, #memory_int=|v_#memory_int_4|, ~#mut~0.base=|v_~#mut~0.base_3|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {104#true} [136] L1352-4-->L1352-5: Formula: (= (select (select |v_#memory_int_5| |v_~#mut~0.base_4|) (+ |v_~#mut~0.offset_4| 8)) 0) InVars {~#mut~0.offset=|v_~#mut~0.offset_4|, #memory_int=|v_#memory_int_5|, ~#mut~0.base=|v_~#mut~0.base_4|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_4|, #memory_int=|v_#memory_int_5|, ~#mut~0.base=|v_~#mut~0.base_4|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {104#true} [100] L1352-5-->L1352-6: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_6| |v_~#mut~0.base_5|) (+ |v_~#mut~0.offset_5| 12))) InVars {~#mut~0.offset=|v_~#mut~0.offset_5|, #memory_int=|v_#memory_int_6|, ~#mut~0.base=|v_~#mut~0.base_5|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_5|, #memory_int=|v_#memory_int_6|, ~#mut~0.base=|v_~#mut~0.base_5|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {104#true} [190] L1352-6-->L1352-7: Formula: (= (select (select |v_#memory_int_7| |v_~#mut~0.base_6|) (+ 16 |v_~#mut~0.offset_6|)) 0) InVars {~#mut~0.offset=|v_~#mut~0.offset_6|, #memory_int=|v_#memory_int_7|, ~#mut~0.base=|v_~#mut~0.base_6|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_6|, #memory_int=|v_#memory_int_7|, ~#mut~0.base=|v_~#mut~0.base_6|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {104#true} [173] L1352-7-->L1353: Formula: (and (= |v_~#cond~0.offset_1| 0) (= |v_~#cond~0.base_1| 5)) InVars {} OutVars{~#cond~0.base=|v_~#cond~0.base_1|, ~#cond~0.offset=|v_~#cond~0.offset_1|} AuxVars[] AssignedVars[~#cond~0.base, ~#cond~0.offset] {104#true} is VALID [2022-02-20 20:41:01,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {104#true} [156] L1353-->L1353-1: Formula: (and (= 48 (select |v_#length_5| 5)) (= (select |v_#valid_6| 5) 1)) InVars {#length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {104#true} [176] L1353-1-->L1353-2: Formula: (= (select (select |v_#memory_int_8| |v_~#cond~0.base_2|) |v_~#cond~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#cond~0.base=|v_~#cond~0.base_2|, ~#cond~0.offset=|v_~#cond~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#cond~0.base=|v_~#cond~0.base_2|, ~#cond~0.offset=|v_~#cond~0.offset_2|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {104#true} [134] L1353-2-->L1353-3: Formula: (= (select (select |v_#memory_int_9| |v_~#cond~0.base_3|) (+ |v_~#cond~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#cond~0.base=|v_~#cond~0.base_3|, ~#cond~0.offset=|v_~#cond~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#cond~0.base=|v_~#cond~0.base_3|, ~#cond~0.offset=|v_~#cond~0.offset_3|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {104#true} [164] L1353-3-->L1353-4: Formula: (= (select (select |v_#memory_int_10| |v_~#cond~0.base_4|) (+ |v_~#cond~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#cond~0.base=|v_~#cond~0.base_4|, ~#cond~0.offset=|v_~#cond~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#cond~0.base=|v_~#cond~0.base_4|, ~#cond~0.offset=|v_~#cond~0.offset_4|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,522 INFO L290 TraceCheckUtils]: 22: Hoare triple {104#true} [155] L1353-4-->L1353-5: Formula: (= (select (select |v_#memory_int_11| |v_~#cond~0.base_5|) (+ |v_~#cond~0.offset_5| 12)) 0) InVars {#memory_int=|v_#memory_int_11|, ~#cond~0.base=|v_~#cond~0.base_5|, ~#cond~0.offset=|v_~#cond~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#cond~0.base=|v_~#cond~0.base_5|, ~#cond~0.offset=|v_~#cond~0.offset_5|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {104#true} [138] L1353-5-->L1353-6: Formula: (= (select (select |v_#memory_int_12| |v_~#cond~0.base_6|) (+ 16 |v_~#cond~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#cond~0.base=|v_~#cond~0.base_6|, ~#cond~0.offset=|v_~#cond~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#cond~0.base=|v_~#cond~0.base_6|, ~#cond~0.offset=|v_~#cond~0.offset_6|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {104#true} [169] L1353-6-->L1353-7: Formula: (= (select (select |v_#memory_int_13| |v_~#cond~0.base_7|) (+ |v_~#cond~0.offset_7| 20)) 0) InVars {#memory_int=|v_#memory_int_13|, ~#cond~0.base=|v_~#cond~0.base_7|, ~#cond~0.offset=|v_~#cond~0.offset_7|} OutVars{#memory_int=|v_#memory_int_13|, ~#cond~0.base=|v_~#cond~0.base_7|, ~#cond~0.offset=|v_~#cond~0.offset_7|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {104#true} [132] L1353-7-->L1353-8: Formula: (= (select (select |v_#memory_int_14| |v_~#cond~0.base_8|) (+ |v_~#cond~0.offset_8| 24)) 0) InVars {#memory_int=|v_#memory_int_14|, ~#cond~0.base=|v_~#cond~0.base_8|, ~#cond~0.offset=|v_~#cond~0.offset_8|} OutVars{#memory_int=|v_#memory_int_14|, ~#cond~0.base=|v_~#cond~0.base_8|, ~#cond~0.offset=|v_~#cond~0.offset_8|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {104#true} [109] L1353-8-->L1353-9: Formula: (= (select (select |v_#memory_int_15| |v_~#cond~0.base_9|) (+ |v_~#cond~0.offset_9| 28)) 0) InVars {#memory_int=|v_#memory_int_15|, ~#cond~0.base=|v_~#cond~0.base_9|, ~#cond~0.offset=|v_~#cond~0.offset_9|} OutVars{#memory_int=|v_#memory_int_15|, ~#cond~0.base=|v_~#cond~0.base_9|, ~#cond~0.offset=|v_~#cond~0.offset_9|} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {104#true} [189] L1353-9-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {104#true} [185] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {104#true} is VALID [2022-02-20 20:41:01,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {104#true} [159] L-1-4-->L-1-5: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {104#true} is VALID [2022-02-20 20:41:01,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {104#true} [121] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {104#true} is VALID [2022-02-20 20:41:01,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {104#true} [157] L-1-6-->L1371: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~ret10#1=|v_ULTIMATE.start_main_#t~ret10#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~ret10#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_~#t2~0#1.base] {104#true} is VALID [2022-02-20 20:41:01,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {104#true} [120] L1371-->L1371-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {104#true} is VALID [2022-02-20 20:41:01,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {104#true} [150] L1371-1-->L1373: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {104#true} is VALID [2022-02-20 20:41:01,535 INFO L290 TraceCheckUtils]: 34: Hoare triple {104#true} [191] L1373-->L1373-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {104#true} is VALID [2022-02-20 20:41:01,535 INFO L290 TraceCheckUtils]: 35: Hoare triple {104#true} [146] L1373-1-->L1374: Formula: (and (= |v_#length_8| (store |v_#length_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= (store |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_9|) (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, #valid=|v_#valid_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {104#true} is VALID [2022-02-20 20:41:01,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {104#true} [167] L1374-->L1375: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1] {104#true} is VALID [2022-02-20 20:41:01,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {104#true} [107] L1375-->L1375-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {104#true} is VALID [2022-02-20 20:41:01,536 INFO L290 TraceCheckUtils]: 38: Hoare triple {104#true} [117] L1375-1-->L1375-2: Formula: (= |v_#memory_int_16| (store |v_#memory_int_17| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_17| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre8#1_3|))) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_16|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {104#true} is VALID [2022-02-20 20:41:01,536 INFO L290 TraceCheckUtils]: 39: Hoare triple {104#true} [225] L1375-2-->f1ENTRY: Formula: (and (= |v_f1Thread1of1ForFork1_#in~ptr#1.base_4| 0) (= |v_f1Thread1of1ForFork1_#in~ptr#1.offset_4| 0) (= v_f1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre8#1_6| v_f1Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|} OutVars{f1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_f1Thread1of1ForFork1___VERIFIER_assert_~cond#1_10|, f1Thread1of1ForFork1_#t~nondet5#1=|v_f1Thread1of1ForFork1_#t~nondet5#1_6|, f1Thread1of1ForFork1_#res#1.offset=|v_f1Thread1of1ForFork1_#res#1.offset_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|, f1Thread1of1ForFork1_~ptr#1.base=|v_f1Thread1of1ForFork1_~ptr#1.base_4|, f1Thread1of1ForFork1_#res#1.base=|v_f1Thread1of1ForFork1_#res#1.base_4|, f1Thread1of1ForFork1_#t~nondet4#1=|v_f1Thread1of1ForFork1_#t~nondet4#1_6|, f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1=|v_f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_6|, f1Thread1of1ForFork1_#t~nondet6#1=|v_f1Thread1of1ForFork1_#t~nondet6#1_4|, f1Thread1of1ForFork1_~ptr#1.offset=|v_f1Thread1of1ForFork1_~ptr#1.offset_4|, f1Thread1of1ForFork1_#in~ptr#1.base=|v_f1Thread1of1ForFork1_#in~ptr#1.base_4|, f1Thread1of1ForFork1_thidvar1=v_f1Thread1of1ForFork1_thidvar1_2, f1Thread1of1ForFork1_thidvar0=v_f1Thread1of1ForFork1_thidvar0_2, f1Thread1of1ForFork1_#in~ptr#1.offset=|v_f1Thread1of1ForFork1_#in~ptr#1.offset_4|} AuxVars[] AssignedVars[f1Thread1of1ForFork1___VERIFIER_assert_~cond#1, f1Thread1of1ForFork1_#t~nondet5#1, f1Thread1of1ForFork1_#res#1.offset, f1Thread1of1ForFork1_~ptr#1.base, f1Thread1of1ForFork1_#res#1.base, f1Thread1of1ForFork1_#t~nondet4#1, f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1, f1Thread1of1ForFork1_#t~nondet6#1, f1Thread1of1ForFork1_~ptr#1.offset, f1Thread1of1ForFork1_#in~ptr#1.base, f1Thread1of1ForFork1_thidvar1, f1Thread1of1ForFork1_thidvar0, f1Thread1of1ForFork1_#in~ptr#1.offset] {104#true} is VALID [2022-02-20 20:41:01,537 INFO L290 TraceCheckUtils]: 40: Hoare triple {104#true} [193] f1ENTRY-->L1355: Formula: (and (= |v_f1Thread1of1ForFork1_#in~ptr#1.offset_1| |v_f1Thread1of1ForFork1_~ptr#1.offset_1|) (= |v_f1Thread1of1ForFork1_~ptr#1.base_1| |v_f1Thread1of1ForFork1_#in~ptr#1.base_1|)) InVars {f1Thread1of1ForFork1_#in~ptr#1.base=|v_f1Thread1of1ForFork1_#in~ptr#1.base_1|, f1Thread1of1ForFork1_#in~ptr#1.offset=|v_f1Thread1of1ForFork1_#in~ptr#1.offset_1|} OutVars{f1Thread1of1ForFork1_~ptr#1.offset=|v_f1Thread1of1ForFork1_~ptr#1.offset_1|, f1Thread1of1ForFork1_#in~ptr#1.base=|v_f1Thread1of1ForFork1_#in~ptr#1.base_1|, f1Thread1of1ForFork1_~ptr#1.base=|v_f1Thread1of1ForFork1_~ptr#1.base_1|, f1Thread1of1ForFork1_#in~ptr#1.offset=|v_f1Thread1of1ForFork1_#in~ptr#1.offset_1|} AuxVars[] AssignedVars[f1Thread1of1ForFork1_~ptr#1.offset, f1Thread1of1ForFork1_~ptr#1.base] {104#true} is VALID [2022-02-20 20:41:01,537 INFO L290 TraceCheckUtils]: 41: Hoare triple {104#true} [194] L1355-->L1355-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#mut~0.base_7|))) (and (= (select .cse0 |v_~#mut~0.offset_7|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#mut~0.base_7| (store .cse0 |v_~#mut~0.offset_7| 1))) (= |v_f1Thread1of1ForFork1_#t~nondet4#1_1| 0))) InVars {~#mut~0.offset=|v_~#mut~0.offset_7|, #pthreadsMutex=|v_#pthreadsMutex_2|, ~#mut~0.base=|v_~#mut~0.base_7|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_7|, #pthreadsMutex=|v_#pthreadsMutex_1|, ~#mut~0.base=|v_~#mut~0.base_7|, f1Thread1of1ForFork1_#t~nondet4#1=|v_f1Thread1of1ForFork1_#t~nondet4#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, f1Thread1of1ForFork1_#t~nondet4#1] {104#true} is VALID [2022-02-20 20:41:01,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {104#true} [195] L1355-1-->L1356: Formula: true InVars {} OutVars{f1Thread1of1ForFork1_#t~nondet4#1=|v_f1Thread1of1ForFork1_#t~nondet4#1_3|} AuxVars[] AssignedVars[f1Thread1of1ForFork1_#t~nondet4#1] {104#true} is VALID [2022-02-20 20:41:01,538 INFO L290 TraceCheckUtils]: 43: Hoare triple {104#true} [196] L1356-->L1357: Formula: (= v_~g~0_2 1) InVars {} OutVars{~g~0=v_~g~0_2} AuxVars[] AssignedVars[~g~0] {106#(= ~g~0 1)} is VALID [2022-02-20 20:41:01,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {106#(= ~g~0 1)} [197] L1357-->L1357-1: Formula: (= (store |v_#pthreadsMutex_4| |v_~#mut~0.base_8| (store (select |v_#pthreadsMutex_4| |v_~#mut~0.base_8|) |v_~#mut~0.offset_8| 0)) |v_#pthreadsMutex_3|) InVars {~#mut~0.offset=|v_~#mut~0.offset_8|, #pthreadsMutex=|v_#pthreadsMutex_4|, ~#mut~0.base=|v_~#mut~0.base_8|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_8|, #pthreadsMutex=|v_#pthreadsMutex_3|, ~#mut~0.base=|v_~#mut~0.base_8|} AuxVars[] AssignedVars[#pthreadsMutex] {106#(= ~g~0 1)} is VALID [2022-02-20 20:41:01,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {106#(= ~g~0 1)} [198] L1357-1-->L1357-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#mut~0.base_9|))) (and (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#mut~0.base_9| (store .cse0 |v_~#mut~0.offset_9| 1))) (= (select .cse0 |v_~#mut~0.offset_9|) 0) (= |v_f1Thread1of1ForFork1_#t~nondet5#1_1| 0))) InVars {~#mut~0.offset=|v_~#mut~0.offset_9|, #pthreadsMutex=|v_#pthreadsMutex_6|, ~#mut~0.base=|v_~#mut~0.base_9|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_9|, #pthreadsMutex=|v_#pthreadsMutex_5|, ~#mut~0.base=|v_~#mut~0.base_9|, f1Thread1of1ForFork1_#t~nondet5#1=|v_f1Thread1of1ForFork1_#t~nondet5#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, f1Thread1of1ForFork1_#t~nondet5#1] {106#(= ~g~0 1)} is VALID [2022-02-20 20:41:01,540 INFO L290 TraceCheckUtils]: 46: Hoare triple {106#(= ~g~0 1)} [199] L1357-2-->L1358: Formula: true InVars {} OutVars{f1Thread1of1ForFork1_#t~nondet5#1=|v_f1Thread1of1ForFork1_#t~nondet5#1_3|} AuxVars[] AssignedVars[f1Thread1of1ForFork1_#t~nondet5#1] {106#(= ~g~0 1)} is VALID [2022-02-20 20:41:01,540 INFO L290 TraceCheckUtils]: 47: Hoare triple {106#(= ~g~0 1)} [200] L1358-->L1358-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#(= ~g~0 1)} is VALID [2022-02-20 20:41:01,541 INFO L290 TraceCheckUtils]: 48: Hoare triple {106#(= ~g~0 1)} [201] L1358-1-->L1358-2: Formula: (= (ite (= v_~g~0_3 1) 1 0) |v_f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_1|) InVars {~g~0=v_~g~0_3} OutVars{f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1=|v_f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_3} AuxVars[] AssignedVars[f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1] {107#(not (= |f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:41:01,544 INFO L290 TraceCheckUtils]: 49: Hoare triple {107#(not (= |f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| 0))} [202] L1358-2-->L19: Formula: true InVars {} OutVars{f1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_f1Thread1of1ForFork1___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[f1Thread1of1ForFork1___VERIFIER_assert_~cond#1] {107#(not (= |f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:41:01,546 INFO L290 TraceCheckUtils]: 50: Hoare triple {107#(not (= |f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| 0))} [203] L19-->L19-1: Formula: (= |v_f1Thread1of1ForFork1___VERIFIER_assert_~cond#1_3| |v_f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_3|) InVars {f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1=|v_f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_3|} OutVars{f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1=|v_f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_3|, f1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_f1Thread1of1ForFork1___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[f1Thread1of1ForFork1___VERIFIER_assert_~cond#1] {108#(not (= |f1Thread1of1ForFork1___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:41:01,549 INFO L290 TraceCheckUtils]: 51: Hoare triple {108#(not (= |f1Thread1of1ForFork1___VERIFIER_assert_~cond#1| 0))} [204] L19-1-->L19-2: Formula: (= |v_f1Thread1of1ForFork1___VERIFIER_assert_~cond#1_5| 0) InVars {f1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_f1Thread1of1ForFork1___VERIFIER_assert_~cond#1_5|} OutVars{f1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_f1Thread1of1ForFork1___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[] {105#false} is VALID [2022-02-20 20:41:01,551 INFO L290 TraceCheckUtils]: 52: Hoare triple {105#false} [206] L19-2-->f1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#false} is VALID [2022-02-20 20:41:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:41:01,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:41:01,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313965199] [2022-02-20 20:41:01,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313965199] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:41:01,553 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:41:01,553 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:41:01,555 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324974322] [2022-02-20 20:41:01,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:41:01,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 20:41:01,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:41:01,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:41:01,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:41:01,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:41:01,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:41:01,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:41:01,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:41:01,650 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 95 [2022-02-20 20:41:01,657 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:41:01,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:41:01,658 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 95 [2022-02-20 20:41:01,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:41:01,797 INFO L129 PetriNetUnfolder]: 6/114 cut-off events. [2022-02-20 20:41:01,797 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-02-20 20:41:01,798 INFO L84 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 114 events. 6/114 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 222 event pairs, 0 based on Foata normal form. 4/118 useless extension candidates. Maximal degree in co-relation 112. Up to 10 conditions per place. [2022-02-20 20:41:01,799 INFO L132 encePairwiseOnDemand]: 90/95 looper letters, 8 selfloop transitions, 2 changer transitions 10/82 dead transitions. [2022-02-20 20:41:01,799 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 219 flow [2022-02-20 20:41:01,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:41:01,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:41:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 582 transitions. [2022-02-20 20:41:01,834 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8751879699248121 [2022-02-20 20:41:01,834 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 582 transitions. [2022-02-20 20:41:01,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 582 transitions. [2022-02-20 20:41:01,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:41:01,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 582 transitions. [2022-02-20 20:41:01,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 83.14285714285714) internal successors, (582), 7 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:41:01,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 95.0) internal successors, (760), 8 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:41:01,847 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 95.0) internal successors, (760), 8 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:41:01,849 INFO L186 Difference]: Start difference. First operand has 78 places, 71 transitions, 148 flow. Second operand 7 states and 582 transitions. [2022-02-20 20:41:01,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 219 flow [2022-02-20 20:41:01,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 82 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:41:01,853 INFO L242 Difference]: Finished difference. Result has 87 places, 71 transitions, 162 flow [2022-02-20 20:41:01,854 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=87, PETRI_TRANSITIONS=71} [2022-02-20 20:41:01,856 INFO L334 CegarLoopForPetriNet]: 78 programPoint places, 9 predicate places. [2022-02-20 20:41:01,857 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 87 places, 71 transitions, 162 flow [2022-02-20 20:41:01,877 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 416 states, 415 states have (on average 2.2265060240963854) internal successors, (924), 415 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:41:01,879 INFO L78 Accepts]: Start accepts. Automaton has has 416 states, 415 states have (on average 2.2265060240963854) internal successors, (924), 415 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 20:41:01,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:41:01,879 INFO L470 AbstractCegarLoop]: Abstraction has has 87 places, 71 transitions, 162 flow [2022-02-20 20:41:01,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:41:01,880 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:41:01,880 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:41:01,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:41:01,881 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, f1Err0ASSERT_VIOLATIONERROR_FUNCTION, f1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:41:01,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:41:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1416224719, now seen corresponding path program 1 times [2022-02-20 20:41:01,881 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:41:01,881 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885936827] [2022-02-20 20:41:01,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:41:01,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:41:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:41:02,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {538#true} [170] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} [151] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {538#true} is VALID [2022-02-20 20:41:02,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} [178] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {538#true} [179] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {538#true} [133] L18-->L18-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} [171] L18-1-->L18-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {538#true} [158] L18-2-->L18-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#true} [162] L18-3-->L18-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 42 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#true} [163] L18-4-->L1359: Formula: (and (= (select |v_#valid_4| 3) 1) (= 8 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#true} [127] L1359-->L1352: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {538#true} is VALID [2022-02-20 20:41:02,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {538#true} [152] L1352-->L1352-1: Formula: (and (= |v_~#mut~0.offset_1| 0) (= |v_~#mut~0.base_1| 4)) InVars {} OutVars{~#mut~0.offset=|v_~#mut~0.offset_1|, ~#mut~0.base=|v_~#mut~0.base_1|} AuxVars[] AssignedVars[~#mut~0.base, ~#mut~0.offset] {538#true} is VALID [2022-02-20 20:41:02,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {538#true} [149] L1352-1-->L1352-2: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {538#true} [144] L1352-2-->L1352-3: Formula: (= (select (select |v_#memory_int_3| |v_~#mut~0.base_2|) |v_~#mut~0.offset_2|) 0) InVars {~#mut~0.offset=|v_~#mut~0.offset_2|, #memory_int=|v_#memory_int_3|, ~#mut~0.base=|v_~#mut~0.base_2|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_2|, #memory_int=|v_#memory_int_3|, ~#mut~0.base=|v_~#mut~0.base_2|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {538#true} [181] L1352-3-->L1352-4: Formula: (= (select (select |v_#memory_int_4| |v_~#mut~0.base_3|) (+ |v_~#mut~0.offset_3| 4)) 0) InVars {~#mut~0.offset=|v_~#mut~0.offset_3|, #memory_int=|v_#memory_int_4|, ~#mut~0.base=|v_~#mut~0.base_3|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_3|, #memory_int=|v_#memory_int_4|, ~#mut~0.base=|v_~#mut~0.base_3|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {538#true} [136] L1352-4-->L1352-5: Formula: (= (select (select |v_#memory_int_5| |v_~#mut~0.base_4|) (+ |v_~#mut~0.offset_4| 8)) 0) InVars {~#mut~0.offset=|v_~#mut~0.offset_4|, #memory_int=|v_#memory_int_5|, ~#mut~0.base=|v_~#mut~0.base_4|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_4|, #memory_int=|v_#memory_int_5|, ~#mut~0.base=|v_~#mut~0.base_4|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {538#true} [100] L1352-5-->L1352-6: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_6| |v_~#mut~0.base_5|) (+ |v_~#mut~0.offset_5| 12))) InVars {~#mut~0.offset=|v_~#mut~0.offset_5|, #memory_int=|v_#memory_int_6|, ~#mut~0.base=|v_~#mut~0.base_5|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_5|, #memory_int=|v_#memory_int_6|, ~#mut~0.base=|v_~#mut~0.base_5|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {538#true} [190] L1352-6-->L1352-7: Formula: (= (select (select |v_#memory_int_7| |v_~#mut~0.base_6|) (+ 16 |v_~#mut~0.offset_6|)) 0) InVars {~#mut~0.offset=|v_~#mut~0.offset_6|, #memory_int=|v_#memory_int_7|, ~#mut~0.base=|v_~#mut~0.base_6|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_6|, #memory_int=|v_#memory_int_7|, ~#mut~0.base=|v_~#mut~0.base_6|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {538#true} [173] L1352-7-->L1353: Formula: (and (= |v_~#cond~0.offset_1| 0) (= |v_~#cond~0.base_1| 5)) InVars {} OutVars{~#cond~0.base=|v_~#cond~0.base_1|, ~#cond~0.offset=|v_~#cond~0.offset_1|} AuxVars[] AssignedVars[~#cond~0.base, ~#cond~0.offset] {538#true} is VALID [2022-02-20 20:41:02,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {538#true} [156] L1353-->L1353-1: Formula: (and (= 48 (select |v_#length_5| 5)) (= (select |v_#valid_6| 5) 1)) InVars {#length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {538#true} [176] L1353-1-->L1353-2: Formula: (= (select (select |v_#memory_int_8| |v_~#cond~0.base_2|) |v_~#cond~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#cond~0.base=|v_~#cond~0.base_2|, ~#cond~0.offset=|v_~#cond~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#cond~0.base=|v_~#cond~0.base_2|, ~#cond~0.offset=|v_~#cond~0.offset_2|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {538#true} [134] L1353-2-->L1353-3: Formula: (= (select (select |v_#memory_int_9| |v_~#cond~0.base_3|) (+ |v_~#cond~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#cond~0.base=|v_~#cond~0.base_3|, ~#cond~0.offset=|v_~#cond~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#cond~0.base=|v_~#cond~0.base_3|, ~#cond~0.offset=|v_~#cond~0.offset_3|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {538#true} [164] L1353-3-->L1353-4: Formula: (= (select (select |v_#memory_int_10| |v_~#cond~0.base_4|) (+ |v_~#cond~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#cond~0.base=|v_~#cond~0.base_4|, ~#cond~0.offset=|v_~#cond~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#cond~0.base=|v_~#cond~0.base_4|, ~#cond~0.offset=|v_~#cond~0.offset_4|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {538#true} [155] L1353-4-->L1353-5: Formula: (= (select (select |v_#memory_int_11| |v_~#cond~0.base_5|) (+ |v_~#cond~0.offset_5| 12)) 0) InVars {#memory_int=|v_#memory_int_11|, ~#cond~0.base=|v_~#cond~0.base_5|, ~#cond~0.offset=|v_~#cond~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#cond~0.base=|v_~#cond~0.base_5|, ~#cond~0.offset=|v_~#cond~0.offset_5|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {538#true} [138] L1353-5-->L1353-6: Formula: (= (select (select |v_#memory_int_12| |v_~#cond~0.base_6|) (+ 16 |v_~#cond~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#cond~0.base=|v_~#cond~0.base_6|, ~#cond~0.offset=|v_~#cond~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#cond~0.base=|v_~#cond~0.base_6|, ~#cond~0.offset=|v_~#cond~0.offset_6|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {538#true} [169] L1353-6-->L1353-7: Formula: (= (select (select |v_#memory_int_13| |v_~#cond~0.base_7|) (+ |v_~#cond~0.offset_7| 20)) 0) InVars {#memory_int=|v_#memory_int_13|, ~#cond~0.base=|v_~#cond~0.base_7|, ~#cond~0.offset=|v_~#cond~0.offset_7|} OutVars{#memory_int=|v_#memory_int_13|, ~#cond~0.base=|v_~#cond~0.base_7|, ~#cond~0.offset=|v_~#cond~0.offset_7|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {538#true} [132] L1353-7-->L1353-8: Formula: (= (select (select |v_#memory_int_14| |v_~#cond~0.base_8|) (+ |v_~#cond~0.offset_8| 24)) 0) InVars {#memory_int=|v_#memory_int_14|, ~#cond~0.base=|v_~#cond~0.base_8|, ~#cond~0.offset=|v_~#cond~0.offset_8|} OutVars{#memory_int=|v_#memory_int_14|, ~#cond~0.base=|v_~#cond~0.base_8|, ~#cond~0.offset=|v_~#cond~0.offset_8|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {538#true} [109] L1353-8-->L1353-9: Formula: (= (select (select |v_#memory_int_15| |v_~#cond~0.base_9|) (+ |v_~#cond~0.offset_9| 28)) 0) InVars {#memory_int=|v_#memory_int_15|, ~#cond~0.base=|v_~#cond~0.base_9|, ~#cond~0.offset=|v_~#cond~0.offset_9|} OutVars{#memory_int=|v_#memory_int_15|, ~#cond~0.base=|v_~#cond~0.base_9|, ~#cond~0.offset=|v_~#cond~0.offset_9|} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,019 INFO L290 TraceCheckUtils]: 27: Hoare triple {538#true} [189] L1353-9-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,019 INFO L290 TraceCheckUtils]: 28: Hoare triple {538#true} [185] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {538#true} is VALID [2022-02-20 20:41:02,019 INFO L290 TraceCheckUtils]: 29: Hoare triple {538#true} [159] L-1-4-->L-1-5: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {538#true} is VALID [2022-02-20 20:41:02,019 INFO L290 TraceCheckUtils]: 30: Hoare triple {538#true} [121] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {538#true} is VALID [2022-02-20 20:41:02,020 INFO L290 TraceCheckUtils]: 31: Hoare triple {538#true} [157] L-1-6-->L1371: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~ret10#1=|v_ULTIMATE.start_main_#t~ret10#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~ret10#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_~#t2~0#1.base] {538#true} is VALID [2022-02-20 20:41:02,020 INFO L290 TraceCheckUtils]: 32: Hoare triple {538#true} [120] L1371-->L1371-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {538#true} is VALID [2022-02-20 20:41:02,020 INFO L290 TraceCheckUtils]: 33: Hoare triple {538#true} [150] L1371-1-->L1373: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {538#true} is VALID [2022-02-20 20:41:02,020 INFO L290 TraceCheckUtils]: 34: Hoare triple {538#true} [191] L1373-->L1373-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {538#true} is VALID [2022-02-20 20:41:02,021 INFO L290 TraceCheckUtils]: 35: Hoare triple {538#true} [146] L1373-1-->L1374: Formula: (and (= |v_#length_8| (store |v_#length_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= (store |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_9|) (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, #valid=|v_#valid_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {538#true} is VALID [2022-02-20 20:41:02,021 INFO L290 TraceCheckUtils]: 36: Hoare triple {538#true} [167] L1374-->L1375: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1] {538#true} is VALID [2022-02-20 20:41:02,021 INFO L290 TraceCheckUtils]: 37: Hoare triple {538#true} [107] L1375-->L1375-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {538#true} is VALID [2022-02-20 20:41:02,021 INFO L290 TraceCheckUtils]: 38: Hoare triple {538#true} [117] L1375-1-->L1375-2: Formula: (= |v_#memory_int_16| (store |v_#memory_int_17| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_17| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre8#1_3|))) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_16|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {538#true} is VALID [2022-02-20 20:41:02,022 INFO L290 TraceCheckUtils]: 39: Hoare triple {538#true} [225] L1375-2-->f1ENTRY: Formula: (and (= |v_f1Thread1of1ForFork1_#in~ptr#1.base_4| 0) (= |v_f1Thread1of1ForFork1_#in~ptr#1.offset_4| 0) (= v_f1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre8#1_6| v_f1Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|} OutVars{f1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_f1Thread1of1ForFork1___VERIFIER_assert_~cond#1_10|, f1Thread1of1ForFork1_#t~nondet5#1=|v_f1Thread1of1ForFork1_#t~nondet5#1_6|, f1Thread1of1ForFork1_#res#1.offset=|v_f1Thread1of1ForFork1_#res#1.offset_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|, f1Thread1of1ForFork1_~ptr#1.base=|v_f1Thread1of1ForFork1_~ptr#1.base_4|, f1Thread1of1ForFork1_#res#1.base=|v_f1Thread1of1ForFork1_#res#1.base_4|, f1Thread1of1ForFork1_#t~nondet4#1=|v_f1Thread1of1ForFork1_#t~nondet4#1_6|, f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1=|v_f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_6|, f1Thread1of1ForFork1_#t~nondet6#1=|v_f1Thread1of1ForFork1_#t~nondet6#1_4|, f1Thread1of1ForFork1_~ptr#1.offset=|v_f1Thread1of1ForFork1_~ptr#1.offset_4|, f1Thread1of1ForFork1_#in~ptr#1.base=|v_f1Thread1of1ForFork1_#in~ptr#1.base_4|, f1Thread1of1ForFork1_thidvar1=v_f1Thread1of1ForFork1_thidvar1_2, f1Thread1of1ForFork1_thidvar0=v_f1Thread1of1ForFork1_thidvar0_2, f1Thread1of1ForFork1_#in~ptr#1.offset=|v_f1Thread1of1ForFork1_#in~ptr#1.offset_4|} AuxVars[] AssignedVars[f1Thread1of1ForFork1___VERIFIER_assert_~cond#1, f1Thread1of1ForFork1_#t~nondet5#1, f1Thread1of1ForFork1_#res#1.offset, f1Thread1of1ForFork1_~ptr#1.base, f1Thread1of1ForFork1_#res#1.base, f1Thread1of1ForFork1_#t~nondet4#1, f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1, f1Thread1of1ForFork1_#t~nondet6#1, f1Thread1of1ForFork1_~ptr#1.offset, f1Thread1of1ForFork1_#in~ptr#1.base, f1Thread1of1ForFork1_thidvar1, f1Thread1of1ForFork1_thidvar0, f1Thread1of1ForFork1_#in~ptr#1.offset] {538#true} is VALID [2022-02-20 20:41:02,022 INFO L290 TraceCheckUtils]: 40: Hoare triple {538#true} [193] f1ENTRY-->L1355: Formula: (and (= |v_f1Thread1of1ForFork1_#in~ptr#1.offset_1| |v_f1Thread1of1ForFork1_~ptr#1.offset_1|) (= |v_f1Thread1of1ForFork1_~ptr#1.base_1| |v_f1Thread1of1ForFork1_#in~ptr#1.base_1|)) InVars {f1Thread1of1ForFork1_#in~ptr#1.base=|v_f1Thread1of1ForFork1_#in~ptr#1.base_1|, f1Thread1of1ForFork1_#in~ptr#1.offset=|v_f1Thread1of1ForFork1_#in~ptr#1.offset_1|} OutVars{f1Thread1of1ForFork1_~ptr#1.offset=|v_f1Thread1of1ForFork1_~ptr#1.offset_1|, f1Thread1of1ForFork1_#in~ptr#1.base=|v_f1Thread1of1ForFork1_#in~ptr#1.base_1|, f1Thread1of1ForFork1_~ptr#1.base=|v_f1Thread1of1ForFork1_~ptr#1.base_1|, f1Thread1of1ForFork1_#in~ptr#1.offset=|v_f1Thread1of1ForFork1_#in~ptr#1.offset_1|} AuxVars[] AssignedVars[f1Thread1of1ForFork1_~ptr#1.offset, f1Thread1of1ForFork1_~ptr#1.base] {538#true} is VALID [2022-02-20 20:41:02,023 INFO L290 TraceCheckUtils]: 41: Hoare triple {538#true} [194] L1355-->L1355-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#mut~0.base_7|))) (and (= (select .cse0 |v_~#mut~0.offset_7|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#mut~0.base_7| (store .cse0 |v_~#mut~0.offset_7| 1))) (= |v_f1Thread1of1ForFork1_#t~nondet4#1_1| 0))) InVars {~#mut~0.offset=|v_~#mut~0.offset_7|, #pthreadsMutex=|v_#pthreadsMutex_2|, ~#mut~0.base=|v_~#mut~0.base_7|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_7|, #pthreadsMutex=|v_#pthreadsMutex_1|, ~#mut~0.base=|v_~#mut~0.base_7|, f1Thread1of1ForFork1_#t~nondet4#1=|v_f1Thread1of1ForFork1_#t~nondet4#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, f1Thread1of1ForFork1_#t~nondet4#1] {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} is VALID [2022-02-20 20:41:02,023 INFO L290 TraceCheckUtils]: 42: Hoare triple {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} [195] L1355-1-->L1356: Formula: true InVars {} OutVars{f1Thread1of1ForFork1_#t~nondet4#1=|v_f1Thread1of1ForFork1_#t~nondet4#1_3|} AuxVars[] AssignedVars[f1Thread1of1ForFork1_#t~nondet4#1] {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} is VALID [2022-02-20 20:41:02,024 INFO L290 TraceCheckUtils]: 43: Hoare triple {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} [196] L1356-->L1357: Formula: (= v_~g~0_2 1) InVars {} OutVars{~g~0=v_~g~0_2} AuxVars[] AssignedVars[~g~0] {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} is VALID [2022-02-20 20:41:02,024 INFO L290 TraceCheckUtils]: 44: Hoare triple {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} [137] L1375-3-->L1375-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1] {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} is VALID [2022-02-20 20:41:02,024 INFO L290 TraceCheckUtils]: 45: Hoare triple {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} [115] L1375-4-->L1376: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} is VALID [2022-02-20 20:41:02,025 INFO L290 TraceCheckUtils]: 46: Hoare triple {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} [141] L1376-->L1376-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret10#1=|v_ULTIMATE.start_main_#t~ret10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1] {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} is VALID [2022-02-20 20:41:02,025 INFO L290 TraceCheckUtils]: 47: Hoare triple {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} [106] L1376-1-->L1377: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret10#1=|v_ULTIMATE.start_main_#t~ret10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1] {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} is VALID [2022-02-20 20:41:02,026 INFO L290 TraceCheckUtils]: 48: Hoare triple {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} [140] L1377-->L1377-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} is VALID [2022-02-20 20:41:02,026 INFO L290 TraceCheckUtils]: 49: Hoare triple {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} [182] L1377-1-->L1377-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} is VALID [2022-02-20 20:41:02,026 INFO L290 TraceCheckUtils]: 50: Hoare triple {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} [180] L1377-2-->L1377-3: Formula: (= |v_#memory_int_18| (store |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre11#1_3|))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} is VALID [2022-02-20 20:41:02,027 INFO L290 TraceCheckUtils]: 51: Hoare triple {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} [223] L1377-3-->f2ENTRY: Formula: (and (= |v_f2Thread1of1ForFork0_#in~ptr.base_4| 0) (= v_f2Thread1of1ForFork0_thidvar2_2 0) (= v_f2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= |v_f2Thread1of1ForFork0_#in~ptr.offset_4| 0) (= v_f2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{f2Thread1of1ForFork0_thidvar2=v_f2Thread1of1ForFork0_thidvar2_2, f2Thread1of1ForFork0_thidvar1=v_f2Thread1of1ForFork0_thidvar1_2, f2Thread1of1ForFork0_thidvar0=v_f2Thread1of1ForFork0_thidvar0_2, f2Thread1of1ForFork0_~ptr.offset=v_f2Thread1of1ForFork0_~ptr.offset_4, f2Thread1of1ForFork0_#t~nondet7=|v_f2Thread1of1ForFork0_#t~nondet7_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, f2Thread1of1ForFork0_~ptr.base=v_f2Thread1of1ForFork0_~ptr.base_4, f2Thread1of1ForFork0_#res.base=|v_f2Thread1of1ForFork0_#res.base_4|, f2Thread1of1ForFork0_#res.offset=|v_f2Thread1of1ForFork0_#res.offset_4|, f2Thread1of1ForFork0_#in~ptr.offset=|v_f2Thread1of1ForFork0_#in~ptr.offset_4|, f2Thread1of1ForFork0_#in~ptr.base=|v_f2Thread1of1ForFork0_#in~ptr.base_4|} AuxVars[] AssignedVars[f2Thread1of1ForFork0_thidvar2, f2Thread1of1ForFork0_thidvar1, f2Thread1of1ForFork0_thidvar0, f2Thread1of1ForFork0_~ptr.offset, f2Thread1of1ForFork0_#t~nondet7, f2Thread1of1ForFork0_~ptr.base, f2Thread1of1ForFork0_#res.base, f2Thread1of1ForFork0_#res.offset, f2Thread1of1ForFork0_#in~ptr.offset, f2Thread1of1ForFork0_#in~ptr.base] {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} is VALID [2022-02-20 20:41:02,029 INFO L290 TraceCheckUtils]: 52: Hoare triple {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} [215] f2ENTRY-->L1365: Formula: (and (= v_f2Thread1of1ForFork0_~ptr.base_1 |v_f2Thread1of1ForFork0_#in~ptr.base_1|) (= v_f2Thread1of1ForFork0_~ptr.offset_1 |v_f2Thread1of1ForFork0_#in~ptr.offset_1|)) InVars {f2Thread1of1ForFork0_#in~ptr.offset=|v_f2Thread1of1ForFork0_#in~ptr.offset_1|, f2Thread1of1ForFork0_#in~ptr.base=|v_f2Thread1of1ForFork0_#in~ptr.base_1|} OutVars{f2Thread1of1ForFork0_~ptr.base=v_f2Thread1of1ForFork0_~ptr.base_1, f2Thread1of1ForFork0_~ptr.offset=v_f2Thread1of1ForFork0_~ptr.offset_1, f2Thread1of1ForFork0_#in~ptr.offset=|v_f2Thread1of1ForFork0_#in~ptr.offset_1|, f2Thread1of1ForFork0_#in~ptr.base=|v_f2Thread1of1ForFork0_#in~ptr.base_1|} AuxVars[] AssignedVars[f2Thread1of1ForFork0_~ptr.offset, f2Thread1of1ForFork0_~ptr.base] {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} is VALID [2022-02-20 20:41:02,029 INFO L290 TraceCheckUtils]: 53: Hoare triple {540#(= (select (select |#pthreadsMutex| |~#mut~0.base|) |~#mut~0.offset|) 1)} [216] L1365-->L1365-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#mut~0.base_12|))) (and (= |v_f2Thread1of1ForFork0_#t~nondet7_1| 0) (= (select .cse0 |v_~#mut~0.offset_12|) 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#mut~0.base_12| (store .cse0 |v_~#mut~0.offset_12| 1))))) InVars {~#mut~0.offset=|v_~#mut~0.offset_12|, #pthreadsMutex=|v_#pthreadsMutex_12|, ~#mut~0.base=|v_~#mut~0.base_12|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_12|, #pthreadsMutex=|v_#pthreadsMutex_11|, ~#mut~0.base=|v_~#mut~0.base_12|, f2Thread1of1ForFork0_#t~nondet7=|v_f2Thread1of1ForFork0_#t~nondet7_1|} AuxVars[] AssignedVars[#pthreadsMutex, f2Thread1of1ForFork0_#t~nondet7] {539#false} is VALID [2022-02-20 20:41:02,029 INFO L290 TraceCheckUtils]: 54: Hoare triple {539#false} [217] L1365-1-->L1366: Formula: true InVars {} OutVars{f2Thread1of1ForFork0_#t~nondet7=|v_f2Thread1of1ForFork0_#t~nondet7_3|} AuxVars[] AssignedVars[f2Thread1of1ForFork0_#t~nondet7] {539#false} is VALID [2022-02-20 20:41:02,030 INFO L290 TraceCheckUtils]: 55: Hoare triple {539#false} [218] L1366-->L1368: Formula: (= v_~g~0_5 0) InVars {} OutVars{~g~0=v_~g~0_5} AuxVars[] AssignedVars[~g~0] {539#false} is VALID [2022-02-20 20:41:02,030 INFO L290 TraceCheckUtils]: 56: Hoare triple {539#false} [197] L1357-->L1357-1: Formula: (= (store |v_#pthreadsMutex_4| |v_~#mut~0.base_8| (store (select |v_#pthreadsMutex_4| |v_~#mut~0.base_8|) |v_~#mut~0.offset_8| 0)) |v_#pthreadsMutex_3|) InVars {~#mut~0.offset=|v_~#mut~0.offset_8|, #pthreadsMutex=|v_#pthreadsMutex_4|, ~#mut~0.base=|v_~#mut~0.base_8|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_8|, #pthreadsMutex=|v_#pthreadsMutex_3|, ~#mut~0.base=|v_~#mut~0.base_8|} AuxVars[] AssignedVars[#pthreadsMutex] {539#false} is VALID [2022-02-20 20:41:02,030 INFO L290 TraceCheckUtils]: 57: Hoare triple {539#false} [198] L1357-1-->L1357-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#mut~0.base_9|))) (and (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#mut~0.base_9| (store .cse0 |v_~#mut~0.offset_9| 1))) (= (select .cse0 |v_~#mut~0.offset_9|) 0) (= |v_f1Thread1of1ForFork1_#t~nondet5#1_1| 0))) InVars {~#mut~0.offset=|v_~#mut~0.offset_9|, #pthreadsMutex=|v_#pthreadsMutex_6|, ~#mut~0.base=|v_~#mut~0.base_9|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_9|, #pthreadsMutex=|v_#pthreadsMutex_5|, ~#mut~0.base=|v_~#mut~0.base_9|, f1Thread1of1ForFork1_#t~nondet5#1=|v_f1Thread1of1ForFork1_#t~nondet5#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, f1Thread1of1ForFork1_#t~nondet5#1] {539#false} is VALID [2022-02-20 20:41:02,031 INFO L290 TraceCheckUtils]: 58: Hoare triple {539#false} [199] L1357-2-->L1358: Formula: true InVars {} OutVars{f1Thread1of1ForFork1_#t~nondet5#1=|v_f1Thread1of1ForFork1_#t~nondet5#1_3|} AuxVars[] AssignedVars[f1Thread1of1ForFork1_#t~nondet5#1] {539#false} is VALID [2022-02-20 20:41:02,031 INFO L290 TraceCheckUtils]: 59: Hoare triple {539#false} [200] L1358-->L1358-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#false} is VALID [2022-02-20 20:41:02,031 INFO L290 TraceCheckUtils]: 60: Hoare triple {539#false} [201] L1358-1-->L1358-2: Formula: (= (ite (= v_~g~0_3 1) 1 0) |v_f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_1|) InVars {~g~0=v_~g~0_3} OutVars{f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1=|v_f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_3} AuxVars[] AssignedVars[f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1] {539#false} is VALID [2022-02-20 20:41:02,032 INFO L290 TraceCheckUtils]: 61: Hoare triple {539#false} [202] L1358-2-->L19: Formula: true InVars {} OutVars{f1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_f1Thread1of1ForFork1___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[f1Thread1of1ForFork1___VERIFIER_assert_~cond#1] {539#false} is VALID [2022-02-20 20:41:02,033 INFO L290 TraceCheckUtils]: 62: Hoare triple {539#false} [203] L19-->L19-1: Formula: (= |v_f1Thread1of1ForFork1___VERIFIER_assert_~cond#1_3| |v_f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_3|) InVars {f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1=|v_f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_3|} OutVars{f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1=|v_f1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_3|, f1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_f1Thread1of1ForFork1___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[f1Thread1of1ForFork1___VERIFIER_assert_~cond#1] {539#false} is VALID [2022-02-20 20:41:02,039 INFO L290 TraceCheckUtils]: 63: Hoare triple {539#false} [204] L19-1-->L19-2: Formula: (= |v_f1Thread1of1ForFork1___VERIFIER_assert_~cond#1_5| 0) InVars {f1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_f1Thread1of1ForFork1___VERIFIER_assert_~cond#1_5|} OutVars{f1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_f1Thread1of1ForFork1___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[] {539#false} is VALID [2022-02-20 20:41:02,041 INFO L290 TraceCheckUtils]: 64: Hoare triple {539#false} [206] L19-2-->f1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#false} is VALID [2022-02-20 20:41:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:41:02,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:41:02,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885936827] [2022-02-20 20:41:02,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885936827] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:41:02,042 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:41:02,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:41:02,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397657499] [2022-02-20 20:41:02,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:41:02,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 20:41:02,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:41:02,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:41:02,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:41:02,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:41:02,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:41:02,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:41:02,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:41:02,102 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 95 [2022-02-20 20:41:02,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 71 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:41:02,103 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:41:02,103 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 95 [2022-02-20 20:41:02,103 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:41:02,140 INFO L129 PetriNetUnfolder]: 3/88 cut-off events. [2022-02-20 20:41:02,141 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-02-20 20:41:02,142 INFO L84 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 88 events. 3/88 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 87 event pairs, 1 based on Foata normal form. 4/90 useless extension candidates. Maximal degree in co-relation 123. Up to 13 conditions per place. [2022-02-20 20:41:02,142 INFO L132 encePairwiseOnDemand]: 90/95 looper letters, 9 selfloop transitions, 5 changer transitions 0/72 dead transitions. [2022-02-20 20:41:02,142 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 72 transitions, 194 flow [2022-02-20 20:41:02,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:41:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:41:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2022-02-20 20:41:02,146 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8701754385964913 [2022-02-20 20:41:02,146 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 248 transitions. [2022-02-20 20:41:02,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 248 transitions. [2022-02-20 20:41:02,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:41:02,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 248 transitions. [2022-02-20 20:41:02,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:41:02,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:41:02,150 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:41:02,150 INFO L186 Difference]: Start difference. First operand has 87 places, 71 transitions, 162 flow. Second operand 3 states and 248 transitions. [2022-02-20 20:41:02,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 72 transitions, 194 flow [2022-02-20 20:41:02,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 72 transitions, 184 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-02-20 20:41:02,154 INFO L242 Difference]: Finished difference. Result has 80 places, 71 transitions, 162 flow [2022-02-20 20:41:02,154 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=80, PETRI_TRANSITIONS=71} [2022-02-20 20:41:02,155 INFO L334 CegarLoopForPetriNet]: 78 programPoint places, 2 predicate places. [2022-02-20 20:41:02,155 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 71 transitions, 162 flow [2022-02-20 20:41:02,164 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 320 states, 317 states have (on average 2.0189274447949526) internal successors, (640), 319 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:41:02,164 INFO L78 Accepts]: Start accepts. Automaton has has 320 states, 317 states have (on average 2.0189274447949526) internal successors, (640), 319 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 20:41:02,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:41:02,165 INFO L470 AbstractCegarLoop]: Abstraction has has 80 places, 71 transitions, 162 flow [2022-02-20 20:41:02,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:41:02,165 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:41:02,165 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:41:02,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:41:02,166 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, f1Err0ASSERT_VIOLATIONERROR_FUNCTION, f1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:41:02,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:41:02,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1264517384, now seen corresponding path program 1 times [2022-02-20 20:41:02,167 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:41:02,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141332460] [2022-02-20 20:41:02,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:41:02,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:41:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:41:02,201 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:41:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:41:02,256 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:41:02,256 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:41:02,257 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-02-20 20:41:02,258 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-02-20 20:41:02,259 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-02-20 20:41:02,259 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-02-20 20:41:02,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:41:02,261 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 20:41:02,264 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:41:02,264 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:41:02,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:41:02 BasicIcfg [2022-02-20 20:41:02,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:41:02,300 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:41:02,300 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:41:02,300 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:41:02,301 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:41:00" (3/4) ... [2022-02-20 20:41:02,302 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 20:41:02,338 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:41:02,338 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:41:02,339 INFO L158 Benchmark]: Toolchain (without parser) took 2721.87ms. Allocated memory was 96.5MB in the beginning and 144.7MB in the end (delta: 48.2MB). Free memory was 62.7MB in the beginning and 61.7MB in the end (delta: 961.2kB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2022-02-20 20:41:02,339 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:41:02,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 588.40ms. Allocated memory is still 96.5MB. Free memory was 62.3MB in the beginning and 42.5MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 20:41:02,340 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.65ms. Allocated memory is still 96.5MB. Free memory was 42.5MB in the beginning and 39.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:41:02,340 INFO L158 Benchmark]: Boogie Preprocessor took 54.08ms. Allocated memory was 96.5MB in the beginning and 144.7MB in the end (delta: 48.2MB). Free memory was 39.4MB in the beginning and 122.0MB in the end (delta: -82.7MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2022-02-20 20:41:02,340 INFO L158 Benchmark]: RCFGBuilder took 479.97ms. Allocated memory is still 144.7MB. Free memory was 122.0MB in the beginning and 104.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 20:41:02,341 INFO L158 Benchmark]: TraceAbstraction took 1507.59ms. Allocated memory is still 144.7MB. Free memory was 103.1MB in the beginning and 75.3MB in the end (delta: 27.8MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2022-02-20 20:41:02,341 INFO L158 Benchmark]: Witness Printer took 38.12ms. Allocated memory is still 144.7MB. Free memory was 75.3MB in the beginning and 61.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 20:41:02,342 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 588.40ms. Allocated memory is still 96.5MB. Free memory was 62.3MB in the beginning and 42.5MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.65ms. Allocated memory is still 96.5MB. Free memory was 42.5MB in the beginning and 39.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.08ms. Allocated memory was 96.5MB in the beginning and 144.7MB in the end (delta: 48.2MB). Free memory was 39.4MB in the beginning and 122.0MB in the end (delta: -82.7MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * RCFGBuilder took 479.97ms. Allocated memory is still 144.7MB. Free memory was 122.0MB in the beginning and 104.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1507.59ms. Allocated memory is still 144.7MB. Free memory was 103.1MB in the beginning and 75.3MB in the end (delta: 27.8MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * Witness Printer took 38.12ms. Allocated memory is still 144.7MB. Free memory was 75.3MB in the beginning and 61.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1351] 0 int g; VAL [g=0] [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [g=0, mut={4:0}] [L1353] 0 pthread_cond_t cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; VAL [cond={5:0}, g=0, mut={4:0}] [L1373] 0 pthread_t t1; VAL [\old(argc)=1150, argc=1150, argv={1151:1152}, argv={1151:1152}, cond={5:0}, g=0, mut={4:0}, t1={7:0}] [L1374] 0 pthread_t t2; VAL [\old(argc)=1150, argc=1150, argv={1151:1152}, argv={1151:1152}, cond={5:0}, g=0, mut={4:0}, t1={7:0}, t2={6:0}] [L1375] FCALL, FORK 0 pthread_create(&t1,((void *)0),f1,((void *)0)) VAL [\old(argc)=1150, argc=1150, argv={1151:1152}, argv={1151:1152}, cond={5:0}, g=0, mut={4:0}, pthread_create(&t1,((void *)0),f1,((void *)0))=-1, t1={7:0}, t2={6:0}] [L1377] FCALL, FORK 0 pthread_create(&t2,((void *)0),f2,((void *)0)) VAL [\old(argc)=1150, argc=1150, argv={1151:1152}, argv={1151:1152}, cond={5:0}, g=0, mut={4:0}, pthread_create(&t2,((void *)0),f2,((void *)0))=0, ptr={0:0}, t1={7:0}, t2={6:0}] [L1356] 1 g = 1 VAL [cond={5:0}, g=1, mut={4:0}, ptr={0:0}, ptr={0:0}, ptr={0:0}, ptr={0:0}] [L1366] 2 g = 0 VAL [cond={5:0}, g=0, mut={4:0}, ptr={0:0}, ptr={0:0}] [L1358] CALL 1 __VERIFIER_assert(g == 1) [L19] COND TRUE 1 !(cond) VAL [\old(cond)=0, cond=0, cond={5:0}, g=0, mut={4:0}, ptr={0:0}, ptr={0:0}] [L19] 1 reach_error() VAL [\old(cond)=0, cond={5:0}, cond=0, g=0, mut={4:0}, ptr={0:0}, ptr={0:0}] - UnprovableResult [Line: 1377]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1375]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 127 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 17 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=1, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-20 20:41:02,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE