./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/read_write_lock-1.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/pthread-atomic/read_write_lock-1.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 8fab2e995569cc819974baee7d52d8d4bdabd2a2896c83fb3b8d07b44f394c5b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:09:58,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:09:58,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:09:58,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:09:58,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:09:58,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:09:58,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:09:58,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:09:58,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:09:58,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:09:58,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:09:58,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:09:58,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:09:58,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:09:58,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:09:58,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:09:58,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:09:58,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:09:58,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:09:58,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:09:58,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:09:58,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:09:58,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:09:58,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:09:58,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:09:58,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:09:58,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:09:58,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:09:58,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:09:58,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:09:58,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:09:58,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:09:58,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:09:58,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:09:58,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:09:58,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:09:58,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:09:58,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:09:58,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:09:58,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:09:58,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:09:58,341 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:09:58,381 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:09:58,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:09:58,384 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:09:58,384 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:09:58,385 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:09:58,385 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:09:58,385 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:09:58,385 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:09:58,386 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:09:58,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:09:58,387 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:09:58,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:09:58,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:09:58,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:09:58,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:09:58,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:09:58,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:09:58,388 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:09:58,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:09:58,388 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:09:58,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:09:58,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:09:58,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:09:58,389 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:09:58,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:09:58,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:09:58,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:09:58,390 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:09:58,390 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:09:58,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:09:58,390 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:09:58,390 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:09:58,391 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:09:58,391 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 -> 8fab2e995569cc819974baee7d52d8d4bdabd2a2896c83fb3b8d07b44f394c5b [2022-02-20 20:09:58,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:09:58,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:09:58,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:09:58,688 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:09:58,691 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:09:58,692 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-1.i [2022-02-20 20:09:58,748 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90dcafa06/b60652fa676a4729acdf62a16ddd4ff8/FLAGeb6ea32d0 [2022-02-20 20:09:59,219 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:09:59,219 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1.i [2022-02-20 20:09:59,236 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90dcafa06/b60652fa676a4729acdf62a16ddd4ff8/FLAGeb6ea32d0 [2022-02-20 20:09:59,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90dcafa06/b60652fa676a4729acdf62a16ddd4ff8 [2022-02-20 20:09:59,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:09:59,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:09:59,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:09:59,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:09:59,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:09:59,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:09:59" (1/1) ... [2022-02-20 20:09:59,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d4e1164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:59, skipping insertion in model container [2022-02-20 20:09:59,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:09:59" (1/1) ... [2022-02-20 20:09:59,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:09:59,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:09:59,721 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-02-20 20:09: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/pthread-atomic/read_write_lock-1.i[31246,31259] [2022-02-20 20:09:59,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:09:59,874 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:09:59,900 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-02-20 20:09:59,939 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/pthread-atomic/read_write_lock-1.i[31246,31259] [2022-02-20 20:09:59,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:09:59,988 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:09:59,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:59 WrapperNode [2022-02-20 20:09:59,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:09:59,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:09:59,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:09:59,990 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:09:59,997 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:09:59" (1/1) ... [2022-02-20 20:10:00,018 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:09:59" (1/1) ... [2022-02-20 20:10:00,053 INFO L137 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 114 [2022-02-20 20:10:00,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:10:00,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:10:00,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:10:00,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:10:00,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:59" (1/1) ... [2022-02-20 20:10:00,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:59" (1/1) ... [2022-02-20 20:10:00,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:59" (1/1) ... [2022-02-20 20:10:00,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:59" (1/1) ... [2022-02-20 20:10:00,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:59" (1/1) ... [2022-02-20 20:10:00,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:59" (1/1) ... [2022-02-20 20:10:00,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:59" (1/1) ... [2022-02-20 20:10:00,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:10:00,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:10:00,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:10:00,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:10:00,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:59" (1/1) ... [2022-02-20 20:10:00,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:10:00,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:10:00,173 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:10:00,217 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:10:00,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:10:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:10:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-20 20:10:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:10:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-02-20 20:10:00,232 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-02-20 20:10:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:10:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:10:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:10:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-20 20:10:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:10:00,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:10:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-02-20 20:10:00,234 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-02-20 20:10:00,235 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:10:00,385 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:10:00,386 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:10:00,673 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:10:00,723 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:10:00,727 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:10:00,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:10:00 BoogieIcfgContainer [2022-02-20 20:10:00,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:10:00,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:10:00,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:10:00,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:10:00,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:09:59" (1/3) ... [2022-02-20 20:10:00,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63578eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:10:00, skipping insertion in model container [2022-02-20 20:10:00,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:59" (2/3) ... [2022-02-20 20:10:00,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63578eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:10:00, skipping insertion in model container [2022-02-20 20:10:00,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:10:00" (3/3) ... [2022-02-20 20:10:00,738 INFO L111 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2022-02-20 20:10:00,744 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:10:00,744 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:10:00,744 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:10:00,744 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:10:00,829 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,829 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,830 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,830 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,830 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,830 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,830 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,831 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,831 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,833 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,833 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,833 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,833 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,833 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,834 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,835 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,835 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,835 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,835 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,835 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,836 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,836 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,836 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,836 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,836 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,837 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,837 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,837 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,837 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,837 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,838 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,838 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,838 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,838 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,839 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,839 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,839 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,839 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,840 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,840 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,840 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,840 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,840 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,841 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,841 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,841 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,842 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,842 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,842 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,844 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,844 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,845 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,845 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,845 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,845 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,846 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,846 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,846 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,846 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,846 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,847 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,847 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,847 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,847 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,848 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,848 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,848 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,848 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,849 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,849 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,850 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,850 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,850 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,850 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,850 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,851 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,852 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,852 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,852 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,853 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,854 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,855 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,855 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,856 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,856 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,857 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,857 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,857 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,857 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,860 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,861 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,861 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,861 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,862 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,862 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,862 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,862 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,863 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,863 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,863 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,866 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,869 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,869 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,870 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,870 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,870 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,870 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,870 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,871 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,872 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,872 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,872 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,872 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,873 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,873 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,874 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,875 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,875 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,875 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,875 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,875 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,877 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,877 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,877 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,877 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,878 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,878 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,878 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,878 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,878 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,905 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-02-20 20:10:00,945 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:10:00,951 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:10:00,952 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-20 20:10:00,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 256 flow [2022-02-20 20:10:01,021 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2022-02-20 20:10:01,021 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-02-20 20:10:01,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 108 events. 2/108 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-02-20 20:10:01,025 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 256 flow [2022-02-20 20:10:01,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 94 transitions, 209 flow [2022-02-20 20:10:01,044 INFO L129 PetriNetUnfolder]: 1/59 cut-off events. [2022-02-20 20:10:01,045 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:10:01,045 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:10:01,046 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] [2022-02-20 20:10:01,046 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-02-20 20:10:01,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:10:01,053 INFO L85 PathProgramCache]: Analyzing trace with hash 764683200, now seen corresponding path program 1 times [2022-02-20 20:10:01,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:10:01,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820148027] [2022-02-20 20:10:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:10:01,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:10:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:10:01,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {126#true} [221] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-02-20 20:10:01,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#true} [199] 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] {126#true} is VALID [2022-02-20 20:10:01,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {126#true} [228] 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[] {126#true} is VALID [2022-02-20 20:10:01,338 INFO L290 TraceCheckUtils]: 3: Hoare triple {126#true} [230] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {126#true} is VALID [2022-02-20 20:10:01,339 INFO L290 TraceCheckUtils]: 4: Hoare triple {126#true} [190] L16-->L16-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[] {126#true} is VALID [2022-02-20 20:10:01,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {126#true} [151] L16-1-->L16-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[] {126#true} is VALID [2022-02-20 20:10:01,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {126#true} [235] L16-2-->L16-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[] {126#true} is VALID [2022-02-20 20:10:01,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {126#true} [210] L16-3-->L16-4: Formula: (and (= 20 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {126#true} is VALID [2022-02-20 20:10:01,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {126#true} [212] L16-4-->L704: Formula: (= v_~w~0_2 0) InVars {} OutVars{~w~0=v_~w~0_2} AuxVars[] AssignedVars[~w~0] {126#true} is VALID [2022-02-20 20:10:01,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {126#true} [224] L704-->L704-1: Formula: (= v_~r~0_5 0) InVars {} OutVars{~r~0=v_~r~0_5} AuxVars[] AssignedVars[~r~0] {126#true} is VALID [2022-02-20 20:10:01,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {126#true} [236] L704-1-->L704-2: Formula: (= v_~x~0_3 0) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] {126#true} is VALID [2022-02-20 20:10:01,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {126#true} [205] L704-2-->L-1-3: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {126#true} is VALID [2022-02-20 20:10:01,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {126#true} [231] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-02-20 20:10:01,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {126#true} [208] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-02-20 20:10:01,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {126#true} [173] 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] {126#true} is VALID [2022-02-20 20:10:01,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {126#true} [202] L-1-6-->L744: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#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_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_1|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_~#t2~0#1.base] {126#true} is VALID [2022-02-20 20:10:01,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {126#true} [196] L744-->L744-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, 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_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {126#true} is VALID [2022-02-20 20:10:01,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {126#true} [159] L744-1-->L744-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, 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_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {126#true} is VALID [2022-02-20 20:10:01,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {126#true} [177] L744-2-->L744-3: Formula: (and (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (store |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1) |v_#valid_8|) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4) |v_#length_7|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] {126#true} is VALID [2022-02-20 20:10:01,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {126#true} [165] L744-3-->L744-4: Formula: (and (= (store |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 1) |v_#valid_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_2| 0)) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2|) 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t4~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_10|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_2|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_2|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] {126#true} is VALID [2022-02-20 20:10:01,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {126#true} [192] L744-4-->L745: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {126#true} is VALID [2022-02-20 20:10:01,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {126#true} [160] L745-->L745-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {126#true} is VALID [2022-02-20 20:10:01,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {126#true} [219] L745-1-->L745-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {126#true} is VALID [2022-02-20 20:10:01,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {126#true} [283] L745-2-->writerENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_writerThread1of1ForFork2_thidvar0_2) (= v_writerThread1of1ForFork2_thidvar1_2 0) (= |v_writerThread1of1ForFork2_#in~arg#1.offset_4| 0) (= |v_writerThread1of1ForFork2_#in~arg#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{writerThread1of1ForFork2_~arg#1.base=|v_writerThread1of1ForFork2_~arg#1.base_4|, writerThread1of1ForFork2_#in~arg#1.offset=|v_writerThread1of1ForFork2_#in~arg#1.offset_4|, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_4|, writerThread1of1ForFork2_#in~arg#1.base=|v_writerThread1of1ForFork2_#in~arg#1.base_4|, writerThread1of1ForFork2_#res#1.base=|v_writerThread1of1ForFork2_#res#1.base_4|, writerThread1of1ForFork2_#res#1.offset=|v_writerThread1of1ForFork2_#res#1.offset_4|, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2, writerThread1of1ForFork2_thidvar1=v_writerThread1of1ForFork2_thidvar1_2, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, writerThread1of1ForFork2_~arg#1.offset=|v_writerThread1of1ForFork2_~arg#1.offset_4|} AuxVars[] AssignedVars[writerThread1of1ForFork2_~arg#1.base, writerThread1of1ForFork2_#in~arg#1.offset, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_#in~arg#1.base, writerThread1of1ForFork2_#res#1.base, writerThread1of1ForFork2_#res#1.offset, writerThread1of1ForFork2_thidvar0, writerThread1of1ForFork2_thidvar1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork2_~arg#1.offset] {126#true} is VALID [2022-02-20 20:10:01,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {126#true} [187] L745-3-->L745-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {126#true} is VALID [2022-02-20 20:10:01,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {126#true} [188] L745-4-->L746: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {126#true} is VALID [2022-02-20 20:10:01,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {126#true} [178] L746-->L746-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {126#true} is VALID [2022-02-20 20:10:01,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {126#true} [172] L746-1-->L746-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {126#true} is VALID [2022-02-20 20:10:01,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {126#true} [174] L746-2-->L746-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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_5|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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] {126#true} is VALID [2022-02-20 20:10:01,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {126#true} [279] L746-3-->readerENTRY: Formula: (and (= v_readerThread1of1ForFork0_thidvar1_2 0) (= |v_readerThread1of1ForFork0_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_readerThread1of1ForFork0_thidvar0_2) (= |v_readerThread1of1ForFork0_#in~arg#1.base_4| 0) (= v_readerThread1of1ForFork0_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{readerThread1of1ForFork0_thidvar2=v_readerThread1of1ForFork0_thidvar2_2, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_8|, readerThread1of1ForFork0_#in~arg#1.base=|v_readerThread1of1ForFork0_#in~arg#1.base_4|, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_#res#1.offset=|v_readerThread1of1ForFork0_#res#1.offset_4|, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, readerThread1of1ForFork0_#in~arg#1.offset=|v_readerThread1of1ForFork0_#in~arg#1.offset_4|, readerThread1of1ForFork0_~arg#1.base=|v_readerThread1of1ForFork0_~arg#1.base_4|, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_8|, readerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_4|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_8|, readerThread1of1ForFork0_~arg#1.offset=|v_readerThread1of1ForFork0_~arg#1.offset_4|, readerThread1of1ForFork0_#res#1.base=|v_readerThread1of1ForFork0_#res#1.base_4|, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[readerThread1of1ForFork0_thidvar2, readerThread1of1ForFork0_~l~0#1, readerThread1of1ForFork0_#in~arg#1.base, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_#res#1.offset, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_#in~arg#1.offset, readerThread1of1ForFork0_~arg#1.base, readerThread1of1ForFork0_~ly~0#1, readerThread1of1ForFork0_assume_abort_if_not_~cond#1, readerThread1of1ForFork0_~lx~0#1, readerThread1of1ForFork0_~arg#1.offset, readerThread1of1ForFork0_#res#1.base, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1] {126#true} is VALID [2022-02-20 20:10:01,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {126#true} [238] readerENTRY-->L725: Formula: (and (= |v_readerThread1of1ForFork0_#in~arg#1.offset_1| |v_readerThread1of1ForFork0_~arg#1.offset_1|) (= |v_readerThread1of1ForFork0_#in~arg#1.base_1| |v_readerThread1of1ForFork0_~arg#1.base_1|)) InVars {readerThread1of1ForFork0_#in~arg#1.base=|v_readerThread1of1ForFork0_#in~arg#1.base_1|, readerThread1of1ForFork0_#in~arg#1.offset=|v_readerThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{readerThread1of1ForFork0_~arg#1.base=|v_readerThread1of1ForFork0_~arg#1.base_1|, readerThread1of1ForFork0_#in~arg#1.base=|v_readerThread1of1ForFork0_#in~arg#1.base_1|, readerThread1of1ForFork0_~arg#1.offset=|v_readerThread1of1ForFork0_~arg#1.offset_1|, readerThread1of1ForFork0_#in~arg#1.offset=|v_readerThread1of1ForFork0_#in~arg#1.offset_1|} AuxVars[] AssignedVars[readerThread1of1ForFork0_~arg#1.offset, readerThread1of1ForFork0_~arg#1.base] {126#true} is VALID [2022-02-20 20:10:01,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {126#true} [239] L725-->L726: Formula: true InVars {} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1] {126#true} is VALID [2022-02-20 20:10:01,347 INFO L290 TraceCheckUtils]: 32: Hoare triple {126#true} [240] L726-->L726-1: Formula: (and (= |v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (= v_~r~0_35 (+ v_~r~0_36 1)) (= (ite (= v_~w~0_24 0) 1 0) |v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|))) InVars {~w~0=v_~w~0_24, ~r~0=v_~r~0_36} OutVars{~w~0=v_~w~0_24, readerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_35} AuxVars[] AssignedVars[readerThread1of1ForFork0_assume_abort_if_not_~cond#1, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~r~0] {126#true} is VALID [2022-02-20 20:10:01,347 INFO L290 TraceCheckUtils]: 33: Hoare triple {126#true} [241] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork0_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_3|, ~x~0=v_~x~0_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1] {128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0)} is VALID [2022-02-20 20:10:01,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0)} [242] L729-->L732: Formula: (= |v_readerThread1of1ForFork0_~l~0#1_5| v_~y~0_1) InVars {readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_5|} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_5|, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] {129#(= ~y~0 ~x~0)} is VALID [2022-02-20 20:10:01,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {129#(= ~y~0 ~x~0)} [243] L732-->L735: Formula: (= |v_readerThread1of1ForFork0_~ly~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork0_~ly~0#1] {130#(= ~x~0 |readerThread1of1ForFork0_~ly~0#1|)} is VALID [2022-02-20 20:10:01,349 INFO L290 TraceCheckUtils]: 36: Hoare triple {130#(= ~x~0 |readerThread1of1ForFork0_~ly~0#1|)} [244] L735-->L738: Formula: (= |v_readerThread1of1ForFork0_~lx~0#1_1| v_~x~0_2) InVars {~x~0=v_~x~0_2} OutVars{readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_1|, ~x~0=v_~x~0_2} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1] {131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)} is VALID [2022-02-20 20:10:01,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)} [245] L738-->L739: Formula: (not (= |v_readerThread1of1ForFork0_~lx~0#1_3| |v_readerThread1of1ForFork0_~ly~0#1_3|)) InVars {readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_3|, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_3|} OutVars{readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_3|, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_3|} AuxVars[] AssignedVars[] {127#false} is VALID [2022-02-20 20:10:01,350 INFO L290 TraceCheckUtils]: 38: Hoare triple {127#false} [247] L739-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {127#false} is VALID [2022-02-20 20:10:01,351 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:10:01,352 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:10:01,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820148027] [2022-02-20 20:10:01,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820148027] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:10:01,353 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:10:01,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:10:01,354 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804397625] [2022-02-20 20:10:01,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:10:01,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 39 [2022-02-20 20:10:01,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:10:01,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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:10:01,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:10:01,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:10:01,425 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:10:01,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:10:01,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:10:01,461 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 112 [2022-02-20 20:10:01,473 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 94 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 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:10:01,473 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:10:01,473 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 112 [2022-02-20 20:10:01,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:10:03,293 INFO L129 PetriNetUnfolder]: 3826/7989 cut-off events. [2022-02-20 20:10:03,294 INFO L130 PetriNetUnfolder]: For 1855/1855 co-relation queries the response was YES. [2022-02-20 20:10:03,320 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14639 conditions, 7989 events. 3826/7989 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 71187 event pairs, 1181 based on Foata normal form. 418/8042 useless extension candidates. Maximal degree in co-relation 13913. Up to 2013 conditions per place. [2022-02-20 20:10:03,366 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 109 selfloop transitions, 24 changer transitions 4/201 dead transitions. [2022-02-20 20:10:03,367 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 201 transitions, 769 flow [2022-02-20 20:10:03,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 20:10:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-02-20 20:10:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 961 transitions. [2022-02-20 20:10:03,395 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8580357142857142 [2022-02-20 20:10:03,396 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 961 transitions. [2022-02-20 20:10:03,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 961 transitions. [2022-02-20 20:10:03,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:10:03,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 961 transitions. [2022-02-20 20:10:03,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.1) internal successors, (961), 10 states have internal predecessors, (961), 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:10:03,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 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:10:03,410 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 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:10:03,411 INFO L186 Difference]: Start difference. First operand has 105 places, 94 transitions, 209 flow. Second operand 10 states and 961 transitions. [2022-02-20 20:10:03,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 201 transitions, 769 flow [2022-02-20 20:10:07,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 201 transitions, 713 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-02-20 20:10:07,955 INFO L242 Difference]: Finished difference. Result has 115 places, 117 transitions, 367 flow [2022-02-20 20:10:07,957 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=367, PETRI_PLACES=115, PETRI_TRANSITIONS=117} [2022-02-20 20:10:07,960 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 10 predicate places. [2022-02-20 20:10:07,961 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 117 transitions, 367 flow [2022-02-20 20:10:11,903 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 101731 states, 101719 states have (on average 4.134704430833964) internal successors, (420578), 101730 states have internal predecessors, (420578), 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:10:12,270 INFO L78 Accepts]: Start accepts. Automaton has has 101731 states, 101719 states have (on average 4.134704430833964) internal successors, (420578), 101730 states have internal predecessors, (420578), 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 39 [2022-02-20 20:10:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:10:12,271 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 117 transitions, 367 flow [2022-02-20 20:10:12,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 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:10:12,272 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:10:12,272 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] [2022-02-20 20:10:12,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:10:12,273 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-02-20 20:10:12,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:10:12,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1416784543, now seen corresponding path program 1 times [2022-02-20 20:10:12,274 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:10:12,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480965790] [2022-02-20 20:10:12,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:10:12,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:10:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:10:12,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {101885#true} [221] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101885#true} is VALID [2022-02-20 20:10:12,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {101885#true} [199] 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] {101885#true} is VALID [2022-02-20 20:10:12,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {101885#true} [228] 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[] {101885#true} is VALID [2022-02-20 20:10:12,398 INFO L290 TraceCheckUtils]: 3: Hoare triple {101885#true} [230] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {101885#true} is VALID [2022-02-20 20:10:12,398 INFO L290 TraceCheckUtils]: 4: Hoare triple {101885#true} [190] L16-->L16-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[] {101885#true} is VALID [2022-02-20 20:10:12,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {101885#true} [151] L16-1-->L16-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[] {101885#true} is VALID [2022-02-20 20:10:12,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {101885#true} [235] L16-2-->L16-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[] {101885#true} is VALID [2022-02-20 20:10:12,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {101885#true} [210] L16-3-->L16-4: Formula: (and (= 20 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {101885#true} is VALID [2022-02-20 20:10:12,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {101885#true} [212] L16-4-->L704: Formula: (= v_~w~0_2 0) InVars {} OutVars{~w~0=v_~w~0_2} AuxVars[] AssignedVars[~w~0] {101885#true} is VALID [2022-02-20 20:10:12,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {101885#true} [224] L704-->L704-1: Formula: (= v_~r~0_5 0) InVars {} OutVars{~r~0=v_~r~0_5} AuxVars[] AssignedVars[~r~0] {101885#true} is VALID [2022-02-20 20:10:12,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {101885#true} [236] L704-1-->L704-2: Formula: (= v_~x~0_3 0) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] {101885#true} is VALID [2022-02-20 20:10:12,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {101885#true} [205] L704-2-->L-1-3: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {101885#true} is VALID [2022-02-20 20:10:12,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {101885#true} [231] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101885#true} is VALID [2022-02-20 20:10:12,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {101885#true} [208] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101885#true} is VALID [2022-02-20 20:10:12,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {101885#true} [173] 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] {101885#true} is VALID [2022-02-20 20:10:12,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {101885#true} [202] L-1-6-->L744: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#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_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_1|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_~#t2~0#1.base] {101885#true} is VALID [2022-02-20 20:10:12,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {101885#true} [196] L744-->L744-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, 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_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {101885#true} is VALID [2022-02-20 20:10:12,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {101885#true} [159] L744-1-->L744-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, 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_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {101885#true} is VALID [2022-02-20 20:10:12,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {101885#true} [177] L744-2-->L744-3: Formula: (and (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (store |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1) |v_#valid_8|) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4) |v_#length_7|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] {101885#true} is VALID [2022-02-20 20:10:12,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {101885#true} [165] L744-3-->L744-4: Formula: (and (= (store |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 1) |v_#valid_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_2| 0)) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2|) 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t4~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_10|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_2|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_2|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] {101885#true} is VALID [2022-02-20 20:10:12,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {101885#true} [192] L744-4-->L745: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {101885#true} is VALID [2022-02-20 20:10:12,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {101885#true} [160] L745-->L745-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {101885#true} is VALID [2022-02-20 20:10:12,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {101885#true} [219] L745-1-->L745-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {101885#true} is VALID [2022-02-20 20:10:12,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {101885#true} [283] L745-2-->writerENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_writerThread1of1ForFork2_thidvar0_2) (= v_writerThread1of1ForFork2_thidvar1_2 0) (= |v_writerThread1of1ForFork2_#in~arg#1.offset_4| 0) (= |v_writerThread1of1ForFork2_#in~arg#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{writerThread1of1ForFork2_~arg#1.base=|v_writerThread1of1ForFork2_~arg#1.base_4|, writerThread1of1ForFork2_#in~arg#1.offset=|v_writerThread1of1ForFork2_#in~arg#1.offset_4|, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_4|, writerThread1of1ForFork2_#in~arg#1.base=|v_writerThread1of1ForFork2_#in~arg#1.base_4|, writerThread1of1ForFork2_#res#1.base=|v_writerThread1of1ForFork2_#res#1.base_4|, writerThread1of1ForFork2_#res#1.offset=|v_writerThread1of1ForFork2_#res#1.offset_4|, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2, writerThread1of1ForFork2_thidvar1=v_writerThread1of1ForFork2_thidvar1_2, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, writerThread1of1ForFork2_~arg#1.offset=|v_writerThread1of1ForFork2_~arg#1.offset_4|} AuxVars[] AssignedVars[writerThread1of1ForFork2_~arg#1.base, writerThread1of1ForFork2_#in~arg#1.offset, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_#in~arg#1.base, writerThread1of1ForFork2_#res#1.base, writerThread1of1ForFork2_#res#1.offset, writerThread1of1ForFork2_thidvar0, writerThread1of1ForFork2_thidvar1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork2_~arg#1.offset] {101885#true} is VALID [2022-02-20 20:10:12,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {101885#true} [187] L745-3-->L745-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {101885#true} is VALID [2022-02-20 20:10:12,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {101885#true} [188] L745-4-->L746: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {101885#true} is VALID [2022-02-20 20:10:12,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {101885#true} [178] L746-->L746-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {101885#true} is VALID [2022-02-20 20:10:12,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {101885#true} [172] L746-1-->L746-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {101885#true} is VALID [2022-02-20 20:10:12,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {101885#true} [174] L746-2-->L746-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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_5|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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] {101885#true} is VALID [2022-02-20 20:10:12,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {101885#true} [279] L746-3-->readerENTRY: Formula: (and (= v_readerThread1of1ForFork0_thidvar1_2 0) (= |v_readerThread1of1ForFork0_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_readerThread1of1ForFork0_thidvar0_2) (= |v_readerThread1of1ForFork0_#in~arg#1.base_4| 0) (= v_readerThread1of1ForFork0_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{readerThread1of1ForFork0_thidvar2=v_readerThread1of1ForFork0_thidvar2_2, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_8|, readerThread1of1ForFork0_#in~arg#1.base=|v_readerThread1of1ForFork0_#in~arg#1.base_4|, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_#res#1.offset=|v_readerThread1of1ForFork0_#res#1.offset_4|, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, readerThread1of1ForFork0_#in~arg#1.offset=|v_readerThread1of1ForFork0_#in~arg#1.offset_4|, readerThread1of1ForFork0_~arg#1.base=|v_readerThread1of1ForFork0_~arg#1.base_4|, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_8|, readerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_4|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_8|, readerThread1of1ForFork0_~arg#1.offset=|v_readerThread1of1ForFork0_~arg#1.offset_4|, readerThread1of1ForFork0_#res#1.base=|v_readerThread1of1ForFork0_#res#1.base_4|, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[readerThread1of1ForFork0_thidvar2, readerThread1of1ForFork0_~l~0#1, readerThread1of1ForFork0_#in~arg#1.base, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_#res#1.offset, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_#in~arg#1.offset, readerThread1of1ForFork0_~arg#1.base, readerThread1of1ForFork0_~ly~0#1, readerThread1of1ForFork0_assume_abort_if_not_~cond#1, readerThread1of1ForFork0_~lx~0#1, readerThread1of1ForFork0_~arg#1.offset, readerThread1of1ForFork0_#res#1.base, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1] {101885#true} is VALID [2022-02-20 20:10:12,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {101885#true} [238] readerENTRY-->L725: Formula: (and (= |v_readerThread1of1ForFork0_#in~arg#1.offset_1| |v_readerThread1of1ForFork0_~arg#1.offset_1|) (= |v_readerThread1of1ForFork0_#in~arg#1.base_1| |v_readerThread1of1ForFork0_~arg#1.base_1|)) InVars {readerThread1of1ForFork0_#in~arg#1.base=|v_readerThread1of1ForFork0_#in~arg#1.base_1|, readerThread1of1ForFork0_#in~arg#1.offset=|v_readerThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{readerThread1of1ForFork0_~arg#1.base=|v_readerThread1of1ForFork0_~arg#1.base_1|, readerThread1of1ForFork0_#in~arg#1.base=|v_readerThread1of1ForFork0_#in~arg#1.base_1|, readerThread1of1ForFork0_~arg#1.offset=|v_readerThread1of1ForFork0_~arg#1.offset_1|, readerThread1of1ForFork0_#in~arg#1.offset=|v_readerThread1of1ForFork0_#in~arg#1.offset_1|} AuxVars[] AssignedVars[readerThread1of1ForFork0_~arg#1.offset, readerThread1of1ForFork0_~arg#1.base] {101885#true} is VALID [2022-02-20 20:10:12,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {101885#true} [239] L725-->L726: Formula: true InVars {} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1] {101885#true} is VALID [2022-02-20 20:10:12,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {101885#true} [266] writerENTRY-->L717: Formula: (and (= |v_writerThread1of1ForFork2_~arg#1.base_1| |v_writerThread1of1ForFork2_#in~arg#1.base_1|) (= |v_writerThread1of1ForFork2_~arg#1.offset_1| |v_writerThread1of1ForFork2_#in~arg#1.offset_1|)) InVars {writerThread1of1ForFork2_#in~arg#1.base=|v_writerThread1of1ForFork2_#in~arg#1.base_1|, writerThread1of1ForFork2_#in~arg#1.offset=|v_writerThread1of1ForFork2_#in~arg#1.offset_1|} OutVars{writerThread1of1ForFork2_~arg#1.base=|v_writerThread1of1ForFork2_~arg#1.base_1|, writerThread1of1ForFork2_#in~arg#1.offset=|v_writerThread1of1ForFork2_#in~arg#1.offset_1|, writerThread1of1ForFork2_#in~arg#1.base=|v_writerThread1of1ForFork2_#in~arg#1.base_1|, writerThread1of1ForFork2_~arg#1.offset=|v_writerThread1of1ForFork2_~arg#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork2_~arg#1.base, writerThread1of1ForFork2_~arg#1.offset] {101885#true} is VALID [2022-02-20 20:10:12,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {101885#true} [267] L717-->L717-1: Formula: (and (= v_~w~0_28 1) (= |v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (and (= v_~w~0_29 0) (= v_~r~0_39 0)) 1 0)) (not (= |v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0))) InVars {~w~0=v_~w~0_29, ~r~0=v_~r~0_39} OutVars{~w~0=v_~w~0_28, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_39} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1] {101887#(= ~w~0 1)} is VALID [2022-02-20 20:10:12,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {101887#(= ~w~0 1)} [240] L726-->L726-1: Formula: (and (= |v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (= v_~r~0_35 (+ v_~r~0_36 1)) (= (ite (= v_~w~0_24 0) 1 0) |v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|))) InVars {~w~0=v_~w~0_24, ~r~0=v_~r~0_36} OutVars{~w~0=v_~w~0_24, readerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_35} AuxVars[] AssignedVars[readerThread1of1ForFork0_assume_abort_if_not_~cond#1, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~r~0] {101886#false} is VALID [2022-02-20 20:10:12,413 INFO L290 TraceCheckUtils]: 35: Hoare triple {101886#false} [241] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork0_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_3|, ~x~0=v_~x~0_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1] {101886#false} is VALID [2022-02-20 20:10:12,413 INFO L290 TraceCheckUtils]: 36: Hoare triple {101886#false} [242] L729-->L732: Formula: (= |v_readerThread1of1ForFork0_~l~0#1_5| v_~y~0_1) InVars {readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_5|} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_5|, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] {101886#false} is VALID [2022-02-20 20:10:12,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {101886#false} [243] L732-->L735: Formula: (= |v_readerThread1of1ForFork0_~ly~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork0_~ly~0#1] {101886#false} is VALID [2022-02-20 20:10:12,413 INFO L290 TraceCheckUtils]: 38: Hoare triple {101886#false} [268] L717-1-->L719: Formula: (= 3 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] {101886#false} is VALID [2022-02-20 20:10:12,414 INFO L290 TraceCheckUtils]: 39: Hoare triple {101886#false} [244] L735-->L738: Formula: (= |v_readerThread1of1ForFork0_~lx~0#1_1| v_~x~0_2) InVars {~x~0=v_~x~0_2} OutVars{readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_1|, ~x~0=v_~x~0_2} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1] {101886#false} is VALID [2022-02-20 20:10:12,414 INFO L290 TraceCheckUtils]: 40: Hoare triple {101886#false} [245] L738-->L739: Formula: (not (= |v_readerThread1of1ForFork0_~lx~0#1_3| |v_readerThread1of1ForFork0_~ly~0#1_3|)) InVars {readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_3|, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_3|} OutVars{readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_3|, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_3|} AuxVars[] AssignedVars[] {101886#false} is VALID [2022-02-20 20:10:12,414 INFO L290 TraceCheckUtils]: 41: Hoare triple {101886#false} [247] L739-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101886#false} is VALID [2022-02-20 20:10:12,415 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:10:12,415 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:10:12,415 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480965790] [2022-02-20 20:10:12,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480965790] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:10:12,415 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:10:12,416 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:10:12,416 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245730305] [2022-02-20 20:10:12,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:10:12,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2022-02-20 20:10:12,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:10:12,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:10:12,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:10:12,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:10:12,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:10:12,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:10:12,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:10:12,452 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 112 [2022-02-20 20:10:12,452 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 117 transitions, 367 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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:10:12,452 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:10:12,452 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 112 [2022-02-20 20:10:12,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:10:12,726 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][63], [37#writerENTRYtrue, 59#L748-4true, 102#L740true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 71#L740true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse, 93#L721true, 101885#true]) [2022-02-20 20:10:12,727 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-02-20 20:10:12,727 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-02-20 20:10:12,727 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-02-20 20:10:12,727 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-02-20 20:10:12,906 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][63], [44#writerENTRYtrue, 59#L748-4true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 102#L740true, 71#L740true, 117#L721true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse, 101885#true]) [2022-02-20 20:10:12,907 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-02-20 20:10:12,907 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-02-20 20:10:12,907 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-02-20 20:10:12,907 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-02-20 20:10:12,920 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][62], [59#L748-4true, 102#L740true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 71#L740true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), 85#L717-1true, Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 101887#(= ~w~0 1), Black: 126#true, readerThread1of1ForFork3InUse, 93#L721true]) [2022-02-20 20:10:12,921 INFO L384 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-02-20 20:10:12,921 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-02-20 20:10:12,921 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-02-20 20:10:12,922 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-02-20 20:10:12,938 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][62], [59#L748-4true, 102#L740true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 71#L740true, 117#L721true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 101887#(= ~w~0 1), Black: 126#true, readerThread1of1ForFork3InUse, 22#L717-1true]) [2022-02-20 20:10:12,939 INFO L384 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-02-20 20:10:12,939 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-02-20 20:10:12,939 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-02-20 20:10:12,939 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-02-20 20:10:12,981 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][63], [37#writerENTRYtrue, 107#L749-2true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 102#L740true, 71#L740true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse, 101885#true]) [2022-02-20 20:10:12,984 INFO L384 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-02-20 20:10:12,984 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-02-20 20:10:12,984 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-02-20 20:10:12,984 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-02-20 20:10:13,002 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][62], [107#L749-2true, 102#L740true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 71#L740true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 85#L717-1true, Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 101887#(= ~w~0 1), Black: 126#true, readerThread1of1ForFork3InUse]) [2022-02-20 20:10:13,002 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-02-20 20:10:13,002 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-02-20 20:10:13,002 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-02-20 20:10:13,002 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-02-20 20:10:13,023 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][63], [107#L749-2true, 102#L740true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 117#L721true, 71#L740true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse, 101885#true]) [2022-02-20 20:10:13,025 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-02-20 20:10:13,025 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-02-20 20:10:13,025 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-02-20 20:10:13,025 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-02-20 20:10:13,043 INFO L129 PetriNetUnfolder]: 818/3155 cut-off events. [2022-02-20 20:10:13,044 INFO L130 PetriNetUnfolder]: For 681/704 co-relation queries the response was YES. [2022-02-20 20:10:13,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5612 conditions, 3155 events. 818/3155 cut-off events. For 681/704 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 30928 event pairs, 233 based on Foata normal form. 140/3114 useless extension candidates. Maximal degree in co-relation 4934. Up to 668 conditions per place. [2022-02-20 20:10:13,072 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 19 selfloop transitions, 4 changer transitions 0/124 dead transitions. [2022-02-20 20:10:13,073 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 124 transitions, 433 flow [2022-02-20 20:10:13,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:10:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:10:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2022-02-20 20:10:13,077 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9107142857142857 [2022-02-20 20:10:13,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2022-02-20 20:10:13,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2022-02-20 20:10:13,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:10:13,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2022-02-20 20:10:13,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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:10:13,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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:10:13,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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:10:13,079 INFO L186 Difference]: Start difference. First operand has 115 places, 117 transitions, 367 flow. Second operand 3 states and 306 transitions. [2022-02-20 20:10:13,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 124 transitions, 433 flow [2022-02-20 20:10:21,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 124 transitions, 433 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 20:10:21,742 INFO L242 Difference]: Finished difference. Result has 118 places, 117 transitions, 383 flow [2022-02-20 20:10:21,743 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=118, PETRI_TRANSITIONS=117} [2022-02-20 20:10:21,743 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 13 predicate places. [2022-02-20 20:10:21,744 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 118 places, 117 transitions, 383 flow [2022-02-20 20:10:24,284 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 94549 states, 94537 states have (on average 4.0033426065984745) internal successors, (378464), 94548 states have internal predecessors, (378464), 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:10:24,462 INFO L78 Accepts]: Start accepts. Automaton has has 94549 states, 94537 states have (on average 4.0033426065984745) internal successors, (378464), 94548 states have internal predecessors, (378464), 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 42 [2022-02-20 20:10:24,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:10:24,463 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 117 transitions, 383 flow [2022-02-20 20:10:24,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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:10:24,463 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:10:24,463 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] [2022-02-20 20:10:24,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:10:24,464 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-02-20 20:10:24,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:10:24,464 INFO L85 PathProgramCache]: Analyzing trace with hash -211743983, now seen corresponding path program 2 times [2022-02-20 20:10:24,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:10:24,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102377474] [2022-02-20 20:10:24,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:10:24,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:10:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:10:24,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {196440#true} [221] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196440#true} is VALID [2022-02-20 20:10:24,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {196440#true} [199] 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] {196440#true} is VALID [2022-02-20 20:10:24,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {196440#true} [228] 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[] {196440#true} is VALID [2022-02-20 20:10:24,549 INFO L290 TraceCheckUtils]: 3: Hoare triple {196440#true} [230] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {196440#true} is VALID [2022-02-20 20:10:24,549 INFO L290 TraceCheckUtils]: 4: Hoare triple {196440#true} [190] L16-->L16-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[] {196440#true} is VALID [2022-02-20 20:10:24,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {196440#true} [151] L16-1-->L16-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[] {196440#true} is VALID [2022-02-20 20:10:24,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {196440#true} [235] L16-2-->L16-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[] {196440#true} is VALID [2022-02-20 20:10:24,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {196440#true} [210] L16-3-->L16-4: Formula: (and (= 20 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {196440#true} is VALID [2022-02-20 20:10:24,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {196440#true} [212] L16-4-->L704: Formula: (= v_~w~0_2 0) InVars {} OutVars{~w~0=v_~w~0_2} AuxVars[] AssignedVars[~w~0] {196440#true} is VALID [2022-02-20 20:10:24,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {196440#true} [224] L704-->L704-1: Formula: (= v_~r~0_5 0) InVars {} OutVars{~r~0=v_~r~0_5} AuxVars[] AssignedVars[~r~0] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {196442#(= ~r~0 0)} [236] L704-1-->L704-2: Formula: (= v_~x~0_3 0) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {196442#(= ~r~0 0)} [205] L704-2-->L-1-3: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {196442#(= ~r~0 0)} [231] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {196442#(= ~r~0 0)} [208] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {196442#(= ~r~0 0)} [173] 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] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {196442#(= ~r~0 0)} [202] L-1-6-->L744: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#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_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_1|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_~#t2~0#1.base] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {196442#(= ~r~0 0)} [196] L744-->L744-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, 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_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {196442#(= ~r~0 0)} [159] L744-1-->L744-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, 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_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {196442#(= ~r~0 0)} [177] L744-2-->L744-3: Formula: (and (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (store |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1) |v_#valid_8|) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4) |v_#length_7|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {196442#(= ~r~0 0)} [165] L744-3-->L744-4: Formula: (and (= (store |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 1) |v_#valid_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_2| 0)) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2|) 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t4~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_10|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_2|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_2|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {196442#(= ~r~0 0)} [192] L744-4-->L745: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {196442#(= ~r~0 0)} [160] L745-->L745-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {196442#(= ~r~0 0)} [219] L745-1-->L745-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {196442#(= ~r~0 0)} [283] L745-2-->writerENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_writerThread1of1ForFork2_thidvar0_2) (= v_writerThread1of1ForFork2_thidvar1_2 0) (= |v_writerThread1of1ForFork2_#in~arg#1.offset_4| 0) (= |v_writerThread1of1ForFork2_#in~arg#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{writerThread1of1ForFork2_~arg#1.base=|v_writerThread1of1ForFork2_~arg#1.base_4|, writerThread1of1ForFork2_#in~arg#1.offset=|v_writerThread1of1ForFork2_#in~arg#1.offset_4|, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_4|, writerThread1of1ForFork2_#in~arg#1.base=|v_writerThread1of1ForFork2_#in~arg#1.base_4|, writerThread1of1ForFork2_#res#1.base=|v_writerThread1of1ForFork2_#res#1.base_4|, writerThread1of1ForFork2_#res#1.offset=|v_writerThread1of1ForFork2_#res#1.offset_4|, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2, writerThread1of1ForFork2_thidvar1=v_writerThread1of1ForFork2_thidvar1_2, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, writerThread1of1ForFork2_~arg#1.offset=|v_writerThread1of1ForFork2_~arg#1.offset_4|} AuxVars[] AssignedVars[writerThread1of1ForFork2_~arg#1.base, writerThread1of1ForFork2_#in~arg#1.offset, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_#in~arg#1.base, writerThread1of1ForFork2_#res#1.base, writerThread1of1ForFork2_#res#1.offset, writerThread1of1ForFork2_thidvar0, writerThread1of1ForFork2_thidvar1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork2_~arg#1.offset] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {196442#(= ~r~0 0)} [187] L745-3-->L745-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {196442#(= ~r~0 0)} [188] L745-4-->L746: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {196442#(= ~r~0 0)} [178] L746-->L746-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {196442#(= ~r~0 0)} [172] L746-1-->L746-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {196442#(= ~r~0 0)} [174] L746-2-->L746-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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_5|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {196442#(= ~r~0 0)} [279] L746-3-->readerENTRY: Formula: (and (= v_readerThread1of1ForFork0_thidvar1_2 0) (= |v_readerThread1of1ForFork0_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_readerThread1of1ForFork0_thidvar0_2) (= |v_readerThread1of1ForFork0_#in~arg#1.base_4| 0) (= v_readerThread1of1ForFork0_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{readerThread1of1ForFork0_thidvar2=v_readerThread1of1ForFork0_thidvar2_2, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_8|, readerThread1of1ForFork0_#in~arg#1.base=|v_readerThread1of1ForFork0_#in~arg#1.base_4|, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_#res#1.offset=|v_readerThread1of1ForFork0_#res#1.offset_4|, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, readerThread1of1ForFork0_#in~arg#1.offset=|v_readerThread1of1ForFork0_#in~arg#1.offset_4|, readerThread1of1ForFork0_~arg#1.base=|v_readerThread1of1ForFork0_~arg#1.base_4|, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_8|, readerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_4|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_8|, readerThread1of1ForFork0_~arg#1.offset=|v_readerThread1of1ForFork0_~arg#1.offset_4|, readerThread1of1ForFork0_#res#1.base=|v_readerThread1of1ForFork0_#res#1.base_4|, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[readerThread1of1ForFork0_thidvar2, readerThread1of1ForFork0_~l~0#1, readerThread1of1ForFork0_#in~arg#1.base, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_#res#1.offset, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_#in~arg#1.offset, readerThread1of1ForFork0_~arg#1.base, readerThread1of1ForFork0_~ly~0#1, readerThread1of1ForFork0_assume_abort_if_not_~cond#1, readerThread1of1ForFork0_~lx~0#1, readerThread1of1ForFork0_~arg#1.offset, readerThread1of1ForFork0_#res#1.base, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {196442#(= ~r~0 0)} [238] readerENTRY-->L725: Formula: (and (= |v_readerThread1of1ForFork0_#in~arg#1.offset_1| |v_readerThread1of1ForFork0_~arg#1.offset_1|) (= |v_readerThread1of1ForFork0_#in~arg#1.base_1| |v_readerThread1of1ForFork0_~arg#1.base_1|)) InVars {readerThread1of1ForFork0_#in~arg#1.base=|v_readerThread1of1ForFork0_#in~arg#1.base_1|, readerThread1of1ForFork0_#in~arg#1.offset=|v_readerThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{readerThread1of1ForFork0_~arg#1.base=|v_readerThread1of1ForFork0_~arg#1.base_1|, readerThread1of1ForFork0_#in~arg#1.base=|v_readerThread1of1ForFork0_#in~arg#1.base_1|, readerThread1of1ForFork0_~arg#1.offset=|v_readerThread1of1ForFork0_~arg#1.offset_1|, readerThread1of1ForFork0_#in~arg#1.offset=|v_readerThread1of1ForFork0_#in~arg#1.offset_1|} AuxVars[] AssignedVars[readerThread1of1ForFork0_~arg#1.offset, readerThread1of1ForFork0_~arg#1.base] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {196442#(= ~r~0 0)} [239] L725-->L726: Formula: true InVars {} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1] {196442#(= ~r~0 0)} is VALID [2022-02-20 20:10:24,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {196442#(= ~r~0 0)} [240] L726-->L726-1: Formula: (and (= |v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (= v_~r~0_35 (+ v_~r~0_36 1)) (= (ite (= v_~w~0_24 0) 1 0) |v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|))) InVars {~w~0=v_~w~0_24, ~r~0=v_~r~0_36} OutVars{~w~0=v_~w~0_24, readerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_35} AuxVars[] AssignedVars[readerThread1of1ForFork0_assume_abort_if_not_~cond#1, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~r~0] {196443#(or (not (= ~w~0 0)) (not (= ~r~0 0)))} is VALID [2022-02-20 20:10:24,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {196443#(or (not (= ~w~0 0)) (not (= ~r~0 0)))} [241] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork0_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_3|, ~x~0=v_~x~0_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1] {196443#(or (not (= ~w~0 0)) (not (= ~r~0 0)))} is VALID [2022-02-20 20:10:24,568 INFO L290 TraceCheckUtils]: 34: Hoare triple {196443#(or (not (= ~w~0 0)) (not (= ~r~0 0)))} [242] L729-->L732: Formula: (= |v_readerThread1of1ForFork0_~l~0#1_5| v_~y~0_1) InVars {readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_5|} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_5|, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] {196443#(or (not (= ~w~0 0)) (not (= ~r~0 0)))} is VALID [2022-02-20 20:10:24,569 INFO L290 TraceCheckUtils]: 35: Hoare triple {196443#(or (not (= ~w~0 0)) (not (= ~r~0 0)))} [266] writerENTRY-->L717: Formula: (and (= |v_writerThread1of1ForFork2_~arg#1.base_1| |v_writerThread1of1ForFork2_#in~arg#1.base_1|) (= |v_writerThread1of1ForFork2_~arg#1.offset_1| |v_writerThread1of1ForFork2_#in~arg#1.offset_1|)) InVars {writerThread1of1ForFork2_#in~arg#1.base=|v_writerThread1of1ForFork2_#in~arg#1.base_1|, writerThread1of1ForFork2_#in~arg#1.offset=|v_writerThread1of1ForFork2_#in~arg#1.offset_1|} OutVars{writerThread1of1ForFork2_~arg#1.base=|v_writerThread1of1ForFork2_~arg#1.base_1|, writerThread1of1ForFork2_#in~arg#1.offset=|v_writerThread1of1ForFork2_#in~arg#1.offset_1|, writerThread1of1ForFork2_#in~arg#1.base=|v_writerThread1of1ForFork2_#in~arg#1.base_1|, writerThread1of1ForFork2_~arg#1.offset=|v_writerThread1of1ForFork2_~arg#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork2_~arg#1.base, writerThread1of1ForFork2_~arg#1.offset] {196443#(or (not (= ~w~0 0)) (not (= ~r~0 0)))} is VALID [2022-02-20 20:10:24,570 INFO L290 TraceCheckUtils]: 36: Hoare triple {196443#(or (not (= ~w~0 0)) (not (= ~r~0 0)))} [267] L717-->L717-1: Formula: (and (= v_~w~0_28 1) (= |v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (and (= v_~w~0_29 0) (= v_~r~0_39 0)) 1 0)) (not (= |v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0))) InVars {~w~0=v_~w~0_29, ~r~0=v_~r~0_39} OutVars{~w~0=v_~w~0_28, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_39} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1] {196441#false} is VALID [2022-02-20 20:10:24,570 INFO L290 TraceCheckUtils]: 37: Hoare triple {196441#false} [268] L717-1-->L719: Formula: (= 3 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] {196441#false} is VALID [2022-02-20 20:10:24,570 INFO L290 TraceCheckUtils]: 38: Hoare triple {196441#false} [243] L732-->L735: Formula: (= |v_readerThread1of1ForFork0_~ly~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork0_~ly~0#1] {196441#false} is VALID [2022-02-20 20:10:24,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {196441#false} [244] L735-->L738: Formula: (= |v_readerThread1of1ForFork0_~lx~0#1_1| v_~x~0_2) InVars {~x~0=v_~x~0_2} OutVars{readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_1|, ~x~0=v_~x~0_2} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1] {196441#false} is VALID [2022-02-20 20:10:24,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {196441#false} [245] L738-->L739: Formula: (not (= |v_readerThread1of1ForFork0_~lx~0#1_3| |v_readerThread1of1ForFork0_~ly~0#1_3|)) InVars {readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_3|, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_3|} OutVars{readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_3|, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_3|} AuxVars[] AssignedVars[] {196441#false} is VALID [2022-02-20 20:10:24,580 INFO L290 TraceCheckUtils]: 41: Hoare triple {196441#false} [247] L739-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196441#false} is VALID [2022-02-20 20:10:24,580 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:10:24,582 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:10:24,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102377474] [2022-02-20 20:10:24,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102377474] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:10:24,583 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:10:24,583 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 20:10:24,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429724593] [2022-02-20 20:10:24,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:10:24,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2022-02-20 20:10:24,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:10:24,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:10:24,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:10:24,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 20:10:24,614 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:10:24,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 20:10:24,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 20:10:24,616 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 112 [2022-02-20 20:10:24,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 117 transitions, 383 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 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:10:24,617 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:10:24,617 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 112 [2022-02-20 20:10:24,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:10:25,016 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([269] L719-->L721: Formula: (= v_~w~0_5 0) InVars {} OutVars{~w~0=v_~w~0_5} AuxVars[] AssignedVars[~w~0][133], [Black: 101887#(= ~w~0 1), 196440#true, 59#L748-4true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 102#L740true, 117#L721true, 71#L740true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse, 93#L721true, 101885#true]) [2022-02-20 20:10:25,017 INFO L384 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-02-20 20:10:25,017 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-02-20 20:10:25,017 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-02-20 20:10:25,017 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-02-20 20:10:25,132 INFO L129 PetriNetUnfolder]: 780/3423 cut-off events. [2022-02-20 20:10:25,133 INFO L130 PetriNetUnfolder]: For 1538/1597 co-relation queries the response was YES. [2022-02-20 20:10:25,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6638 conditions, 3423 events. 780/3423 cut-off events. For 1538/1597 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 36444 event pairs, 66 based on Foata normal form. 69/3364 useless extension candidates. Maximal degree in co-relation 5755. Up to 520 conditions per place. [2022-02-20 20:10:25,163 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 27 selfloop transitions, 19 changer transitions 2/148 dead transitions. [2022-02-20 20:10:25,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 148 transitions, 585 flow [2022-02-20 20:10:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:10:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:10:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2022-02-20 20:10:25,169 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9107142857142857 [2022-02-20 20:10:25,170 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2022-02-20 20:10:25,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2022-02-20 20:10:25,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:10:25,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2022-02-20 20:10:25,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 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:10:25,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 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:10:25,172 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 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:10:25,173 INFO L186 Difference]: Start difference. First operand has 118 places, 117 transitions, 383 flow. Second operand 5 states and 510 transitions. [2022-02-20 20:10:25,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 148 transitions, 585 flow