./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4017723c7e4b1f7c431c7e7a6ea6ca9df8ac56fc590cd03021a11577cb455eff --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:40:22,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:40:22,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:40:22,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:40:22,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:40:22,212 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:40:22,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:40:22,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:40:22,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:40:22,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:40:22,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:40:22,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:40:22,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:40:22,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:40:22,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:40:22,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:40:22,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:40:22,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:40:22,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:40:22,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:40:22,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:40:22,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:40:22,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:40:22,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:40:22,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:40:22,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:40:22,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:40:22,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:40:22,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:40:22,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:40:22,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:40:22,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:40:22,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:40:22,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:40:22,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:40:22,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:40:22,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:40:22,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:40:22,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:40:22,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:40:22,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:40:22,237 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 20:40:22,264 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:40:22,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:40:22,267 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:40:22,267 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:40:22,268 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:40:22,268 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:40:22,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:40:22,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:40:22,269 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:40:22,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:40:22,270 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:40:22,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:40:22,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:40:22,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:40:22,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:40:22,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:40:22,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:40:22,271 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:40:22,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:40:22,271 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:40:22,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:40:22,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:40:22,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:40:22,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:40:22,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:22,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:40:22,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:40:22,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:40:22,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:40:22,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:40:22,273 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:40:22,273 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:40:22,273 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:40:22,273 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 -> 4017723c7e4b1f7c431c7e7a6ea6ca9df8ac56fc590cd03021a11577cb455eff [2022-02-20 20:40:22,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:40:22,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:40:22,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:40:22,490 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:40:22,490 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:40:22,491 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i [2022-02-20 20:40:22,531 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b646fabe/630d9ce7e83c4491a97c96cc551aaf21/FLAG6e663f5fb [2022-02-20 20:40:22,907 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:40:22,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i [2022-02-20 20:40:22,918 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b646fabe/630d9ce7e83c4491a97c96cc551aaf21/FLAG6e663f5fb [2022-02-20 20:40:22,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b646fabe/630d9ce7e83c4491a97c96cc551aaf21 [2022-02-20 20:40:22,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:40:22,929 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:40:22,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:22,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:40:22,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:40:22,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:22" (1/1) ... [2022-02-20 20:40:22,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56bb7afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:22, skipping insertion in model container [2022-02-20 20:40:22,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:22" (1/1) ... [2022-02-20 20:40:22,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:40:22,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:40:23,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i[1086,1099] [2022-02-20 20:40:23,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:23,254 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:40:23,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i[1086,1099] [2022-02-20 20:40:23,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:23,331 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:40:23,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:23 WrapperNode [2022-02-20 20:40:23,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:23,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:23,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:40:23,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:40:23,337 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:40:23" (1/1) ... [2022-02-20 20:40:23,360 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:40:23" (1/1) ... [2022-02-20 20:40:23,384 INFO L137 Inliner]: procedures = 162, calls = 24, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 76 [2022-02-20 20:40:23,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:23,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:40:23,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:40:23,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:40:23,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:23" (1/1) ... [2022-02-20 20:40:23,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:23" (1/1) ... [2022-02-20 20:40:23,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:23" (1/1) ... [2022-02-20 20:40:23,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:23" (1/1) ... [2022-02-20 20:40:23,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:23" (1/1) ... [2022-02-20 20:40:23,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:23" (1/1) ... [2022-02-20 20:40:23,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:23" (1/1) ... [2022-02-20 20:40:23,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:40:23,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:40:23,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:40:23,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:40:23,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:23" (1/1) ... [2022-02-20 20:40:23,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:23,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:40:23,443 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:40:23,448 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:40:23,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:40:23,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:40:23,471 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:40:23,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:40:23,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:40:23,472 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-20 20:40:23,472 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-20 20:40:23,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:40:23,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:40:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:40:23,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:40:23,473 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:40:23,575 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:40:23,576 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:40:23,799 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:40:23,806 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:40:23,806 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:40:23,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:23 BoogieIcfgContainer [2022-02-20 20:40:23,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:40:23,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:40:23,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:40:23,812 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:40:23,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:40:22" (1/3) ... [2022-02-20 20:40:23,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5eaa20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:23, skipping insertion in model container [2022-02-20 20:40:23,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:23" (2/3) ... [2022-02-20 20:40:23,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5eaa20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:23, skipping insertion in model container [2022-02-20 20:40:23,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:23" (3/3) ... [2022-02-20 20:40:23,815 INFO L111 eAbstractionObserver]: Analyzing ICFG 13-privatized_25-struct_nr_true.i [2022-02-20 20:40:23,819 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:40:23,819 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:40:23,819 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-20 20:40:23,819 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:40:23,871 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,872 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,872 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,872 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,873 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,873 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,873 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,873 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,873 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,873 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,874 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,874 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,875 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,875 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,878 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,878 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,879 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,879 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,879 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,879 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,880 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,880 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,880 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,881 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,881 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,881 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,882 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,882 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,882 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,882 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,883 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,883 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,883 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,883 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,883 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,883 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,884 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,884 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,885 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,885 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,885 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,885 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,905 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,906 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,906 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,907 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,907 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,909 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,909 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,910 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:23,917 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-20 20:40:23,952 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:40:23,959 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:40:23,959 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-20 20:40:23,970 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 96 transitions, 200 flow [2022-02-20 20:40:24,017 INFO L129 PetriNetUnfolder]: 4/95 cut-off events. [2022-02-20 20:40:24,017 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:24,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 95 events. 4/95 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-02-20 20:40:24,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 96 transitions, 200 flow [2022-02-20 20:40:24,025 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 87 transitions, 177 flow [2022-02-20 20:40:24,035 INFO L129 PetriNetUnfolder]: 1/29 cut-off events. [2022-02-20 20:40:24,036 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:24,036 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:24,036 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] [2022-02-20 20:40:24,037 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-20 20:40:24,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:24,043 INFO L85 PathProgramCache]: Analyzing trace with hash -948070911, now seen corresponding path program 1 times [2022-02-20 20:40:24,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:24,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462190109] [2022-02-20 20:40:24,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:24,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:24,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#true} [194] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-02-20 20:40:24,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} [171] 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] {99#true} is VALID [2022-02-20 20:40:24,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} [200] 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[] {99#true} is VALID [2022-02-20 20:40:24,320 INFO L290 TraceCheckUtils]: 3: Hoare triple {99#true} [202] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {99#true} is VALID [2022-02-20 20:40:24,320 INFO L290 TraceCheckUtils]: 4: Hoare triple {99#true} [148] L18-->L18-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {99#true} is VALID [2022-02-20 20:40:24,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {99#true} [195] L18-1-->L18-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {99#true} is VALID [2022-02-20 20:40:24,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {99#true} [181] L18-2-->L18-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {99#true} is VALID [2022-02-20 20:40:24,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {99#true} [184] L18-3-->L18-4: Formula: (and (= 34 (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[] {99#true} is VALID [2022-02-20 20:40:24,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {99#true} [185] L18-4-->L685: Formula: (= 5 v_~glob1~0_1) InVars {} OutVars{~glob1~0=v_~glob1~0_1} AuxVars[] AssignedVars[~glob1~0] {101#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:24,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {101#(= 5 ~glob1~0)} [133] L685-->L685-1: Formula: (and (= 3 |v_~#lock1~0.base_1|) (= |v_~#lock1~0.offset_1| 0)) InVars {} OutVars{~#lock1~0.offset=|v_~#lock1~0.offset_1|, ~#lock1~0.base=|v_~#lock1~0.base_1|} AuxVars[] AssignedVars[~#lock1~0.offset, ~#lock1~0.base] {101#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:24,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {101#(= 5 ~glob1~0)} [186] L685-1-->L685-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {101#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:24,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {101#(= 5 ~glob1~0)} [206] L685-2-->L685-3: Formula: (= (select (select |v_#memory_int_3| |v_~#lock1~0.base_2|) |v_~#lock1~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#lock1~0.offset=|v_~#lock1~0.offset_2|, ~#lock1~0.base=|v_~#lock1~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#lock1~0.offset=|v_~#lock1~0.offset_2|, ~#lock1~0.base=|v_~#lock1~0.base_2|} AuxVars[] AssignedVars[] {101#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:24,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {101#(= 5 ~glob1~0)} [146] L685-3-->L685-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock1~0.base_3|) (+ |v_~#lock1~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#lock1~0.offset=|v_~#lock1~0.offset_3|, ~#lock1~0.base=|v_~#lock1~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#lock1~0.offset=|v_~#lock1~0.offset_3|, ~#lock1~0.base=|v_~#lock1~0.base_3|} AuxVars[] AssignedVars[] {101#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:24,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {101#(= 5 ~glob1~0)} [142] L685-4-->L685-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock1~0.base_4|) (+ |v_~#lock1~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#lock1~0.offset=|v_~#lock1~0.offset_4|, ~#lock1~0.base=|v_~#lock1~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#lock1~0.offset=|v_~#lock1~0.offset_4|, ~#lock1~0.base=|v_~#lock1~0.base_4|} AuxVars[] AssignedVars[] {101#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:24,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {101#(= 5 ~glob1~0)} [123] L685-5-->L685-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock1~0.base_5|) (+ |v_~#lock1~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#lock1~0.offset=|v_~#lock1~0.offset_5|, ~#lock1~0.base=|v_~#lock1~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#lock1~0.offset=|v_~#lock1~0.offset_5|, ~#lock1~0.base=|v_~#lock1~0.base_5|} AuxVars[] AssignedVars[] {101#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:24,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {101#(= 5 ~glob1~0)} [193] L685-6-->L685-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock1~0.base_6|) (+ 16 |v_~#lock1~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#lock1~0.offset=|v_~#lock1~0.offset_6|, ~#lock1~0.base=|v_~#lock1~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#lock1~0.offset=|v_~#lock1~0.offset_6|, ~#lock1~0.base=|v_~#lock1~0.base_6|} AuxVars[] AssignedVars[] {101#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:24,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {101#(= 5 ~glob1~0)} [129] L685-7-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:24,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {101#(= 5 ~glob1~0)} [205] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:24,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {101#(= 5 ~glob1~0)} [183] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {101#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:24,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {101#(= 5 ~glob1~0)} [132] L-1-5-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post6#1=|v_ULTIMATE.start_main_#t~post6#1_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem7#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~post5#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre2#1] {101#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:24,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {101#(= 5 ~glob1~0)} [156] L698-->L698-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {101#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:24,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {101#(= 5 ~glob1~0)} [153] L698-1-->L699: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:24,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {101#(= 5 ~glob1~0)} [175] L699-->L699-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 5 v_~glob1~0_2) 1 0)) InVars {~glob1~0=v_~glob1~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~glob1~0=v_~glob1~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {102#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:24,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {102#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [140] L699-1-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {102#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:24,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {102#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [160] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {103#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:24,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {103#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [143] L19-1-->L19-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {100#false} is VALID [2022-02-20 20:40:24,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {100#false} [163] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#false} is VALID [2022-02-20 20:40:24,342 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:40:24,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:24,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462190109] [2022-02-20 20:40:24,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462190109] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:24,343 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:24,343 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:40:24,344 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659119980] [2022-02-20 20:40:24,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:24,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2022-02-20 20:40:24,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:24,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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:40:24,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:24,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:40:24,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:24,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:40:24,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:40:24,427 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 96 [2022-02-20 20:40:24,430 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 87 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 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:40:24,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:24,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 96 [2022-02-20 20:40:24,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:24,573 INFO L129 PetriNetUnfolder]: 36/191 cut-off events. [2022-02-20 20:40:24,574 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:24,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 191 events. 36/191 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 741 event pairs, 1 based on Foata normal form. 24/205 useless extension candidates. Maximal degree in co-relation 245. Up to 36 conditions per place. [2022-02-20 20:40:24,584 INFO L132 encePairwiseOnDemand]: 84/96 looper letters, 23 selfloop transitions, 8 changer transitions 0/89 dead transitions. [2022-02-20 20:40:24,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 89 transitions, 243 flow [2022-02-20 20:40:24,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:40:24,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:40:24,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 509 transitions. [2022-02-20 20:40:24,615 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7574404761904762 [2022-02-20 20:40:24,616 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 509 transitions. [2022-02-20 20:40:24,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 509 transitions. [2022-02-20 20:40:24,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:24,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 509 transitions. [2022-02-20 20:40:24,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 72.71428571428571) internal successors, (509), 7 states have internal predecessors, (509), 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:40:24,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 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:40:24,628 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 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:40:24,629 INFO L186 Difference]: Start difference. First operand has 87 places, 87 transitions, 177 flow. Second operand 7 states and 509 transitions. [2022-02-20 20:40:24,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 89 transitions, 243 flow [2022-02-20 20:40:24,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 89 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:40:24,634 INFO L242 Difference]: Finished difference. Result has 87 places, 79 transitions, 183 flow [2022-02-20 20:40:24,635 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=183, PETRI_PLACES=87, PETRI_TRANSITIONS=79} [2022-02-20 20:40:24,637 INFO L334 CegarLoopForPetriNet]: 87 programPoint places, 0 predicate places. [2022-02-20 20:40:24,638 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 87 places, 79 transitions, 183 flow [2022-02-20 20:40:24,671 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 598 states, 592 states have (on average 1.8868243243243243) internal successors, (1117), 597 states have internal predecessors, (1117), 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:40:24,674 INFO L78 Accepts]: Start accepts. Automaton has has 598 states, 592 states have (on average 1.8868243243243243) internal successors, (1117), 597 states have internal predecessors, (1117), 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 27 [2022-02-20 20:40:24,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:24,675 INFO L470 AbstractCegarLoop]: Abstraction has has 87 places, 79 transitions, 183 flow [2022-02-20 20:40:24,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 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:40:24,675 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:24,675 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:40:24,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:40:24,675 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-20 20:40:24,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:24,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1028974734, now seen corresponding path program 1 times [2022-02-20 20:40:24,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:24,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326010544] [2022-02-20 20:40:24,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:24,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:24,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {711#true} [194] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {711#true} is VALID [2022-02-20 20:40:24,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {711#true} [171] 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] {711#true} is VALID [2022-02-20 20:40:24,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {711#true} [200] 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[] {711#true} is VALID [2022-02-20 20:40:24,803 INFO L290 TraceCheckUtils]: 3: Hoare triple {711#true} [202] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {711#true} is VALID [2022-02-20 20:40:24,803 INFO L290 TraceCheckUtils]: 4: Hoare triple {711#true} [148] L18-->L18-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {711#true} is VALID [2022-02-20 20:40:24,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {711#true} [195] L18-1-->L18-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {711#true} is VALID [2022-02-20 20:40:24,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {711#true} [181] L18-2-->L18-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {711#true} is VALID [2022-02-20 20:40:24,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {711#true} [184] L18-3-->L18-4: Formula: (and (= 34 (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[] {711#true} is VALID [2022-02-20 20:40:24,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {711#true} [185] L18-4-->L685: Formula: (= 5 v_~glob1~0_1) InVars {} OutVars{~glob1~0=v_~glob1~0_1} AuxVars[] AssignedVars[~glob1~0] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [133] L685-->L685-1: Formula: (and (= 3 |v_~#lock1~0.base_1|) (= |v_~#lock1~0.offset_1| 0)) InVars {} OutVars{~#lock1~0.offset=|v_~#lock1~0.offset_1|, ~#lock1~0.base=|v_~#lock1~0.base_1|} AuxVars[] AssignedVars[~#lock1~0.offset, ~#lock1~0.base] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [186] L685-1-->L685-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [206] L685-2-->L685-3: Formula: (= (select (select |v_#memory_int_3| |v_~#lock1~0.base_2|) |v_~#lock1~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#lock1~0.offset=|v_~#lock1~0.offset_2|, ~#lock1~0.base=|v_~#lock1~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#lock1~0.offset=|v_~#lock1~0.offset_2|, ~#lock1~0.base=|v_~#lock1~0.base_2|} AuxVars[] AssignedVars[] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [146] L685-3-->L685-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock1~0.base_3|) (+ |v_~#lock1~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#lock1~0.offset=|v_~#lock1~0.offset_3|, ~#lock1~0.base=|v_~#lock1~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#lock1~0.offset=|v_~#lock1~0.offset_3|, ~#lock1~0.base=|v_~#lock1~0.base_3|} AuxVars[] AssignedVars[] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [142] L685-4-->L685-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock1~0.base_4|) (+ |v_~#lock1~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#lock1~0.offset=|v_~#lock1~0.offset_4|, ~#lock1~0.base=|v_~#lock1~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#lock1~0.offset=|v_~#lock1~0.offset_4|, ~#lock1~0.base=|v_~#lock1~0.base_4|} AuxVars[] AssignedVars[] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [123] L685-5-->L685-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock1~0.base_5|) (+ |v_~#lock1~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#lock1~0.offset=|v_~#lock1~0.offset_5|, ~#lock1~0.base=|v_~#lock1~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#lock1~0.offset=|v_~#lock1~0.offset_5|, ~#lock1~0.base=|v_~#lock1~0.base_5|} AuxVars[] AssignedVars[] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [193] L685-6-->L685-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock1~0.base_6|) (+ 16 |v_~#lock1~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#lock1~0.offset=|v_~#lock1~0.offset_6|, ~#lock1~0.base=|v_~#lock1~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#lock1~0.offset=|v_~#lock1~0.offset_6|, ~#lock1~0.base=|v_~#lock1~0.base_6|} AuxVars[] AssignedVars[] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [129] L685-7-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [205] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [183] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [132] L-1-5-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post6#1=|v_ULTIMATE.start_main_#t~post6#1_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem7#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~post5#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre2#1] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [156] L698-->L698-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [153] L698-1-->L699: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [175] L699-->L699-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 5 v_~glob1~0_2) 1 0)) InVars {~glob1~0=v_~glob1~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~glob1~0=v_~glob1~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [140] L699-1-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [160] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [144] L19-1-->L19-5: Formula: (not (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_4| 0)) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_4|} AuxVars[] AssignedVars[] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [204] L19-5-->L700: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [203] L700-->L700-1: Formula: (= |v_ULTIMATE.start_main_#t~pre2#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [208] L700-1-->L700-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [149] L700-2-->L700-3: Formula: (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre2#1_3|)) |v_#memory_int_8|) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} AuxVars[] AssignedVars[#memory_int] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [243] L700-3-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre2#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_6|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_10|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_10|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_18|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~t~0#1, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_thidvar0] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [212] t_funENTRY-->L687: Formula: (and (= |v_t_funThread1of1ForFork0_~arg#1.offset_1| |v_t_funThread1of1ForFork0_#in~arg#1.offset_1|) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_1| |v_t_funThread1of1ForFork0_~arg#1.base_1|)) InVars {t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,825 INFO L290 TraceCheckUtils]: 32: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [213] L687-->L688: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~t~0#1] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [214] L688-->L688-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#lock1~0.base_9|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet1#1_1| 0) (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#lock1~0.base_9| (store .cse0 |v_~#lock1~0.offset_9| 1))) (= (select .cse0 |v_~#lock1~0.offset_9|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#lock1~0.offset=|v_~#lock1~0.offset_9|, ~#lock1~0.base=|v_~#lock1~0.base_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_1|, ~#lock1~0.offset=|v_~#lock1~0.offset_9|, ~#lock1~0.base=|v_~#lock1~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1#1] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,826 INFO L290 TraceCheckUtils]: 34: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [215] L688-1-->L689: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1#1] {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:24,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {713#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [216] L689-->L690: Formula: (= v_~glob1~0_8 |v_t_funThread1of1ForFork0_~t~0#1_3|) InVars {~glob1~0=v_~glob1~0_8} OutVars{t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_3|, ~glob1~0=v_~glob1~0_8} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~t~0#1] {714#(and (< 4 |t_funThread1of1ForFork0_~t~0#1|) (<= |t_funThread1of1ForFork0_~t~0#1| 5))} is VALID [2022-02-20 20:40:24,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {714#(and (< 4 |t_funThread1of1ForFork0_~t~0#1|) (<= |t_funThread1of1ForFork0_~t~0#1| 5))} [217] L690-->L690-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {714#(and (< 4 |t_funThread1of1ForFork0_~t~0#1|) (<= |t_funThread1of1ForFork0_~t~0#1| 5))} is VALID [2022-02-20 20:40:24,828 INFO L290 TraceCheckUtils]: 37: Hoare triple {714#(and (< 4 |t_funThread1of1ForFork0_~t~0#1|) (<= |t_funThread1of1ForFork0_~t~0#1| 5))} [218] L690-1-->L690-2: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1| (ite (= 5 |v_t_funThread1of1ForFork0_~t~0#1_5|) 1 0)) InVars {t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_5|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1|, t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_5|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1] {715#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:24,828 INFO L290 TraceCheckUtils]: 38: Hoare triple {715#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} [219] L690-2-->L19: Formula: true InVars {} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {715#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:24,829 INFO L290 TraceCheckUtils]: 39: Hoare triple {715#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} [220] L19-->L19-1: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3| |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_3|) InVars {t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {716#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:24,829 INFO L290 TraceCheckUtils]: 40: Hoare triple {716#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))} [221] L19-1-->L19-2: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5| 0) InVars {t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[] {712#false} is VALID [2022-02-20 20:40:24,830 INFO L290 TraceCheckUtils]: 41: Hoare triple {712#false} [223] L19-2-->t_funErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {712#false} is VALID [2022-02-20 20:40:24,830 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:40:24,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:24,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326010544] [2022-02-20 20:40:24,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326010544] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:24,831 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:24,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:40:24,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410141118] [2022-02-20 20:40:24,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:24,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 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:40:24,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:24,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 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:40:24,865 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:40:24,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:40:24,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:24,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:40:24,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:40:24,867 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 96 [2022-02-20 20:40:24,868 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 79 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 66.5) internal successors, (399), 6 states have internal predecessors, (399), 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:40:24,868 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:24,868 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 96 [2022-02-20 20:40:24,868 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:25,200 INFO L129 PetriNetUnfolder]: 99/474 cut-off events. [2022-02-20 20:40:25,200 INFO L130 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-02-20 20:40:25,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 474 events. 99/474 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2741 event pairs, 31 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 762. Up to 69 conditions per place. [2022-02-20 20:40:25,205 INFO L132 encePairwiseOnDemand]: 83/96 looper letters, 51 selfloop transitions, 19 changer transitions 2/127 dead transitions. [2022-02-20 20:40:25,205 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 127 transitions, 452 flow [2022-02-20 20:40:25,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:40:25,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-02-20 20:40:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 854 transitions. [2022-02-20 20:40:25,213 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7413194444444444 [2022-02-20 20:40:25,213 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 854 transitions. [2022-02-20 20:40:25,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 854 transitions. [2022-02-20 20:40:25,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:25,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 854 transitions. [2022-02-20 20:40:25,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 71.16666666666667) internal successors, (854), 12 states have internal predecessors, (854), 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:40:25,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 96.0) internal successors, (1248), 13 states have internal predecessors, (1248), 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:40:25,222 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 96.0) internal successors, (1248), 13 states have internal predecessors, (1248), 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:40:25,222 INFO L186 Difference]: Start difference. First operand has 87 places, 79 transitions, 183 flow. Second operand 12 states and 854 transitions. [2022-02-20 20:40:25,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 127 transitions, 452 flow [2022-02-20 20:40:25,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 127 transitions, 424 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-02-20 20:40:25,228 INFO L242 Difference]: Finished difference. Result has 99 places, 93 transitions, 286 flow [2022-02-20 20:40:25,228 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=286, PETRI_PLACES=99, PETRI_TRANSITIONS=93} [2022-02-20 20:40:25,229 INFO L334 CegarLoopForPetriNet]: 87 programPoint places, 12 predicate places. [2022-02-20 20:40:25,229 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 99 places, 93 transitions, 286 flow [2022-02-20 20:40:25,252 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 946 states, 933 states have (on average 1.8810289389067525) internal successors, (1755), 945 states have internal predecessors, (1755), 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:40:25,254 INFO L78 Accepts]: Start accepts. Automaton has has 946 states, 933 states have (on average 1.8810289389067525) internal successors, (1755), 945 states have internal predecessors, (1755), 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:40:25,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:25,254 INFO L470 AbstractCegarLoop]: Abstraction has has 99 places, 93 transitions, 286 flow [2022-02-20 20:40:25,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.5) internal successors, (399), 6 states have internal predecessors, (399), 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:40:25,255 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:25,255 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:25,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:40:25,255 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-20 20:40:25,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:25,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1104650203, now seen corresponding path program 1 times [2022-02-20 20:40:25,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:25,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429296733] [2022-02-20 20:40:25,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:25,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:25,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {1685#true} [194] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1685#true} is VALID [2022-02-20 20:40:25,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {1685#true} [171] 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] {1685#true} is VALID [2022-02-20 20:40:25,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {1685#true} [200] 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[] {1685#true} is VALID [2022-02-20 20:40:25,346 INFO L290 TraceCheckUtils]: 3: Hoare triple {1685#true} [202] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {1685#true} is VALID [2022-02-20 20:40:25,346 INFO L290 TraceCheckUtils]: 4: Hoare triple {1685#true} [148] L18-->L18-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {1685#true} is VALID [2022-02-20 20:40:25,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {1685#true} [195] L18-1-->L18-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {1685#true} is VALID [2022-02-20 20:40:25,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {1685#true} [181] L18-2-->L18-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {1685#true} is VALID [2022-02-20 20:40:25,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {1685#true} [184] L18-3-->L18-4: Formula: (and (= 34 (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[] {1685#true} is VALID [2022-02-20 20:40:25,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {1685#true} [185] L18-4-->L685: Formula: (= 5 v_~glob1~0_1) InVars {} OutVars{~glob1~0=v_~glob1~0_1} AuxVars[] AssignedVars[~glob1~0] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [133] L685-->L685-1: Formula: (and (= 3 |v_~#lock1~0.base_1|) (= |v_~#lock1~0.offset_1| 0)) InVars {} OutVars{~#lock1~0.offset=|v_~#lock1~0.offset_1|, ~#lock1~0.base=|v_~#lock1~0.base_1|} AuxVars[] AssignedVars[~#lock1~0.offset, ~#lock1~0.base] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [186] L685-1-->L685-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [206] L685-2-->L685-3: Formula: (= (select (select |v_#memory_int_3| |v_~#lock1~0.base_2|) |v_~#lock1~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#lock1~0.offset=|v_~#lock1~0.offset_2|, ~#lock1~0.base=|v_~#lock1~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#lock1~0.offset=|v_~#lock1~0.offset_2|, ~#lock1~0.base=|v_~#lock1~0.base_2|} AuxVars[] AssignedVars[] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [146] L685-3-->L685-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock1~0.base_3|) (+ |v_~#lock1~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#lock1~0.offset=|v_~#lock1~0.offset_3|, ~#lock1~0.base=|v_~#lock1~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#lock1~0.offset=|v_~#lock1~0.offset_3|, ~#lock1~0.base=|v_~#lock1~0.base_3|} AuxVars[] AssignedVars[] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [142] L685-4-->L685-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock1~0.base_4|) (+ |v_~#lock1~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#lock1~0.offset=|v_~#lock1~0.offset_4|, ~#lock1~0.base=|v_~#lock1~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#lock1~0.offset=|v_~#lock1~0.offset_4|, ~#lock1~0.base=|v_~#lock1~0.base_4|} AuxVars[] AssignedVars[] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [123] L685-5-->L685-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock1~0.base_5|) (+ |v_~#lock1~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#lock1~0.offset=|v_~#lock1~0.offset_5|, ~#lock1~0.base=|v_~#lock1~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#lock1~0.offset=|v_~#lock1~0.offset_5|, ~#lock1~0.base=|v_~#lock1~0.base_5|} AuxVars[] AssignedVars[] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [193] L685-6-->L685-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock1~0.base_6|) (+ 16 |v_~#lock1~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#lock1~0.offset=|v_~#lock1~0.offset_6|, ~#lock1~0.base=|v_~#lock1~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#lock1~0.offset=|v_~#lock1~0.offset_6|, ~#lock1~0.base=|v_~#lock1~0.base_6|} AuxVars[] AssignedVars[] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [129] L685-7-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [205] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [183] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [132] L-1-5-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post6#1=|v_ULTIMATE.start_main_#t~post6#1_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem7#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~post5#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre2#1] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [156] L698-->L698-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [153] L698-1-->L699: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [175] L699-->L699-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 5 v_~glob1~0_2) 1 0)) InVars {~glob1~0=v_~glob1~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~glob1~0=v_~glob1~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [140] L699-1-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [160] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [144] L19-1-->L19-5: Formula: (not (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_4| 0)) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_4|} AuxVars[] AssignedVars[] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [204] L19-5-->L700: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [203] L700-->L700-1: Formula: (= |v_ULTIMATE.start_main_#t~pre2#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [208] L700-1-->L700-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [149] L700-2-->L700-3: Formula: (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre2#1_3|)) |v_#memory_int_8|) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} AuxVars[] AssignedVars[#memory_int] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [243] L700-3-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre2#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_6|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_10|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_10|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_18|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~t~0#1, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_thidvar0] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [165] L700-4-->L700-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [119] L700-5-->L701: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [196] L701-->L701-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#lock1~0.base_7|))) (and (= (select .cse0 |v_~#lock1~0.offset_7|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#lock1~0.base_7| (store .cse0 |v_~#lock1~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet4#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#lock1~0.offset=|v_~#lock1~0.offset_7|, ~#lock1~0.base=|v_~#lock1~0.base_7|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|, #pthreadsMutex=|v_#pthreadsMutex_1|, ~#lock1~0.offset=|v_~#lock1~0.offset_7|, ~#lock1~0.base=|v_~#lock1~0.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, #pthreadsMutex] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [145] L701-1-->L702: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:25,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {1687#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [147] L702-->L702-1: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| v_~glob1~0_3) InVars {~glob1~0=v_~glob1~0_3} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ~glob1~0=v_~glob1~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1] {1688#(and (<= |ULTIMATE.start_main_#t~post5#1| 5) (<= 5 |ULTIMATE.start_main_#t~post5#1|))} is VALID [2022-02-20 20:40:25,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {1688#(and (<= |ULTIMATE.start_main_#t~post5#1| 5) (<= 5 |ULTIMATE.start_main_#t~post5#1|))} [158] L702-1-->L702-2: Formula: (= v_~glob1~0_4 (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ~glob1~0=v_~glob1~0_4} AuxVars[] AssignedVars[~glob1~0] {1689#(and (< 5 ~glob1~0) (<= ~glob1~0 6))} is VALID [2022-02-20 20:40:25,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {1689#(and (< 5 ~glob1~0) (<= ~glob1~0 6))} [174] L702-2-->L703: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1] {1689#(and (< 5 ~glob1~0) (<= ~glob1~0 6))} is VALID [2022-02-20 20:40:25,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {1689#(and (< 5 ~glob1~0) (<= ~glob1~0 6))} [128] L703-->L703-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1689#(and (< 5 ~glob1~0) (<= ~glob1~0 6))} is VALID [2022-02-20 20:40:25,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {1689#(and (< 5 ~glob1~0) (<= ~glob1~0 6))} [187] L703-1-->L703-2: Formula: (= (ite (= 6 v_~glob1~0_5) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_3|) InVars {~glob1~0=v_~glob1~0_5} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_3|, ~glob1~0=v_~glob1~0_5} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {1690#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:25,359 INFO L290 TraceCheckUtils]: 40: Hoare triple {1690#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [154] L703-2-->L19-6: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {1690#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:25,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {1690#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [201] L19-6-->L19-7: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_6| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_6|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {1691#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:25,360 INFO L290 TraceCheckUtils]: 42: Hoare triple {1691#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [121] L19-7-->L19-8: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_7| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[] {1686#false} is VALID [2022-02-20 20:40:25,360 INFO L290 TraceCheckUtils]: 43: Hoare triple {1686#false} [124] L19-8-->ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1686#false} is VALID [2022-02-20 20:40:25,360 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:40:25,361 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:25,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429296733] [2022-02-20 20:40:25,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429296733] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:25,361 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:25,361 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:40:25,361 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841145380] [2022-02-20 20:40:25,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:25,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 44 [2022-02-20 20:40:25,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:25,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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:40:25,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:25,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:40:25,389 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:25,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:40:25,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:40:25,391 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 96 [2022-02-20 20:40:25,391 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 93 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 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:40:25,391 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:25,391 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 96 [2022-02-20 20:40:25,391 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:25,671 INFO L129 PetriNetUnfolder]: 94/576 cut-off events. [2022-02-20 20:40:25,671 INFO L130 PetriNetUnfolder]: For 265/289 co-relation queries the response was YES. [2022-02-20 20:40:25,672 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 576 events. 94/576 cut-off events. For 265/289 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3963 event pairs, 3 based on Foata normal form. 10/574 useless extension candidates. Maximal degree in co-relation 1089. Up to 96 conditions per place. [2022-02-20 20:40:25,674 INFO L132 encePairwiseOnDemand]: 82/96 looper letters, 46 selfloop transitions, 26 changer transitions 4/139 dead transitions. [2022-02-20 20:40:25,674 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 139 transitions, 637 flow [2022-02-20 20:40:25,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 20:40:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-02-20 20:40:25,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 908 transitions. [2022-02-20 20:40:25,681 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7275641025641025 [2022-02-20 20:40:25,681 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 908 transitions. [2022-02-20 20:40:25,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 908 transitions. [2022-02-20 20:40:25,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:25,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 908 transitions. [2022-02-20 20:40:25,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 69.84615384615384) internal successors, (908), 13 states have internal predecessors, (908), 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:40:25,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 96.0) internal successors, (1344), 14 states have internal predecessors, (1344), 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:40:25,685 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 96.0) internal successors, (1344), 14 states have internal predecessors, (1344), 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:40:25,685 INFO L186 Difference]: Start difference. First operand has 99 places, 93 transitions, 286 flow. Second operand 13 states and 908 transitions. [2022-02-20 20:40:25,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 139 transitions, 637 flow [2022-02-20 20:40:32,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 139 transitions, 633 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-02-20 20:40:32,277 INFO L242 Difference]: Finished difference. Result has 118 places, 110 transitions, 460 flow [2022-02-20 20:40:32,278 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=460, PETRI_PLACES=118, PETRI_TRANSITIONS=110} [2022-02-20 20:40:32,278 INFO L334 CegarLoopForPetriNet]: 87 programPoint places, 31 predicate places. [2022-02-20 20:40:32,278 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 118 places, 110 transitions, 460 flow [2022-02-20 20:40:32,313 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1271 states, 1253 states have (on average 1.87390263367917) internal successors, (2348), 1270 states have internal predecessors, (2348), 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:40:32,315 INFO L78 Accepts]: Start accepts. Automaton has has 1271 states, 1253 states have (on average 1.87390263367917) internal successors, (2348), 1270 states have internal predecessors, (2348), 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 44 [2022-02-20 20:40:32,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:32,316 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 110 transitions, 460 flow [2022-02-20 20:40:32,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 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:40:32,316 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:32,316 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:32,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:40:32,317 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-20 20:40:32,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:32,317 INFO L85 PathProgramCache]: Analyzing trace with hash 303594596, now seen corresponding path program 1 times [2022-02-20 20:40:32,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:32,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343201721] [2022-02-20 20:40:32,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:32,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:32,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {2988#true} [194] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2988#true} is VALID [2022-02-20 20:40:32,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {2988#true} [171] 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] {2988#true} is VALID [2022-02-20 20:40:32,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {2988#true} [200] 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[] {2988#true} is VALID [2022-02-20 20:40:32,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {2988#true} [202] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {2988#true} is VALID [2022-02-20 20:40:32,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {2988#true} [148] L18-->L18-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {2988#true} is VALID [2022-02-20 20:40:32,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {2988#true} [195] L18-1-->L18-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {2988#true} is VALID [2022-02-20 20:40:32,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {2988#true} [181] L18-2-->L18-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {2988#true} is VALID [2022-02-20 20:40:32,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {2988#true} [184] L18-3-->L18-4: Formula: (and (= 34 (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[] {2988#true} is VALID [2022-02-20 20:40:32,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {2988#true} [185] L18-4-->L685: Formula: (= 5 v_~glob1~0_1) InVars {} OutVars{~glob1~0=v_~glob1~0_1} AuxVars[] AssignedVars[~glob1~0] {2988#true} is VALID [2022-02-20 20:40:32,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {2988#true} [133] L685-->L685-1: Formula: (and (= 3 |v_~#lock1~0.base_1|) (= |v_~#lock1~0.offset_1| 0)) InVars {} OutVars{~#lock1~0.offset=|v_~#lock1~0.offset_1|, ~#lock1~0.base=|v_~#lock1~0.base_1|} AuxVars[] AssignedVars[~#lock1~0.offset, ~#lock1~0.base] {2988#true} is VALID [2022-02-20 20:40:32,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {2988#true} [186] L685-1-->L685-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {2988#true} is VALID [2022-02-20 20:40:32,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {2988#true} [206] L685-2-->L685-3: Formula: (= (select (select |v_#memory_int_3| |v_~#lock1~0.base_2|) |v_~#lock1~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#lock1~0.offset=|v_~#lock1~0.offset_2|, ~#lock1~0.base=|v_~#lock1~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#lock1~0.offset=|v_~#lock1~0.offset_2|, ~#lock1~0.base=|v_~#lock1~0.base_2|} AuxVars[] AssignedVars[] {2988#true} is VALID [2022-02-20 20:40:32,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {2988#true} [146] L685-3-->L685-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock1~0.base_3|) (+ |v_~#lock1~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#lock1~0.offset=|v_~#lock1~0.offset_3|, ~#lock1~0.base=|v_~#lock1~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#lock1~0.offset=|v_~#lock1~0.offset_3|, ~#lock1~0.base=|v_~#lock1~0.base_3|} AuxVars[] AssignedVars[] {2988#true} is VALID [2022-02-20 20:40:32,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {2988#true} [142] L685-4-->L685-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock1~0.base_4|) (+ |v_~#lock1~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#lock1~0.offset=|v_~#lock1~0.offset_4|, ~#lock1~0.base=|v_~#lock1~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#lock1~0.offset=|v_~#lock1~0.offset_4|, ~#lock1~0.base=|v_~#lock1~0.base_4|} AuxVars[] AssignedVars[] {2988#true} is VALID [2022-02-20 20:40:32,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {2988#true} [123] L685-5-->L685-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock1~0.base_5|) (+ |v_~#lock1~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#lock1~0.offset=|v_~#lock1~0.offset_5|, ~#lock1~0.base=|v_~#lock1~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#lock1~0.offset=|v_~#lock1~0.offset_5|, ~#lock1~0.base=|v_~#lock1~0.base_5|} AuxVars[] AssignedVars[] {2988#true} is VALID [2022-02-20 20:40:32,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {2988#true} [193] L685-6-->L685-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock1~0.base_6|) (+ 16 |v_~#lock1~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#lock1~0.offset=|v_~#lock1~0.offset_6|, ~#lock1~0.base=|v_~#lock1~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#lock1~0.offset=|v_~#lock1~0.offset_6|, ~#lock1~0.base=|v_~#lock1~0.base_6|} AuxVars[] AssignedVars[] {2988#true} is VALID [2022-02-20 20:40:32,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {2988#true} [129] L685-7-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2988#true} is VALID [2022-02-20 20:40:32,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {2988#true} [205] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2988#true} is VALID [2022-02-20 20:40:32,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {2988#true} [183] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {2988#true} is VALID [2022-02-20 20:40:32,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {2988#true} [132] L-1-5-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post6#1=|v_ULTIMATE.start_main_#t~post6#1_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem7#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~post5#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre2#1] {2988#true} is VALID [2022-02-20 20:40:32,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {2988#true} [156] L698-->L698-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {2988#true} is VALID [2022-02-20 20:40:32,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {2988#true} [153] L698-1-->L699: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2988#true} is VALID [2022-02-20 20:40:32,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {2988#true} [175] L699-->L699-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 5 v_~glob1~0_2) 1 0)) InVars {~glob1~0=v_~glob1~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~glob1~0=v_~glob1~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {2988#true} is VALID [2022-02-20 20:40:32,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {2988#true} [140] L699-1-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {2988#true} is VALID [2022-02-20 20:40:32,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {2988#true} [160] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {2988#true} is VALID [2022-02-20 20:40:32,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {2988#true} [144] L19-1-->L19-5: Formula: (not (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_4| 0)) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_4|} AuxVars[] AssignedVars[] {2988#true} is VALID [2022-02-20 20:40:32,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {2988#true} [204] L19-5-->L700: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2988#true} is VALID [2022-02-20 20:40:32,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {2988#true} [203] L700-->L700-1: Formula: (= |v_ULTIMATE.start_main_#t~pre2#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {2988#true} is VALID [2022-02-20 20:40:32,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {2988#true} [208] L700-1-->L700-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {2988#true} is VALID [2022-02-20 20:40:32,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {2988#true} [149] L700-2-->L700-3: Formula: (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre2#1_3|)) |v_#memory_int_8|) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} AuxVars[] AssignedVars[#memory_int] {2988#true} is VALID [2022-02-20 20:40:32,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {2988#true} [243] L700-3-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre2#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_6|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_10|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_10|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_18|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~t~0#1, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_thidvar0] {2988#true} is VALID [2022-02-20 20:40:32,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {2988#true} [165] L700-4-->L700-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {2988#true} is VALID [2022-02-20 20:40:32,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {2988#true} [119] L700-5-->L701: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {2988#true} is VALID [2022-02-20 20:40:32,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {2988#true} [196] L701-->L701-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#lock1~0.base_7|))) (and (= (select .cse0 |v_~#lock1~0.offset_7|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#lock1~0.base_7| (store .cse0 |v_~#lock1~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet4#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#lock1~0.offset=|v_~#lock1~0.offset_7|, ~#lock1~0.base=|v_~#lock1~0.base_7|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|, #pthreadsMutex=|v_#pthreadsMutex_1|, ~#lock1~0.offset=|v_~#lock1~0.offset_7|, ~#lock1~0.base=|v_~#lock1~0.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, #pthreadsMutex] {2990#(= (select (select |#pthreadsMutex| |~#lock1~0.base|) |~#lock1~0.offset|) 1)} is VALID [2022-02-20 20:40:32,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {2990#(= (select (select |#pthreadsMutex| |~#lock1~0.base|) |~#lock1~0.offset|) 1)} [145] L701-1-->L702: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {2990#(= (select (select |#pthreadsMutex| |~#lock1~0.base|) |~#lock1~0.offset|) 1)} is VALID [2022-02-20 20:40:32,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {2990#(= (select (select |#pthreadsMutex| |~#lock1~0.base|) |~#lock1~0.offset|) 1)} [147] L702-->L702-1: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| v_~glob1~0_3) InVars {~glob1~0=v_~glob1~0_3} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ~glob1~0=v_~glob1~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1] {2990#(= (select (select |#pthreadsMutex| |~#lock1~0.base|) |~#lock1~0.offset|) 1)} is VALID [2022-02-20 20:40:32,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {2990#(= (select (select |#pthreadsMutex| |~#lock1~0.base|) |~#lock1~0.offset|) 1)} [158] L702-1-->L702-2: Formula: (= v_~glob1~0_4 (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ~glob1~0=v_~glob1~0_4} AuxVars[] AssignedVars[~glob1~0] {2990#(= (select (select |#pthreadsMutex| |~#lock1~0.base|) |~#lock1~0.offset|) 1)} is VALID [2022-02-20 20:40:32,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {2990#(= (select (select |#pthreadsMutex| |~#lock1~0.base|) |~#lock1~0.offset|) 1)} [212] t_funENTRY-->L687: Formula: (and (= |v_t_funThread1of1ForFork0_~arg#1.offset_1| |v_t_funThread1of1ForFork0_#in~arg#1.offset_1|) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_1| |v_t_funThread1of1ForFork0_~arg#1.base_1|)) InVars {t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base] {2990#(= (select (select |#pthreadsMutex| |~#lock1~0.base|) |~#lock1~0.offset|) 1)} is VALID [2022-02-20 20:40:32,387 INFO L290 TraceCheckUtils]: 38: Hoare triple {2990#(= (select (select |#pthreadsMutex| |~#lock1~0.base|) |~#lock1~0.offset|) 1)} [213] L687-->L688: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~t~0#1] {2990#(= (select (select |#pthreadsMutex| |~#lock1~0.base|) |~#lock1~0.offset|) 1)} is VALID [2022-02-20 20:40:32,387 INFO L290 TraceCheckUtils]: 39: Hoare triple {2990#(= (select (select |#pthreadsMutex| |~#lock1~0.base|) |~#lock1~0.offset|) 1)} [214] L688-->L688-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#lock1~0.base_9|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet1#1_1| 0) (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#lock1~0.base_9| (store .cse0 |v_~#lock1~0.offset_9| 1))) (= (select .cse0 |v_~#lock1~0.offset_9|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#lock1~0.offset=|v_~#lock1~0.offset_9|, ~#lock1~0.base=|v_~#lock1~0.base_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_1|, ~#lock1~0.offset=|v_~#lock1~0.offset_9|, ~#lock1~0.base=|v_~#lock1~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1#1] {2989#false} is VALID [2022-02-20 20:40:32,387 INFO L290 TraceCheckUtils]: 40: Hoare triple {2989#false} [215] L688-1-->L689: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1#1] {2989#false} is VALID [2022-02-20 20:40:32,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {2989#false} [216] L689-->L690: Formula: (= v_~glob1~0_8 |v_t_funThread1of1ForFork0_~t~0#1_3|) InVars {~glob1~0=v_~glob1~0_8} OutVars{t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_3|, ~glob1~0=v_~glob1~0_8} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~t~0#1] {2989#false} is VALID [2022-02-20 20:40:32,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {2989#false} [217] L690-->L690-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2989#false} is VALID [2022-02-20 20:40:32,389 INFO L290 TraceCheckUtils]: 43: Hoare triple {2989#false} [218] L690-1-->L690-2: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1| (ite (= 5 |v_t_funThread1of1ForFork0_~t~0#1_5|) 1 0)) InVars {t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_5|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1|, t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_5|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1] {2989#false} is VALID [2022-02-20 20:40:32,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {2989#false} [219] L690-2-->L19: Formula: true InVars {} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {2989#false} is VALID [2022-02-20 20:40:32,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {2989#false} [220] L19-->L19-1: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3| |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_3|) InVars {t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {2989#false} is VALID [2022-02-20 20:40:32,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {2989#false} [221] L19-1-->L19-2: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5| 0) InVars {t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[] {2989#false} is VALID [2022-02-20 20:40:32,390 INFO L290 TraceCheckUtils]: 47: Hoare triple {2989#false} [223] L19-2-->t_funErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2989#false} is VALID [2022-02-20 20:40:32,390 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:40:32,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:32,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343201721] [2022-02-20 20:40:32,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343201721] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:32,391 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:32,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:40:32,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503165694] [2022-02-20 20:40:32,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:32,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2022-02-20 20:40:32,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:32,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:40:32,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:32,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:40:32,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:32,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:40:32,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:40:32,417 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 96 [2022-02-20 20:40:32,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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:40:32,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:32,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 96 [2022-02-20 20:40:32,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:32,515 INFO L129 PetriNetUnfolder]: 0/115 cut-off events. [2022-02-20 20:40:32,515 INFO L130 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-02-20 20:40:32,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 115 events. 0/115 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 2/117 useless extension candidates. Maximal degree in co-relation 0. Up to 12 conditions per place. [2022-02-20 20:40:32,516 INFO L132 encePairwiseOnDemand]: 92/96 looper letters, 7 selfloop transitions, 4 changer transitions 4/94 dead transitions. [2022-02-20 20:40:32,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 94 transitions, 356 flow [2022-02-20 20:40:32,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:40:32,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:40:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 241 transitions. [2022-02-20 20:40:32,518 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8368055555555556 [2022-02-20 20:40:32,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 241 transitions. [2022-02-20 20:40:32,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 241 transitions. [2022-02-20 20:40:32,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:32,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 241 transitions. [2022-02-20 20:40:32,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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:40:32,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 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:40:32,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 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:40:32,520 INFO L186 Difference]: Start difference. First operand has 118 places, 110 transitions, 460 flow. Second operand 3 states and 241 transitions. [2022-02-20 20:40:32,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 94 transitions, 356 flow [2022-02-20 20:40:32,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 94 transitions, 322 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-02-20 20:40:32,543 INFO L242 Difference]: Finished difference. Result has 109 places, 90 transitions, 290 flow [2022-02-20 20:40:32,544 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=109, PETRI_TRANSITIONS=90} [2022-02-20 20:40:32,544 INFO L334 CegarLoopForPetriNet]: 87 programPoint places, 22 predicate places. [2022-02-20 20:40:32,545 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 90 transitions, 290 flow [2022-02-20 20:40:32,548 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 223 states, 219 states have (on average 1.5616438356164384) internal successors, (342), 222 states have internal predecessors, (342), 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:40:32,549 INFO L78 Accepts]: Start accepts. Automaton has has 223 states, 219 states have (on average 1.5616438356164384) internal successors, (342), 222 states have internal predecessors, (342), 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 48 [2022-02-20 20:40:32,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:32,549 INFO L470 AbstractCegarLoop]: Abstraction has has 109 places, 90 transitions, 290 flow [2022-02-20 20:40:32,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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:40:32,549 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:32,550 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:32,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:40:32,550 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-20 20:40:32,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:32,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1778536600, now seen corresponding path program 1 times [2022-02-20 20:40:32,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:32,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890042008] [2022-02-20 20:40:32,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:32,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:32,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {3216#true} [194] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {3216#true} [171] 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] {3216#true} is VALID [2022-02-20 20:40:32,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {3216#true} [200] 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[] {3216#true} is VALID [2022-02-20 20:40:32,618 INFO L290 TraceCheckUtils]: 3: Hoare triple {3216#true} [202] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,619 INFO L290 TraceCheckUtils]: 4: Hoare triple {3216#true} [148] L18-->L18-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {3216#true} [195] L18-1-->L18-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {3216#true} [181] L18-2-->L18-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {3216#true} [184] L18-3-->L18-4: Formula: (and (= 34 (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[] {3216#true} is VALID [2022-02-20 20:40:32,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {3216#true} [185] L18-4-->L685: Formula: (= 5 v_~glob1~0_1) InVars {} OutVars{~glob1~0=v_~glob1~0_1} AuxVars[] AssignedVars[~glob1~0] {3216#true} is VALID [2022-02-20 20:40:32,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {3216#true} [133] L685-->L685-1: Formula: (and (= 3 |v_~#lock1~0.base_1|) (= |v_~#lock1~0.offset_1| 0)) InVars {} OutVars{~#lock1~0.offset=|v_~#lock1~0.offset_1|, ~#lock1~0.base=|v_~#lock1~0.base_1|} AuxVars[] AssignedVars[~#lock1~0.offset, ~#lock1~0.base] {3216#true} is VALID [2022-02-20 20:40:32,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {3216#true} [186] L685-1-->L685-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {3216#true} [206] L685-2-->L685-3: Formula: (= (select (select |v_#memory_int_3| |v_~#lock1~0.base_2|) |v_~#lock1~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#lock1~0.offset=|v_~#lock1~0.offset_2|, ~#lock1~0.base=|v_~#lock1~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#lock1~0.offset=|v_~#lock1~0.offset_2|, ~#lock1~0.base=|v_~#lock1~0.base_2|} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {3216#true} [146] L685-3-->L685-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock1~0.base_3|) (+ |v_~#lock1~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#lock1~0.offset=|v_~#lock1~0.offset_3|, ~#lock1~0.base=|v_~#lock1~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#lock1~0.offset=|v_~#lock1~0.offset_3|, ~#lock1~0.base=|v_~#lock1~0.base_3|} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {3216#true} [142] L685-4-->L685-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock1~0.base_4|) (+ |v_~#lock1~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#lock1~0.offset=|v_~#lock1~0.offset_4|, ~#lock1~0.base=|v_~#lock1~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#lock1~0.offset=|v_~#lock1~0.offset_4|, ~#lock1~0.base=|v_~#lock1~0.base_4|} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {3216#true} [123] L685-5-->L685-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock1~0.base_5|) (+ |v_~#lock1~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#lock1~0.offset=|v_~#lock1~0.offset_5|, ~#lock1~0.base=|v_~#lock1~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#lock1~0.offset=|v_~#lock1~0.offset_5|, ~#lock1~0.base=|v_~#lock1~0.base_5|} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {3216#true} [193] L685-6-->L685-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock1~0.base_6|) (+ 16 |v_~#lock1~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#lock1~0.offset=|v_~#lock1~0.offset_6|, ~#lock1~0.base=|v_~#lock1~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#lock1~0.offset=|v_~#lock1~0.offset_6|, ~#lock1~0.base=|v_~#lock1~0.base_6|} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {3216#true} [129] L685-7-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {3216#true} [205] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {3216#true} [183] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {3216#true} is VALID [2022-02-20 20:40:32,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {3216#true} [132] L-1-5-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post6#1=|v_ULTIMATE.start_main_#t~post6#1_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem7#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~post5#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre2#1] {3216#true} is VALID [2022-02-20 20:40:32,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {3216#true} [156] L698-->L698-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {3216#true} is VALID [2022-02-20 20:40:32,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {3216#true} [153] L698-1-->L699: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {3216#true} [175] L699-->L699-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 5 v_~glob1~0_2) 1 0)) InVars {~glob1~0=v_~glob1~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~glob1~0=v_~glob1~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {3216#true} is VALID [2022-02-20 20:40:32,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {3216#true} [140] L699-1-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {3216#true} is VALID [2022-02-20 20:40:32,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {3216#true} [160] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {3216#true} is VALID [2022-02-20 20:40:32,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {3216#true} [144] L19-1-->L19-5: Formula: (not (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_4| 0)) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_4|} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {3216#true} [204] L19-5-->L700: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {3216#true} [203] L700-->L700-1: Formula: (= |v_ULTIMATE.start_main_#t~pre2#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {3216#true} is VALID [2022-02-20 20:40:32,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {3216#true} [208] L700-1-->L700-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {3216#true} is VALID [2022-02-20 20:40:32,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {3216#true} [149] L700-2-->L700-3: Formula: (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre2#1_3|)) |v_#memory_int_8|) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} AuxVars[] AssignedVars[#memory_int] {3216#true} is VALID [2022-02-20 20:40:32,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {3216#true} [243] L700-3-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre2#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_6|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_10|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_10|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_18|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~t~0#1, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_thidvar0] {3216#true} is VALID [2022-02-20 20:40:32,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {3216#true} [212] t_funENTRY-->L687: Formula: (and (= |v_t_funThread1of1ForFork0_~arg#1.offset_1| |v_t_funThread1of1ForFork0_#in~arg#1.offset_1|) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_1| |v_t_funThread1of1ForFork0_~arg#1.base_1|)) InVars {t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base] {3216#true} is VALID [2022-02-20 20:40:32,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {3216#true} [213] L687-->L688: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~t~0#1] {3216#true} is VALID [2022-02-20 20:40:32,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {3216#true} [214] L688-->L688-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#lock1~0.base_9|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet1#1_1| 0) (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#lock1~0.base_9| (store .cse0 |v_~#lock1~0.offset_9| 1))) (= (select .cse0 |v_~#lock1~0.offset_9|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#lock1~0.offset=|v_~#lock1~0.offset_9|, ~#lock1~0.base=|v_~#lock1~0.base_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_1|, ~#lock1~0.offset=|v_~#lock1~0.offset_9|, ~#lock1~0.base=|v_~#lock1~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1#1] {3216#true} is VALID [2022-02-20 20:40:32,624 INFO L290 TraceCheckUtils]: 34: Hoare triple {3216#true} [215] L688-1-->L689: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1#1] {3216#true} is VALID [2022-02-20 20:40:32,624 INFO L290 TraceCheckUtils]: 35: Hoare triple {3216#true} [216] L689-->L690: Formula: (= v_~glob1~0_8 |v_t_funThread1of1ForFork0_~t~0#1_3|) InVars {~glob1~0=v_~glob1~0_8} OutVars{t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_3|, ~glob1~0=v_~glob1~0_8} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~t~0#1] {3216#true} is VALID [2022-02-20 20:40:32,624 INFO L290 TraceCheckUtils]: 36: Hoare triple {3216#true} [217] L690-->L690-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {3216#true} [218] L690-1-->L690-2: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1| (ite (= 5 |v_t_funThread1of1ForFork0_~t~0#1_5|) 1 0)) InVars {t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_5|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1|, t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_5|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1] {3216#true} is VALID [2022-02-20 20:40:32,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {3216#true} [219] L690-2-->L19: Formula: true InVars {} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {3216#true} is VALID [2022-02-20 20:40:32,624 INFO L290 TraceCheckUtils]: 39: Hoare triple {3216#true} [220] L19-->L19-1: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3| |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_3|) InVars {t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {3216#true} is VALID [2022-02-20 20:40:32,624 INFO L290 TraceCheckUtils]: 40: Hoare triple {3216#true} [222] L19-1-->L19-5: Formula: (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,625 INFO L290 TraceCheckUtils]: 41: Hoare triple {3216#true} [225] L19-5-->L691: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3216#true} is VALID [2022-02-20 20:40:32,625 INFO L290 TraceCheckUtils]: 42: Hoare triple {3216#true} [227] L691-->L692: Formula: (= v_~glob1~0_9 (- 10)) InVars {} OutVars{~glob1~0=v_~glob1~0_9} AuxVars[] AssignedVars[~glob1~0] {3218#(= (+ ~glob1~0 10) 0)} is VALID [2022-02-20 20:40:32,628 INFO L290 TraceCheckUtils]: 43: Hoare triple {3218#(= (+ ~glob1~0 10) 0)} [228] L692-->L692-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3218#(= (+ ~glob1~0 10) 0)} is VALID [2022-02-20 20:40:32,628 INFO L290 TraceCheckUtils]: 44: Hoare triple {3218#(= (+ ~glob1~0 10) 0)} [229] L692-1-->L692-2: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_5| (ite (= v_~glob1~0_10 (- 10)) 1 0)) InVars {~glob1~0=v_~glob1~0_10} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_5|, ~glob1~0=v_~glob1~0_10} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1] {3219#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:32,628 INFO L290 TraceCheckUtils]: 45: Hoare triple {3219#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} [230] L692-2-->L19-6: Formula: true InVars {} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_9|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {3219#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:32,629 INFO L290 TraceCheckUtils]: 46: Hoare triple {3219#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} [231] L19-6-->L19-7: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_7| |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_11|) InVars {t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_7|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_7|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_11|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {3220#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:32,629 INFO L290 TraceCheckUtils]: 47: Hoare triple {3220#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))} [232] L19-7-->L19-8: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_13| 0) InVars {t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_13|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_13|} AuxVars[] AssignedVars[] {3217#false} is VALID [2022-02-20 20:40:32,629 INFO L290 TraceCheckUtils]: 48: Hoare triple {3217#false} [234] L19-8-->t_funErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3217#false} is VALID [2022-02-20 20:40:32,630 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:40:32,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:32,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890042008] [2022-02-20 20:40:32,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890042008] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:32,630 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:32,630 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:40:32,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012071873] [2022-02-20 20:40:32,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:32,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 49 [2022-02-20 20:40:32,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:32,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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:40:32,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:32,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:40:32,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:32,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:40:32,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:40:32,661 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 96 [2022-02-20 20:40:32,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 90 transitions, 290 flow. Second operand has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 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:40:32,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:32,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 96 [2022-02-20 20:40:32,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:32,722 INFO L129 PetriNetUnfolder]: 0/98 cut-off events. [2022-02-20 20:40:32,722 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-02-20 20:40:32,722 INFO L84 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 98 events. 0/98 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 78 event pairs, 0 based on Foata normal form. 2/100 useless extension candidates. Maximal degree in co-relation 0. Up to 18 conditions per place. [2022-02-20 20:40:32,723 INFO L132 encePairwiseOnDemand]: 89/96 looper letters, 20 selfloop transitions, 6 changer transitions 4/88 dead transitions. [2022-02-20 20:40:32,723 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 88 transitions, 346 flow [2022-02-20 20:40:32,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:40:32,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:40:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 486 transitions. [2022-02-20 20:40:32,726 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7232142857142857 [2022-02-20 20:40:32,727 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 486 transitions. [2022-02-20 20:40:32,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 486 transitions. [2022-02-20 20:40:32,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:32,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 486 transitions. [2022-02-20 20:40:32,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 69.42857142857143) internal successors, (486), 7 states have internal predecessors, (486), 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:40:32,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 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:40:32,729 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 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:40:32,729 INFO L186 Difference]: Start difference. First operand has 109 places, 90 transitions, 290 flow. Second operand 7 states and 486 transitions. [2022-02-20 20:40:32,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 88 transitions, 346 flow [2022-02-20 20:40:32,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 88 transitions, 337 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:40:32,765 INFO L242 Difference]: Finished difference. Result has 111 places, 84 transitions, 271 flow [2022-02-20 20:40:32,766 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=271, PETRI_PLACES=111, PETRI_TRANSITIONS=84} [2022-02-20 20:40:32,766 INFO L334 CegarLoopForPetriNet]: 87 programPoint places, 24 predicate places. [2022-02-20 20:40:32,766 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 111 places, 84 transitions, 271 flow [2022-02-20 20:40:32,769 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 199 states, 197 states have (on average 1.5482233502538072) internal successors, (305), 198 states have internal predecessors, (305), 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:40:32,770 INFO L78 Accepts]: Start accepts. Automaton has has 199 states, 197 states have (on average 1.5482233502538072) internal successors, (305), 198 states have internal predecessors, (305), 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 49 [2022-02-20 20:40:32,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:32,770 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 84 transitions, 271 flow [2022-02-20 20:40:32,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 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:40:32,770 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:32,771 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:32,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:40:32,771 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-20 20:40:32,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:32,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1775114754, now seen corresponding path program 1 times [2022-02-20 20:40:32,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:32,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501496343] [2022-02-20 20:40:32,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:32,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:32,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {3430#true} [194] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-02-20 20:40:32,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {3430#true} [171] 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] {3430#true} is VALID [2022-02-20 20:40:32,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {3430#true} [200] 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[] {3430#true} is VALID [2022-02-20 20:40:32,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {3430#true} [202] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-02-20 20:40:32,867 INFO L290 TraceCheckUtils]: 4: Hoare triple {3430#true} [148] L18-->L18-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-02-20 20:40:32,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {3430#true} [195] L18-1-->L18-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-02-20 20:40:32,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {3430#true} [181] L18-2-->L18-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-02-20 20:40:32,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {3430#true} [184] L18-3-->L18-4: Formula: (and (= 34 (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[] {3430#true} is VALID [2022-02-20 20:40:32,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {3430#true} [185] L18-4-->L685: Formula: (= 5 v_~glob1~0_1) InVars {} OutVars{~glob1~0=v_~glob1~0_1} AuxVars[] AssignedVars[~glob1~0] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [133] L685-->L685-1: Formula: (and (= 3 |v_~#lock1~0.base_1|) (= |v_~#lock1~0.offset_1| 0)) InVars {} OutVars{~#lock1~0.offset=|v_~#lock1~0.offset_1|, ~#lock1~0.base=|v_~#lock1~0.base_1|} AuxVars[] AssignedVars[~#lock1~0.offset, ~#lock1~0.base] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [186] L685-1-->L685-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [206] L685-2-->L685-3: Formula: (= (select (select |v_#memory_int_3| |v_~#lock1~0.base_2|) |v_~#lock1~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#lock1~0.offset=|v_~#lock1~0.offset_2|, ~#lock1~0.base=|v_~#lock1~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#lock1~0.offset=|v_~#lock1~0.offset_2|, ~#lock1~0.base=|v_~#lock1~0.base_2|} AuxVars[] AssignedVars[] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [146] L685-3-->L685-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock1~0.base_3|) (+ |v_~#lock1~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#lock1~0.offset=|v_~#lock1~0.offset_3|, ~#lock1~0.base=|v_~#lock1~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#lock1~0.offset=|v_~#lock1~0.offset_3|, ~#lock1~0.base=|v_~#lock1~0.base_3|} AuxVars[] AssignedVars[] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [142] L685-4-->L685-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock1~0.base_4|) (+ |v_~#lock1~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#lock1~0.offset=|v_~#lock1~0.offset_4|, ~#lock1~0.base=|v_~#lock1~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#lock1~0.offset=|v_~#lock1~0.offset_4|, ~#lock1~0.base=|v_~#lock1~0.base_4|} AuxVars[] AssignedVars[] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [123] L685-5-->L685-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock1~0.base_5|) (+ |v_~#lock1~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#lock1~0.offset=|v_~#lock1~0.offset_5|, ~#lock1~0.base=|v_~#lock1~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#lock1~0.offset=|v_~#lock1~0.offset_5|, ~#lock1~0.base=|v_~#lock1~0.base_5|} AuxVars[] AssignedVars[] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [193] L685-6-->L685-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock1~0.base_6|) (+ 16 |v_~#lock1~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#lock1~0.offset=|v_~#lock1~0.offset_6|, ~#lock1~0.base=|v_~#lock1~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#lock1~0.offset=|v_~#lock1~0.offset_6|, ~#lock1~0.base=|v_~#lock1~0.base_6|} AuxVars[] AssignedVars[] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [129] L685-7-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [205] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [183] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [132] L-1-5-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post6#1=|v_ULTIMATE.start_main_#t~post6#1_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem7#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~post5#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre2#1] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [156] L698-->L698-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [153] L698-1-->L699: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [175] L699-->L699-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 5 v_~glob1~0_2) 1 0)) InVars {~glob1~0=v_~glob1~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~glob1~0=v_~glob1~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [140] L699-1-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [160] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [144] L19-1-->L19-5: Formula: (not (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_4| 0)) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_4|} AuxVars[] AssignedVars[] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [204] L19-5-->L700: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [203] L700-->L700-1: Formula: (= |v_ULTIMATE.start_main_#t~pre2#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [208] L700-1-->L700-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [149] L700-2-->L700-3: Formula: (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre2#1_3|)) |v_#memory_int_8|) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} AuxVars[] AssignedVars[#memory_int] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [243] L700-3-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre2#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_6|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_10|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_10|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_18|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~t~0#1, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_thidvar0] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [165] L700-4-->L700-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,876 INFO L290 TraceCheckUtils]: 32: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [119] L700-5-->L701: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [196] L701-->L701-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#lock1~0.base_7|))) (and (= (select .cse0 |v_~#lock1~0.offset_7|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#lock1~0.base_7| (store .cse0 |v_~#lock1~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet4#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#lock1~0.offset=|v_~#lock1~0.offset_7|, ~#lock1~0.base=|v_~#lock1~0.base_7|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|, #pthreadsMutex=|v_#pthreadsMutex_1|, ~#lock1~0.offset=|v_~#lock1~0.offset_7|, ~#lock1~0.base=|v_~#lock1~0.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, #pthreadsMutex] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [145] L701-1-->L702: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,882 INFO L290 TraceCheckUtils]: 35: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [147] L702-->L702-1: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| v_~glob1~0_3) InVars {~glob1~0=v_~glob1~0_3} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ~glob1~0=v_~glob1~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1] {3433#(and (<= |ULTIMATE.start_main_#t~post5#1| 5) (<= 5 |ULTIMATE.start_main_#t~post5#1|))} is VALID [2022-02-20 20:40:32,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {3433#(and (<= |ULTIMATE.start_main_#t~post5#1| 5) (<= 5 |ULTIMATE.start_main_#t~post5#1|))} [158] L702-1-->L702-2: Formula: (= v_~glob1~0_4 (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ~glob1~0=v_~glob1~0_4} AuxVars[] AssignedVars[~glob1~0] {3434#(and (<= 6 ~glob1~0) (<= ~glob1~0 6))} is VALID [2022-02-20 20:40:32,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {3434#(and (<= 6 ~glob1~0) (<= ~glob1~0 6))} [174] L702-2-->L703: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1] {3434#(and (<= 6 ~glob1~0) (<= ~glob1~0 6))} is VALID [2022-02-20 20:40:32,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {3434#(and (<= 6 ~glob1~0) (<= ~glob1~0 6))} [128] L703-->L703-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3434#(and (<= 6 ~glob1~0) (<= ~glob1~0 6))} is VALID [2022-02-20 20:40:32,883 INFO L290 TraceCheckUtils]: 39: Hoare triple {3434#(and (<= 6 ~glob1~0) (<= ~glob1~0 6))} [187] L703-1-->L703-2: Formula: (= (ite (= 6 v_~glob1~0_5) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_3|) InVars {~glob1~0=v_~glob1~0_5} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_3|, ~glob1~0=v_~glob1~0_5} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {3434#(and (<= 6 ~glob1~0) (<= ~glob1~0 6))} is VALID [2022-02-20 20:40:32,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {3434#(and (<= 6 ~glob1~0) (<= ~glob1~0 6))} [154] L703-2-->L19-6: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {3434#(and (<= 6 ~glob1~0) (<= ~glob1~0 6))} is VALID [2022-02-20 20:40:32,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {3434#(and (<= 6 ~glob1~0) (<= ~glob1~0 6))} [201] L19-6-->L19-7: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_6| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_6|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {3434#(and (<= 6 ~glob1~0) (<= ~glob1~0 6))} is VALID [2022-02-20 20:40:32,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {3434#(and (<= 6 ~glob1~0) (<= ~glob1~0 6))} [122] L19-7-->L19-11: Formula: (not (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_8| 0)) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_8|} AuxVars[] AssignedVars[] {3434#(and (<= 6 ~glob1~0) (<= ~glob1~0 6))} is VALID [2022-02-20 20:40:32,885 INFO L290 TraceCheckUtils]: 43: Hoare triple {3434#(and (<= 6 ~glob1~0) (<= ~glob1~0 6))} [150] L19-11-->L704: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3434#(and (<= 6 ~glob1~0) (<= ~glob1~0 6))} is VALID [2022-02-20 20:40:32,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {3434#(and (<= 6 ~glob1~0) (<= ~glob1~0 6))} [197] L704-->L704-1: Formula: (= |v_ULTIMATE.start_main_#t~post6#1_2| v_~glob1~0_6) InVars {~glob1~0=v_~glob1~0_6} OutVars{ULTIMATE.start_main_#t~post6#1=|v_ULTIMATE.start_main_#t~post6#1_2|, ~glob1~0=v_~glob1~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6#1] {3435#(and (<= |ULTIMATE.start_main_#t~post6#1| 6) (<= 6 |ULTIMATE.start_main_#t~post6#1|))} is VALID [2022-02-20 20:40:32,886 INFO L290 TraceCheckUtils]: 45: Hoare triple {3435#(and (<= |ULTIMATE.start_main_#t~post6#1| 6) (<= 6 |ULTIMATE.start_main_#t~post6#1|))} [210] L704-1-->L704-2: Formula: (= (+ (- 1) |v_ULTIMATE.start_main_#t~post6#1_3|) v_~glob1~0_7) InVars {ULTIMATE.start_main_#t~post6#1=|v_ULTIMATE.start_main_#t~post6#1_3|} OutVars{ULTIMATE.start_main_#t~post6#1=|v_ULTIMATE.start_main_#t~post6#1_3|, ~glob1~0=v_~glob1~0_7} AuxVars[] AssignedVars[~glob1~0] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,886 INFO L290 TraceCheckUtils]: 46: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [182] L704-2-->L705: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post6#1=|v_ULTIMATE.start_main_#t~post6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6#1] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,886 INFO L290 TraceCheckUtils]: 47: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [167] L705-->L706: Formula: (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#lock1~0.base_8| (store (select |v_#pthreadsMutex_4| |v_~#lock1~0.base_8|) |v_~#lock1~0.offset_8| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#lock1~0.offset=|v_~#lock1~0.offset_8|, ~#lock1~0.base=|v_~#lock1~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#lock1~0.offset=|v_~#lock1~0.offset_8|, ~#lock1~0.base=|v_~#lock1~0.base_8|} AuxVars[] AssignedVars[#pthreadsMutex] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,887 INFO L290 TraceCheckUtils]: 48: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [212] t_funENTRY-->L687: Formula: (and (= |v_t_funThread1of1ForFork0_~arg#1.offset_1| |v_t_funThread1of1ForFork0_#in~arg#1.offset_1|) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_1| |v_t_funThread1of1ForFork0_~arg#1.base_1|)) InVars {t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,887 INFO L290 TraceCheckUtils]: 49: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [213] L687-->L688: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~t~0#1] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,888 INFO L290 TraceCheckUtils]: 50: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [214] L688-->L688-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#lock1~0.base_9|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet1#1_1| 0) (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#lock1~0.base_9| (store .cse0 |v_~#lock1~0.offset_9| 1))) (= (select .cse0 |v_~#lock1~0.offset_9|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#lock1~0.offset=|v_~#lock1~0.offset_9|, ~#lock1~0.base=|v_~#lock1~0.base_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_1|, ~#lock1~0.offset=|v_~#lock1~0.offset_9|, ~#lock1~0.base=|v_~#lock1~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1#1] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,888 INFO L290 TraceCheckUtils]: 51: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [215] L688-1-->L689: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1#1] {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} is VALID [2022-02-20 20:40:32,888 INFO L290 TraceCheckUtils]: 52: Hoare triple {3432#(and (<= 5 ~glob1~0) (<= ~glob1~0 5))} [216] L689-->L690: Formula: (= v_~glob1~0_8 |v_t_funThread1of1ForFork0_~t~0#1_3|) InVars {~glob1~0=v_~glob1~0_8} OutVars{t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_3|, ~glob1~0=v_~glob1~0_8} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~t~0#1] {3436#(and (< 4 |t_funThread1of1ForFork0_~t~0#1|) (<= |t_funThread1of1ForFork0_~t~0#1| 5))} is VALID [2022-02-20 20:40:32,889 INFO L290 TraceCheckUtils]: 53: Hoare triple {3436#(and (< 4 |t_funThread1of1ForFork0_~t~0#1|) (<= |t_funThread1of1ForFork0_~t~0#1| 5))} [217] L690-->L690-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3436#(and (< 4 |t_funThread1of1ForFork0_~t~0#1|) (<= |t_funThread1of1ForFork0_~t~0#1| 5))} is VALID [2022-02-20 20:40:32,889 INFO L290 TraceCheckUtils]: 54: Hoare triple {3436#(and (< 4 |t_funThread1of1ForFork0_~t~0#1|) (<= |t_funThread1of1ForFork0_~t~0#1| 5))} [218] L690-1-->L690-2: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1| (ite (= 5 |v_t_funThread1of1ForFork0_~t~0#1_5|) 1 0)) InVars {t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_5|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1|, t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_5|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1] {3437#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:32,889 INFO L290 TraceCheckUtils]: 55: Hoare triple {3437#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} [219] L690-2-->L19: Formula: true InVars {} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {3437#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:32,890 INFO L290 TraceCheckUtils]: 56: Hoare triple {3437#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} [220] L19-->L19-1: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3| |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_3|) InVars {t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {3438#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:32,890 INFO L290 TraceCheckUtils]: 57: Hoare triple {3438#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))} [221] L19-1-->L19-2: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5| 0) InVars {t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[] {3431#false} is VALID [2022-02-20 20:40:32,890 INFO L290 TraceCheckUtils]: 58: Hoare triple {3431#false} [223] L19-2-->t_funErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3431#false} is VALID [2022-02-20 20:40:32,891 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:40:32,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:32,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501496343] [2022-02-20 20:40:32,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501496343] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:32,891 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:32,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:40:32,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289582846] [2022-02-20 20:40:32,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:32,892 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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 59 [2022-02-20 20:40:32,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:32,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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:40:32,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:32,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:40:32,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:32,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:40:32,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:40:32,927 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 96 [2022-02-20 20:40:32,928 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 84 transitions, 271 flow. Second operand has 9 states, 9 states have (on average 63.888888888888886) internal successors, (575), 9 states have internal predecessors, (575), 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:40:32,928 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:32,928 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 96 [2022-02-20 20:40:32,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:33,248 INFO L129 PetriNetUnfolder]: 7/108 cut-off events. [2022-02-20 20:40:33,248 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-02-20 20:40:33,249 INFO L84 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 108 events. 7/108 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 127 event pairs, 1 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 177. Up to 8 conditions per place. [2022-02-20 20:40:33,249 INFO L132 encePairwiseOnDemand]: 80/96 looper letters, 8 selfloop transitions, 12 changer transitions 21/87 dead transitions. [2022-02-20 20:40:33,249 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 87 transitions, 345 flow [2022-02-20 20:40:33,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 20:40:33,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-02-20 20:40:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1149 transitions. [2022-02-20 20:40:33,262 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6649305555555556 [2022-02-20 20:40:33,262 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1149 transitions. [2022-02-20 20:40:33,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1149 transitions. [2022-02-20 20:40:33,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:33,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1149 transitions. [2022-02-20 20:40:33,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 63.833333333333336) internal successors, (1149), 18 states have internal predecessors, (1149), 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:40:33,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 96.0) internal successors, (1824), 19 states have internal predecessors, (1824), 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:40:33,268 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 96.0) internal successors, (1824), 19 states have internal predecessors, (1824), 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:40:33,268 INFO L186 Difference]: Start difference. First operand has 111 places, 84 transitions, 271 flow. Second operand 18 states and 1149 transitions. [2022-02-20 20:40:33,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 87 transitions, 345 flow