./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_44-traces-mine2_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_44-traces-mine2_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 abd7c6a811fa727af1a8295486441ec66634091da13d54772e1efa33885ef21c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:40:51,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:40:51,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:40:51,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:40:51,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:40:51,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:40:51,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:40:51,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:40:51,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:40:51,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:40:51,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:40:51,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:40:51,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:40:51,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:40:51,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:40:51,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:40:51,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:40:51,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:40:51,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:40:51,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:40:51,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:40:51,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:40:51,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:40:51,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:40:51,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:40:51,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:40:51,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:40:51,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:40:51,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:40:51,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:40:51,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:40:51,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:40:51,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:40:51,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:40:51,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:40:51,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:40:51,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:40:51,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:40:51,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:40:51,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:40:51,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:40:51,264 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:51,276 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:40:51,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:40:51,277 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:40:51,277 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:40:51,278 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:40:51,278 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:40:51,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:40:51,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:40:51,279 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:40:51,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:40:51,279 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:40:51,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:40:51,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:40:51,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:40:51,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:40:51,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:40:51,280 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:40:51,280 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:40:51,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:40:51,281 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:40:51,281 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:40:51,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:40:51,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:40:51,282 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:40:51,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:51,282 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:40:51,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:40:51,282 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:40:51,282 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:40:51,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:40:51,283 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:40:51,283 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:40:51,283 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:40:51,283 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 -> abd7c6a811fa727af1a8295486441ec66634091da13d54772e1efa33885ef21c [2022-02-20 20:40:51,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:40:51,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:40:51,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:40:51,487 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:40:51,488 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:40:51,488 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_44-traces-mine2_true.i [2022-02-20 20:40:51,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de9b89f5/b4bc1a32adab4867988295bb0e0255ea/FLAG8e2b78f5e [2022-02-20 20:40:51,959 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:40:51,959 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_44-traces-mine2_true.i [2022-02-20 20:40:51,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de9b89f5/b4bc1a32adab4867988295bb0e0255ea/FLAG8e2b78f5e [2022-02-20 20:40:52,323 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de9b89f5/b4bc1a32adab4867988295bb0e0255ea [2022-02-20 20:40:52,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:40:52,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:40:52,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:52,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:40:52,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:40:52,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:52" (1/1) ... [2022-02-20 20:40:52,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@257aa9a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:52, skipping insertion in model container [2022-02-20 20:40:52,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:52" (1/1) ... [2022-02-20 20:40:52,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:40:52,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:40:52,495 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_44-traces-mine2_true.i[1089,1102] [2022-02-20 20:40:52,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:52,610 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:40:52,620 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_44-traces-mine2_true.i[1089,1102] [2022-02-20 20:40:52,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:52,662 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:40:52,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:52 WrapperNode [2022-02-20 20:40:52,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:52,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:52,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:40:52,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:40:52,671 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:52" (1/1) ... [2022-02-20 20:40:52,679 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:52" (1/1) ... [2022-02-20 20:40:52,692 INFO L137 Inliner]: procedures = 162, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2022-02-20 20:40:52,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:52,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:40:52,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:40:52,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:40:52,698 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:52" (1/1) ... [2022-02-20 20:40:52,698 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:52" (1/1) ... [2022-02-20 20:40:52,700 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:52" (1/1) ... [2022-02-20 20:40:52,700 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:52" (1/1) ... [2022-02-20 20:40:52,704 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:52" (1/1) ... [2022-02-20 20:40:52,706 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:52" (1/1) ... [2022-02-20 20:40:52,706 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:52" (1/1) ... [2022-02-20 20:40:52,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:40:52,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:40:52,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:40:52,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:40:52,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:52" (1/1) ... [2022-02-20 20:40:52,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:52,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:40:52,730 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:52,751 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:52,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:40:52,758 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:40:52,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:40:52,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:40:52,758 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-20 20:40:52,758 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-20 20:40:52,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:40:52,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:40:52,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:40:52,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:40:52,760 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:52,896 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:40:52,897 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:40:53,061 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:40:53,066 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:40:53,066 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:40:53,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:53 BoogieIcfgContainer [2022-02-20 20:40:53,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:40:53,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:40:53,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:40:53,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:40:53,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:40:52" (1/3) ... [2022-02-20 20:40:53,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ff5df9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:53, skipping insertion in model container [2022-02-20 20:40:53,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:52" (2/3) ... [2022-02-20 20:40:53,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ff5df9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:53, skipping insertion in model container [2022-02-20 20:40:53,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:53" (3/3) ... [2022-02-20 20:40:53,076 INFO L111 eAbstractionObserver]: Analyzing ICFG 13-privatized_44-traces-mine2_true.i [2022-02-20 20:40:53,079 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:40:53,079 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:40:53,086 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:40:53,086 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:40:53,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,133 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,133 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,134 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,134 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,135 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,135 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,136 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,136 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,136 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,138 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,138 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,140 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,140 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,140 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,140 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,144 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,145 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:53,148 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:40:53,193 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:40:53,200 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:53,200 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 20:40:53,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 77 transitions, 159 flow [2022-02-20 20:40:53,248 INFO L129 PetriNetUnfolder]: 2/76 cut-off events. [2022-02-20 20:40:53,248 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:53,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2022-02-20 20:40:53,251 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 77 transitions, 159 flow [2022-02-20 20:40:53,255 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 66 transitions, 135 flow [2022-02-20 20:40:53,277 INFO L129 PetriNetUnfolder]: 1/54 cut-off events. [2022-02-20 20:40:53,278 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:53,279 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:53,279 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:53,282 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:53,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:53,286 INFO L85 PathProgramCache]: Analyzing trace with hash 47225093, now seen corresponding path program 1 times [2022-02-20 20:40:53,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:53,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537470421] [2022-02-20 20:40:53,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:53,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:53,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {82#true} [143] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {82#true} is VALID [2022-02-20 20:40:53,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {82#true} [128] 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] {82#true} is VALID [2022-02-20 20:40:53,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {82#true} [150] 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[] {82#true} is VALID [2022-02-20 20:40:53,588 INFO L290 TraceCheckUtils]: 3: Hoare triple {82#true} [154] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {82#true} is VALID [2022-02-20 20:40:53,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {82#true} [110] 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[] {82#true} is VALID [2022-02-20 20:40:53,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {82#true} [144] 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[] {82#true} is VALID [2022-02-20 20:40:53,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {82#true} [133] 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[] {82#true} is VALID [2022-02-20 20:40:53,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {82#true} [136] L18-3-->L18-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 37)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {82#true} is VALID [2022-02-20 20:40:53,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {82#true} [137] L18-4-->L682: Formula: (= 3 v_~g~0_1) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {84#(= 3 ~g~0)} [90] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {84#(= 3 ~g~0)} [111] L682-1-->L682-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[] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {84#(= 3 ~g~0)} [97] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {84#(= 3 ~g~0)} [152] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {84#(= 3 ~g~0)} [122] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {84#(= 3 ~g~0)} [159] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {84#(= 3 ~g~0)} [103] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {84#(= 3 ~g~0)} [146] L682-7-->L683: Formula: (and (= 4 |v_~#B~0.base_1|) (= |v_~#B~0.offset_1| 0)) InVars {} OutVars{~#B~0.base=|v_~#B~0.base_1|, ~#B~0.offset=|v_~#B~0.offset_1|} AuxVars[] AssignedVars[~#B~0.base, ~#B~0.offset] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {84#(= 3 ~g~0)} [98] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {84#(= 3 ~g~0)} [142] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#B~0.base_2|) |v_~#B~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} AuxVars[] AssignedVars[] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {84#(= 3 ~g~0)} [126] L683-2-->L683-3: Formula: (= 0 (select (select |v_#memory_int_9| |v_~#B~0.base_3|) (+ |v_~#B~0.offset_3| 4))) InVars {#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} AuxVars[] AssignedVars[] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {84#(= 3 ~g~0)} [147] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#B~0.base_4|) (+ |v_~#B~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} AuxVars[] AssignedVars[] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {84#(= 3 ~g~0)} [89] L683-4-->L683-5: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_11| |v_~#B~0.base_5|) (+ |v_~#B~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} AuxVars[] AssignedVars[] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,602 INFO L290 TraceCheckUtils]: 22: Hoare triple {84#(= 3 ~g~0)} [148] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#B~0.base_6|) (+ |v_~#B~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} AuxVars[] AssignedVars[] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {84#(= 3 ~g~0)} [123] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {84#(= 3 ~g~0)} [158] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {84#(= 3 ~g~0)} [135] 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] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {84#(= 3 ~g~0)} [101] L-1-5-->L695: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre3#1] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,608 INFO L290 TraceCheckUtils]: 27: Hoare triple {84#(= 3 ~g~0)} [156] L695-->L695-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, 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_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {84#(= 3 ~g~0)} [127] L695-1-->L696: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {84#(= 3 ~g~0)} [138] L696-->L696-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {84#(= 3 ~g~0)} [124] L696-1-->L696-2: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre3#1_3|))) InVars {#memory_int=|v_#memory_int_14|, 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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{#memory_int=|v_#memory_int_13|, 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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {84#(= 3 ~g~0)} [177] L696-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {84#(= 3 ~g~0)} [160] L696-3-->L696-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {84#(= 3 ~g~0)} [139] L696-4-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {84#(= 3 ~g~0)} [118] L697-->L697-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#A~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet5#1_2| 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))) (= (select .cse0 |v_~#A~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet5#1] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {84#(= 3 ~g~0)} [102] L697-1-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {84#(= 3 ~g~0)} [116] L698-->L698-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {84#(= 3 ~g~0)} is VALID [2022-02-20 20:40:53,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {84#(= 3 ~g~0)} [115] L698-1-->L698-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 3 v_~g~0_2) 1 0)) InVars {~g~0=v_~g~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {85#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:53,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {85#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [141] L698-2-->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] {85#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:53,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {85#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [117] 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] {86#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:53,617 INFO L290 TraceCheckUtils]: 40: Hoare triple {86#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [106] 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[] {83#false} is VALID [2022-02-20 20:40:53,618 INFO L290 TraceCheckUtils]: 41: Hoare triple {83#false} [120] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#false} is VALID [2022-02-20 20:40:53,620 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:53,620 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:53,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537470421] [2022-02-20 20:40:53,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537470421] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:53,621 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:53,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:40:53,626 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106621071] [2022-02-20 20:40:53,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:53,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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:53,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:53,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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:53,682 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:53,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:40:53,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:53,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:40:53,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:40:53,705 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 77 [2022-02-20 20:40:53,709 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 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:53,710 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:53,710 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 77 [2022-02-20 20:40:53,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:53,887 INFO L129 PetriNetUnfolder]: 36/208 cut-off events. [2022-02-20 20:40:53,887 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:53,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 208 events. 36/208 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 810 event pairs, 7 based on Foata normal form. 7/212 useless extension candidates. Maximal degree in co-relation 270. Up to 24 conditions per place. [2022-02-20 20:40:53,890 INFO L132 encePairwiseOnDemand]: 65/77 looper letters, 21 selfloop transitions, 13 changer transitions 9/93 dead transitions. [2022-02-20 20:40:53,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 93 transitions, 275 flow [2022-02-20 20:40:53,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:40:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:40:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 571 transitions. [2022-02-20 20:40:53,908 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.823953823953824 [2022-02-20 20:40:53,909 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 571 transitions. [2022-02-20 20:40:53,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 571 transitions. [2022-02-20 20:40:53,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:53,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 571 transitions. [2022-02-20 20:40:53,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 63.44444444444444) internal successors, (571), 9 states have internal predecessors, (571), 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:53,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 77.0) internal successors, (770), 10 states have internal predecessors, (770), 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:53,922 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 77.0) internal successors, (770), 10 states have internal predecessors, (770), 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:53,923 INFO L186 Difference]: Start difference. First operand has 69 places, 66 transitions, 135 flow. Second operand 9 states and 571 transitions. [2022-02-20 20:40:53,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 93 transitions, 275 flow [2022-02-20 20:40:53,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 93 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:40:53,930 INFO L242 Difference]: Finished difference. Result has 82 places, 73 transitions, 222 flow [2022-02-20 20:40:53,931 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=222, PETRI_PLACES=82, PETRI_TRANSITIONS=73} [2022-02-20 20:40:53,933 INFO L334 CegarLoopForPetriNet]: 69 programPoint places, 13 predicate places. [2022-02-20 20:40:53,934 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 73 transitions, 222 flow [2022-02-20 20:40:53,959 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 362 states, 357 states have (on average 1.7450980392156863) internal successors, (623), 361 states have internal predecessors, (623), 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:53,961 INFO L78 Accepts]: Start accepts. Automaton has has 362 states, 357 states have (on average 1.7450980392156863) internal successors, (623), 361 states have internal predecessors, (623), 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:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:53,961 INFO L470 AbstractCegarLoop]: Abstraction has has 82 places, 73 transitions, 222 flow [2022-02-20 20:40:53,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 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:53,961 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:53,961 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] [2022-02-20 20:40:53,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:40:53,962 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:53,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:53,962 INFO L85 PathProgramCache]: Analyzing trace with hash 212203783, now seen corresponding path program 1 times [2022-02-20 20:40:53,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:53,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161169426] [2022-02-20 20:40:53,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:53,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:54,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {466#true} [143] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#true} is VALID [2022-02-20 20:40:54,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} [128] 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] {466#true} is VALID [2022-02-20 20:40:54,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} [150] 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[] {466#true} is VALID [2022-02-20 20:40:54,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {466#true} [154] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {466#true} is VALID [2022-02-20 20:40:54,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {466#true} [110] 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[] {466#true} is VALID [2022-02-20 20:40:54,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {466#true} [144] 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[] {466#true} is VALID [2022-02-20 20:40:54,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {466#true} [133] 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[] {466#true} is VALID [2022-02-20 20:40:54,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {466#true} [136] L18-3-->L18-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 37)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {466#true} is VALID [2022-02-20 20:40:54,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {466#true} [137] L18-4-->L682: Formula: (= 3 v_~g~0_1) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {466#true} is VALID [2022-02-20 20:40:54,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {466#true} [90] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {466#true} is VALID [2022-02-20 20:40:54,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {466#true} [111] L682-1-->L682-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[] {466#true} is VALID [2022-02-20 20:40:54,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {466#true} [97] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {466#true} is VALID [2022-02-20 20:40:54,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {466#true} [152] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {466#true} is VALID [2022-02-20 20:40:54,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {466#true} [122] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {466#true} is VALID [2022-02-20 20:40:54,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {466#true} [159] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {466#true} is VALID [2022-02-20 20:40:54,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {466#true} [103] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {466#true} is VALID [2022-02-20 20:40:54,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {466#true} [146] L682-7-->L683: Formula: (and (= 4 |v_~#B~0.base_1|) (= |v_~#B~0.offset_1| 0)) InVars {} OutVars{~#B~0.base=|v_~#B~0.base_1|, ~#B~0.offset=|v_~#B~0.offset_1|} AuxVars[] AssignedVars[~#B~0.base, ~#B~0.offset] {466#true} is VALID [2022-02-20 20:40:54,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {466#true} [98] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {466#true} is VALID [2022-02-20 20:40:54,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {466#true} [142] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#B~0.base_2|) |v_~#B~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} AuxVars[] AssignedVars[] {466#true} is VALID [2022-02-20 20:40:54,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {466#true} [126] L683-2-->L683-3: Formula: (= 0 (select (select |v_#memory_int_9| |v_~#B~0.base_3|) (+ |v_~#B~0.offset_3| 4))) InVars {#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} AuxVars[] AssignedVars[] {466#true} is VALID [2022-02-20 20:40:54,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {466#true} [147] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#B~0.base_4|) (+ |v_~#B~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} AuxVars[] AssignedVars[] {466#true} is VALID [2022-02-20 20:40:54,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {466#true} [89] L683-4-->L683-5: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_11| |v_~#B~0.base_5|) (+ |v_~#B~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} AuxVars[] AssignedVars[] {466#true} is VALID [2022-02-20 20:40:54,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {466#true} [148] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#B~0.base_6|) (+ |v_~#B~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} AuxVars[] AssignedVars[] {466#true} is VALID [2022-02-20 20:40:54,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {466#true} [123] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#true} is VALID [2022-02-20 20:40:54,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {466#true} [158] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#true} is VALID [2022-02-20 20:40:54,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {466#true} [135] 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] {466#true} is VALID [2022-02-20 20:40:54,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {466#true} [101] L-1-5-->L695: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre3#1] {466#true} is VALID [2022-02-20 20:40:54,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {466#true} [156] L695-->L695-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, 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_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {466#true} is VALID [2022-02-20 20:40:54,037 INFO L290 TraceCheckUtils]: 28: Hoare triple {466#true} [127] L695-1-->L696: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {466#true} is VALID [2022-02-20 20:40:54,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {466#true} [138] L696-->L696-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {466#true} is VALID [2022-02-20 20:40:54,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {466#true} [124] L696-1-->L696-2: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre3#1_3|))) InVars {#memory_int=|v_#memory_int_14|, 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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{#memory_int=|v_#memory_int_13|, 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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int] {466#true} is VALID [2022-02-20 20:40:54,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {466#true} [177] L696-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {466#true} is VALID [2022-02-20 20:40:54,038 INFO L290 TraceCheckUtils]: 32: Hoare triple {466#true} [164] t_funENTRY-->L685: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_1| v_t_funThread1of1ForFork0_~arg.base_1) (= v_t_funThread1of1ForFork0_~arg.offset_1 |v_t_funThread1of1ForFork0_#in~arg.offset_1|)) InVars {t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|} OutVars{t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_1, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_1} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_~arg.base] {466#true} is VALID [2022-02-20 20:40:54,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {466#true} [165] L685-->L685-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#A~0.base_9|))) (and (= (select .cse0 |v_~#A~0.offset_9|) 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#A~0.base_9| (store .cse0 |v_~#A~0.offset_9| 1))) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|, #pthreadsMutex=|v_#pthreadsMutex_11|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {468#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:40:54,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {468#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [166] L685-1-->L686: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {468#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:40:54,040 INFO L290 TraceCheckUtils]: 35: Hoare triple {468#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [167] L686-->L687: Formula: (= v_~g~0_6 1) InVars {} OutVars{~g~0=v_~g~0_6} AuxVars[] AssignedVars[~g~0] {468#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:40:54,040 INFO L290 TraceCheckUtils]: 36: Hoare triple {468#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [160] L696-3-->L696-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {468#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:40:54,041 INFO L290 TraceCheckUtils]: 37: Hoare triple {468#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [139] L696-4-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {468#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:40:54,041 INFO L290 TraceCheckUtils]: 38: Hoare triple {468#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [118] L697-->L697-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#A~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet5#1_2| 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))) (= (select .cse0 |v_~#A~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet5#1] {467#false} is VALID [2022-02-20 20:40:54,041 INFO L290 TraceCheckUtils]: 39: Hoare triple {467#false} [102] L697-1-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {467#false} is VALID [2022-02-20 20:40:54,042 INFO L290 TraceCheckUtils]: 40: Hoare triple {467#false} [116] L698-->L698-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {467#false} is VALID [2022-02-20 20:40:54,042 INFO L290 TraceCheckUtils]: 41: Hoare triple {467#false} [115] L698-1-->L698-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 3 v_~g~0_2) 1 0)) InVars {~g~0=v_~g~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {467#false} is VALID [2022-02-20 20:40:54,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {467#false} [141] L698-2-->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] {467#false} is VALID [2022-02-20 20:40:54,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {467#false} [117] 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] {467#false} is VALID [2022-02-20 20:40:54,043 INFO L290 TraceCheckUtils]: 44: Hoare triple {467#false} [106] 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[] {467#false} is VALID [2022-02-20 20:40:54,043 INFO L290 TraceCheckUtils]: 45: Hoare triple {467#false} [120] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {467#false} is VALID [2022-02-20 20:40:54,043 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:54,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:54,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161169426] [2022-02-20 20:40:54,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161169426] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:54,044 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:54,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:40:54,045 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064942083] [2022-02-20 20:40:54,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:54,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 46 [2022-02-20 20:40:54,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:54,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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:54,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:54,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:40:54,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:54,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:40:54,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:40:54,082 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 77 [2022-02-20 20:40:54,083 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 73 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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:54,083 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:54,083 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 77 [2022-02-20 20:40:54,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:54,120 INFO L129 PetriNetUnfolder]: 3/125 cut-off events. [2022-02-20 20:40:54,120 INFO L130 PetriNetUnfolder]: For 26/27 co-relation queries the response was YES. [2022-02-20 20:40:54,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 125 events. 3/125 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 276 event pairs, 0 based on Foata normal form. 5/130 useless extension candidates. Maximal degree in co-relation 165. Up to 19 conditions per place. [2022-02-20 20:40:54,121 INFO L132 encePairwiseOnDemand]: 73/77 looper letters, 9 selfloop transitions, 4 changer transitions 5/71 dead transitions. [2022-02-20 20:40:54,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 71 transitions, 233 flow [2022-02-20 20:40:54,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:40:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:40:54,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2022-02-20 20:40:54,123 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8528138528138528 [2022-02-20 20:40:54,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 197 transitions. [2022-02-20 20:40:54,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 197 transitions. [2022-02-20 20:40:54,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:54,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 197 transitions. [2022-02-20 20:40:54,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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:54,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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:54,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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:54,125 INFO L186 Difference]: Start difference. First operand has 82 places, 73 transitions, 222 flow. Second operand 3 states and 197 transitions. [2022-02-20 20:40:54,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 71 transitions, 233 flow [2022-02-20 20:40:54,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 71 transitions, 219 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-02-20 20:40:54,242 INFO L242 Difference]: Finished difference. Result has 80 places, 66 transitions, 175 flow [2022-02-20 20:40:54,242 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2022-02-20 20:40:54,242 INFO L334 CegarLoopForPetriNet]: 69 programPoint places, 11 predicate places. [2022-02-20 20:40:54,242 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 66 transitions, 175 flow [2022-02-20 20:40:54,246 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 158 states, 153 states have (on average 1.5359477124183007) internal successors, (235), 157 states have internal predecessors, (235), 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:54,247 INFO L78 Accepts]: Start accepts. Automaton has has 158 states, 153 states have (on average 1.5359477124183007) internal successors, (235), 157 states have internal predecessors, (235), 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 46 [2022-02-20 20:40:54,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:54,247 INFO L470 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 175 flow [2022-02-20 20:40:54,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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:54,247 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:54,248 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] [2022-02-20 20:40:54,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:40:54,248 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:54,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:54,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1612742903, now seen corresponding path program 1 times [2022-02-20 20:40:54,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:54,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083362293] [2022-02-20 20:40:54,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:54,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:54,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {629#true} [143] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {629#true} is VALID [2022-02-20 20:40:54,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {629#true} [128] 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] {629#true} is VALID [2022-02-20 20:40:54,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {629#true} [150] 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[] {629#true} is VALID [2022-02-20 20:40:54,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {629#true} [154] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {629#true} is VALID [2022-02-20 20:40:54,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {629#true} [110] 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[] {629#true} is VALID [2022-02-20 20:40:54,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {629#true} [144] 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[] {629#true} is VALID [2022-02-20 20:40:54,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {629#true} [133] 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[] {629#true} is VALID [2022-02-20 20:40:54,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {629#true} [136] L18-3-->L18-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 37)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {629#true} is VALID [2022-02-20 20:40:54,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {629#true} [137] L18-4-->L682: Formula: (= 3 v_~g~0_1) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {629#true} is VALID [2022-02-20 20:40:54,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {629#true} [90] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {631#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:54,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {631#(<= |~#A~0.base| 3)} [111] L682-1-->L682-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[] {631#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:54,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {631#(<= |~#A~0.base| 3)} [97] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {631#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:54,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {631#(<= |~#A~0.base| 3)} [152] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {631#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:54,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {631#(<= |~#A~0.base| 3)} [122] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {631#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:54,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {631#(<= |~#A~0.base| 3)} [159] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {631#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:54,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {631#(<= |~#A~0.base| 3)} [103] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {631#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:54,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {631#(<= |~#A~0.base| 3)} [146] L682-7-->L683: Formula: (and (= 4 |v_~#B~0.base_1|) (= |v_~#B~0.offset_1| 0)) InVars {} OutVars{~#B~0.base=|v_~#B~0.base_1|, ~#B~0.offset=|v_~#B~0.offset_1|} AuxVars[] AssignedVars[~#B~0.base, ~#B~0.offset] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [98] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [142] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#B~0.base_2|) |v_~#B~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} AuxVars[] AssignedVars[] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [126] L683-2-->L683-3: Formula: (= 0 (select (select |v_#memory_int_9| |v_~#B~0.base_3|) (+ |v_~#B~0.offset_3| 4))) InVars {#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} AuxVars[] AssignedVars[] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [147] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#B~0.base_4|) (+ |v_~#B~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} AuxVars[] AssignedVars[] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [89] L683-4-->L683-5: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_11| |v_~#B~0.base_5|) (+ |v_~#B~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} AuxVars[] AssignedVars[] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [148] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#B~0.base_6|) (+ |v_~#B~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} AuxVars[] AssignedVars[] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [123] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [158] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [135] 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] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [101] L-1-5-->L695: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre3#1] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [156] L695-->L695-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, 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_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [127] L695-1-->L696: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [138] L696-->L696-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [124] L696-1-->L696-2: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre3#1_3|))) InVars {#memory_int=|v_#memory_int_14|, 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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{#memory_int=|v_#memory_int_13|, 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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [177] L696-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [160] L696-3-->L696-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [139] L696-4-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [164] t_funENTRY-->L685: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_1| v_t_funThread1of1ForFork0_~arg.base_1) (= v_t_funThread1of1ForFork0_~arg.offset_1 |v_t_funThread1of1ForFork0_#in~arg.offset_1|)) InVars {t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|} OutVars{t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_1, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_1} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_~arg.base] {632#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:54,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {632#(not (= |~#B~0.base| |~#A~0.base|))} [165] L685-->L685-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#A~0.base_9|))) (and (= (select .cse0 |v_~#A~0.offset_9|) 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#A~0.base_9| (store .cse0 |v_~#A~0.offset_9| 1))) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|, #pthreadsMutex=|v_#pthreadsMutex_11|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {633#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:54,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {633#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [166] L685-1-->L686: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {633#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:54,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {633#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [167] L686-->L687: Formula: (= v_~g~0_6 1) InVars {} OutVars{~g~0=v_~g~0_6} AuxVars[] AssignedVars[~g~0] {633#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:54,370 INFO L290 TraceCheckUtils]: 38: Hoare triple {633#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [168] L687-->L687-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#B~0.base_8|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet2_1| 0) (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#B~0.base_8| (store .cse0 |v_~#B~0.offset_8| 1))) (= (select .cse0 |v_~#B~0.offset_8|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#B~0.base=|v_~#B~0.base_8|, ~#B~0.offset=|v_~#B~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#B~0.base=|v_~#B~0.base_8|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_1|, ~#B~0.offset=|v_~#B~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2] {633#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:54,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {633#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [169] L687-1-->L688: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2] {633#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:54,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {633#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [170] L688-->L689: Formula: (= 2 v_~g~0_4) InVars {} OutVars{~g~0=v_~g~0_4} AuxVars[] AssignedVars[~g~0] {633#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:54,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {633#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [171] L689-->L690: Formula: (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#B~0.base_9| (store (select |v_#pthreadsMutex_8| |v_~#B~0.base_9|) |v_~#B~0.offset_9| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex] {634#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:40:54,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {634#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [118] L697-->L697-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#A~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet5#1_2| 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))) (= (select .cse0 |v_~#A~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet5#1] {630#false} is VALID [2022-02-20 20:40:54,372 INFO L290 TraceCheckUtils]: 43: Hoare triple {630#false} [102] L697-1-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {630#false} is VALID [2022-02-20 20:40:54,372 INFO L290 TraceCheckUtils]: 44: Hoare triple {630#false} [116] L698-->L698-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {630#false} is VALID [2022-02-20 20:40:54,372 INFO L290 TraceCheckUtils]: 45: Hoare triple {630#false} [115] L698-1-->L698-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 3 v_~g~0_2) 1 0)) InVars {~g~0=v_~g~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {630#false} is VALID [2022-02-20 20:40:54,372 INFO L290 TraceCheckUtils]: 46: Hoare triple {630#false} [141] L698-2-->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] {630#false} is VALID [2022-02-20 20:40:54,373 INFO L290 TraceCheckUtils]: 47: Hoare triple {630#false} [117] 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] {630#false} is VALID [2022-02-20 20:40:54,373 INFO L290 TraceCheckUtils]: 48: Hoare triple {630#false} [106] 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[] {630#false} is VALID [2022-02-20 20:40:54,373 INFO L290 TraceCheckUtils]: 49: Hoare triple {630#false} [120] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {630#false} is VALID [2022-02-20 20:40:54,373 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:54,374 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:54,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083362293] [2022-02-20 20:40:54,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083362293] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:54,374 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:54,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:40:54,374 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137629856] [2022-02-20 20:40:54,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:54,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 50 [2022-02-20 20:40:54,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:54,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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:54,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:54,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:40:54,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:54,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:40:54,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:40:54,406 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 77 [2022-02-20 20:40:54,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 66 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 56.833333333333336) internal successors, (341), 6 states have internal predecessors, (341), 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:54,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:54,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 77 [2022-02-20 20:40:54,407 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:54,473 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2022-02-20 20:40:54,474 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-02-20 20:40:54,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 46 events. 0/46 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2022-02-20 20:40:54,474 INFO L132 encePairwiseOnDemand]: 73/77 looper letters, 0 selfloop transitions, 0 changer transitions 46/46 dead transitions. [2022-02-20 20:40:54,474 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 46 transitions, 146 flow [2022-02-20 20:40:54,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:40:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:40:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 288 transitions. [2022-02-20 20:40:54,477 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7480519480519481 [2022-02-20 20:40:54,477 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 288 transitions. [2022-02-20 20:40:54,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 288 transitions. [2022-02-20 20:40:54,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:54,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 288 transitions. [2022-02-20 20:40:54,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 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:54,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 77.0) internal successors, (462), 6 states have internal predecessors, (462), 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:54,480 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 77.0) internal successors, (462), 6 states have internal predecessors, (462), 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:54,480 INFO L186 Difference]: Start difference. First operand has 80 places, 66 transitions, 175 flow. Second operand 5 states and 288 transitions. [2022-02-20 20:40:54,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 46 transitions, 146 flow [2022-02-20 20:40:54,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 46 transitions, 131 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-02-20 20:40:54,485 INFO L242 Difference]: Finished difference. Result has 57 places, 0 transitions, 0 flow [2022-02-20 20:40:54,485 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=57, PETRI_TRANSITIONS=0} [2022-02-20 20:40:54,486 INFO L334 CegarLoopForPetriNet]: 69 programPoint places, -12 predicate places. [2022-02-20 20:40:54,486 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 0 transitions, 0 flow [2022-02-20 20:40:54,486 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:54,486 INFO L78 Accepts]: Start accepts. Automaton has has 1 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 50 [2022-02-20 20:40:54,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:54,486 INFO L470 AbstractCegarLoop]: Abstraction has has 57 places, 0 transitions, 0 flow [2022-02-20 20:40:54,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.833333333333336) internal successors, (341), 6 states have internal predecessors, (341), 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:54,489 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-20 20:40:54,489 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-02-20 20:40:54,489 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 3 remaining) [2022-02-20 20:40:54,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:40:54,492 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 20:40:54,493 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:40:54,493 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:40:54,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:40:54 BasicIcfg [2022-02-20 20:40:54,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:40:54,496 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:40:54,496 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:40:54,496 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:40:54,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:53" (3/4) ... [2022-02-20 20:40:54,498 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 20:40:54,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2022-02-20 20:40:54,503 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 20:40:54,503 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 20:40:54,504 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 20:40:54,504 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 20:40:54,524 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:40:54,524 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:40:54,525 INFO L158 Benchmark]: Toolchain (without parser) took 2196.85ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 54.9MB in the beginning and 45.0MB in the end (delta: 9.9MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2022-02-20 20:40:54,525 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory was 60.7MB in the beginning and 60.6MB in the end (delta: 24.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:54,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.28ms. Allocated memory is still 90.2MB. Free memory was 54.8MB in the beginning and 56.0MB in the end (delta: -1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 20:40:54,526 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.18ms. Allocated memory is still 90.2MB. Free memory was 56.0MB in the beginning and 53.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:54,526 INFO L158 Benchmark]: Boogie Preprocessor took 14.67ms. Allocated memory is still 90.2MB. Free memory was 53.9MB in the beginning and 52.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:54,526 INFO L158 Benchmark]: RCFGBuilder took 359.21ms. Allocated memory is still 90.2MB. Free memory was 52.4MB in the beginning and 40.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 20:40:54,527 INFO L158 Benchmark]: TraceAbstraction took 1426.68ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 39.9MB in the beginning and 48.2MB in the end (delta: -8.3MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2022-02-20 20:40:54,527 INFO L158 Benchmark]: Witness Printer took 28.57ms. Allocated memory is still 115.3MB. Free memory was 48.2MB in the beginning and 45.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:54,528 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory was 60.7MB in the beginning and 60.6MB in the end (delta: 24.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.28ms. Allocated memory is still 90.2MB. Free memory was 54.8MB in the beginning and 56.0MB in the end (delta: -1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.18ms. Allocated memory is still 90.2MB. Free memory was 56.0MB in the beginning and 53.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.67ms. Allocated memory is still 90.2MB. Free memory was 53.9MB in the beginning and 52.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.21ms. Allocated memory is still 90.2MB. Free memory was 52.4MB in the beginning and 40.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1426.68ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 39.9MB in the beginning and 48.2MB in the end (delta: -8.3MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Witness Printer took 28.57ms. Allocated memory is still 115.3MB. Free memory was 48.2MB in the beginning and 45.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 90 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 28 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=1, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 375 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 20:40:54,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE