./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_47-refine-protected2_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_47-refine-protected2_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 f7e90d4b6ab0561c00fafe8b5db7dd972e67889e2cb8e9e72502cd51ce4f0a76 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:40:53,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:40:53,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:40:53,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:40:53,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:40:53,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:40:53,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:40:53,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:40:53,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:40:53,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:40:53,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:40:53,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:40:53,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:40:53,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:40:53,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:40:53,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:40:53,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:40:53,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:40:53,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:40:53,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:40:53,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:40:53,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:40:53,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:40:53,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:40:53,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:40:53,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:40:53,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:40:53,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:40:53,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:40:53,212 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:40:53,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:40:53,213 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:40:53,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:40:53,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:40:53,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:40:53,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:40:53,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:40:53,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:40:53,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:40:53,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:40:53,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:40:53,218 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:53,245 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:40:53,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:40:53,246 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:40:53,246 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:40:53,247 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:40:53,247 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:40:53,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:40:53,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:40:53,248 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:40:53,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:40:53,249 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:40:53,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:40:53,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:40:53,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:40:53,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:40:53,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:40:53,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:40:53,250 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:40:53,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:40:53,250 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:40:53,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:40:53,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:40:53,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:40:53,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:40:53,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:53,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:40:53,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:40:53,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:40:53,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:40:53,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:40:53,252 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:40:53,252 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:40:53,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:40:53,252 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 -> f7e90d4b6ab0561c00fafe8b5db7dd972e67889e2cb8e9e72502cd51ce4f0a76 [2022-02-20 20:40:53,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:40:53,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:40:53,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:40:53,440 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:40:53,440 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:40:53,441 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_47-refine-protected2_true.i [2022-02-20 20:40:53,483 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deed03286/d4fdfe72affb47c7a9f573532f53bcf6/FLAG42e5069ad [2022-02-20 20:40:53,885 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:40:53,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_47-refine-protected2_true.i [2022-02-20 20:40:53,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deed03286/d4fdfe72affb47c7a9f573532f53bcf6/FLAG42e5069ad [2022-02-20 20:40:53,901 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deed03286/d4fdfe72affb47c7a9f573532f53bcf6 [2022-02-20 20:40:53,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:40:53,903 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:40:53,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:53,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:40:53,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:40:53,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:53" (1/1) ... [2022-02-20 20:40:53,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3568d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:53, skipping insertion in model container [2022-02-20 20:40:53,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:53" (1/1) ... [2022-02-20 20:40:53,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:40:53,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:40:54,068 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_47-refine-protected2_true.i[1094,1107] [2022-02-20 20:40:54,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:54,169 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:40:54,181 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_47-refine-protected2_true.i[1094,1107] [2022-02-20 20:40:54,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:54,256 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:40:54,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:54 WrapperNode [2022-02-20 20:40:54,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:54,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:54,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:40:54,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:40:54,262 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:54" (1/1) ... [2022-02-20 20:40:54,284 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:54" (1/1) ... [2022-02-20 20:40:54,302 INFO L137 Inliner]: procedures = 162, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2022-02-20 20:40:54,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:54,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:40:54,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:40:54,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:40:54,308 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:54" (1/1) ... [2022-02-20 20:40:54,308 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:54" (1/1) ... [2022-02-20 20:40:54,313 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:54" (1/1) ... [2022-02-20 20:40:54,313 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:54" (1/1) ... [2022-02-20 20:40:54,324 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:54" (1/1) ... [2022-02-20 20:40:54,328 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:54" (1/1) ... [2022-02-20 20:40:54,331 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:54" (1/1) ... [2022-02-20 20:40:54,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:40:54,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:40:54,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:40:54,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:40:54,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:54" (1/1) ... [2022-02-20 20:40:54,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:54,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:40:54,362 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:54,380 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:54,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:40:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:40:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:40:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:40:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-20 20:40:54,393 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-20 20:40:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:40:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:40:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:40:54,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:40:54,394 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:54,469 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:40:54,470 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:40:54,602 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:40:54,607 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:40:54,608 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:40:54,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:54 BoogieIcfgContainer [2022-02-20 20:40:54,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:40:54,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:40:54,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:40:54,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:40:54,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:40:53" (1/3) ... [2022-02-20 20:40:54,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eee27b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:54, skipping insertion in model container [2022-02-20 20:40:54,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:54" (2/3) ... [2022-02-20 20:40:54,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eee27b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:54, skipping insertion in model container [2022-02-20 20:40:54,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:54" (3/3) ... [2022-02-20 20:40:54,621 INFO L111 eAbstractionObserver]: Analyzing ICFG 13-privatized_47-refine-protected2_true.i [2022-02-20 20:40:54,624 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:40:54,624 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:40:54,624 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:40:54,624 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:40:54,679 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:54,679 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:54,679 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:54,679 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:54,680 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:54,680 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:54,680 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:54,680 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:54,680 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:54,681 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:54,681 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:54,681 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:54,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:54,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:54,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:54,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:54,684 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:54,684 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:54,685 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:54,685 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:54,685 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:54,686 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:40:54,714 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:40:54,719 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:54,719 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 20:40:54,725 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 66 transitions, 137 flow [2022-02-20 20:40:54,745 INFO L129 PetriNetUnfolder]: 3/65 cut-off events. [2022-02-20 20:40:54,745 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:54,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 65 events. 3/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 58 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2022-02-20 20:40:54,747 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 66 transitions, 137 flow [2022-02-20 20:40:54,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 50 transitions, 103 flow [2022-02-20 20:40:54,758 INFO L129 PetriNetUnfolder]: 0/48 cut-off events. [2022-02-20 20:40:54,758 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:54,759 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:54,759 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] [2022-02-20 20:40:54,759 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:54,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:54,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1714392896, now seen corresponding path program 1 times [2022-02-20 20:40:54,770 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:54,770 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919498522] [2022-02-20 20:40:54,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:54,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:54,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {70#true} [126] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {70#true} is VALID [2022-02-20 20:40:54,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {70#true} [116] 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] {70#true} is VALID [2022-02-20 20:40:54,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {70#true} [135] 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[] {70#true} is VALID [2022-02-20 20:40:54,954 INFO L290 TraceCheckUtils]: 3: Hoare triple {70#true} [138] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {70#true} is VALID [2022-02-20 20:40:54,954 INFO L290 TraceCheckUtils]: 4: Hoare triple {70#true} [99] 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[] {70#true} is VALID [2022-02-20 20:40:54,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {70#true} [127] 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[] {70#true} is VALID [2022-02-20 20:40:54,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {70#true} [121] 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[] {70#true} is VALID [2022-02-20 20:40:54,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {70#true} [123] L18-3-->L18-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 42 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {70#true} is VALID [2022-02-20 20:40:54,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {70#true} [124] L18-4-->L682: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {72#(= ~g~0 0)} [81] 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] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {72#(= ~g~0 0)} [100] 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[] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {72#(= ~g~0 0)} [87] 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[] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {72#(= ~g~0 0)} [136] 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[] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {72#(= ~g~0 0)} [109] 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[] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {72#(= ~g~0 0)} [142] 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[] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {72#(= ~g~0 0)} [91] 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[] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {72#(= ~g~0 0)} [132] L682-7-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {72#(= ~g~0 0)} [141] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {72#(= ~g~0 0)} [122] 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] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {72#(= ~g~0 0)} [90] L-1-5-->L690: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre2#1] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {72#(= ~g~0 0)} [131] L690-->L690-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {72#(= ~g~0 0)} [86] L690-1-->L691: Formula: (= |v_ULTIMATE.start_main_#t~pre2#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {72#(= ~g~0 0)} [113] L691-->L691-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {72#(= ~g~0 0)} [143] L691-1-->L691-2: Formula: (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre2#1_3|)) |v_#memory_int_8|) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} AuxVars[] AssignedVars[#memory_int] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {72#(= ~g~0 0)} [154] L691-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre2#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~pre2#1=|v_ULTIMATE.start_main_#t~pre2#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_#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, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {72#(= ~g~0 0)} [130] L691-3-->L691-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {72#(= ~g~0 0)} [139] L691-4-->L692: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {72#(= ~g~0 0)} [111] L692-->L692-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#A~0.base_7|))) (and (= |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) (= |v_ULTIMATE.start_main_#t~nondet4#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|, #pthreadsMutex=|v_#pthreadsMutex_1|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, #pthreadsMutex] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {72#(= ~g~0 0)} [118] L692-1-->L693: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {72#(= ~g~0 0)} is VALID [2022-02-20 20:40:54,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {72#(= ~g~0 0)} [128] L693-->L694: Formula: (not (= v_~g~0_2 0)) InVars {~g~0=v_~g~0_2} OutVars{~g~0=v_~g~0_2} AuxVars[] AssignedVars[] {71#false} is VALID [2022-02-20 20:40:54,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {71#false} [93] L694-->L694-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {71#false} is VALID [2022-02-20 20:40:54,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {71#false} [119] L694-1-->L694-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| v_~g~0_3) InVars {~g~0=v_~g~0_3} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_3} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {71#false} is VALID [2022-02-20 20:40:54,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {71#false} [144] L694-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] {71#false} is VALID [2022-02-20 20:40:54,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {71#false} [104] 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] {71#false} is VALID [2022-02-20 20:40:54,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {71#false} [95] 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[] {71#false} is VALID [2022-02-20 20:40:54,971 INFO L290 TraceCheckUtils]: 35: Hoare triple {71#false} [107] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {71#false} is VALID [2022-02-20 20:40:54,973 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,979 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:54,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919498522] [2022-02-20 20:40:54,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919498522] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:54,980 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:54,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:40:54,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132748969] [2022-02-20 20:40:54,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:54,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2022-02-20 20:40:54,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:54,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:55,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:55,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:40:55,061 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:55,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:40:55,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:40:55,075 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 66 [2022-02-20 20:40:55,076 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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:55,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:55,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 66 [2022-02-20 20:40:55,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:55,102 INFO L129 PetriNetUnfolder]: 1/66 cut-off events. [2022-02-20 20:40:55,103 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:55,103 INFO L84 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 66 events. 1/66 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 109 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 51. Up to 7 conditions per place. [2022-02-20 20:40:55,104 INFO L132 encePairwiseOnDemand]: 62/66 looper letters, 6 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2022-02-20 20:40:55,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 125 flow [2022-02-20 20:40:55,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:40:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:40:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2022-02-20 20:40:55,120 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8838383838383839 [2022-02-20 20:40:55,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 175 transitions. [2022-02-20 20:40:55,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 175 transitions. [2022-02-20 20:40:55,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:55,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 175 transitions. [2022-02-20 20:40:55,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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:55,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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:55,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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:55,130 INFO L186 Difference]: Start difference. First operand has 54 places, 50 transitions, 103 flow. Second operand 3 states and 175 transitions. [2022-02-20 20:40:55,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 125 flow [2022-02-20 20:40:55,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 52 transitions, 124 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:40:55,134 INFO L242 Difference]: Finished difference. Result has 57 places, 51 transitions, 120 flow [2022-02-20 20:40:55,135 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2022-02-20 20:40:55,137 INFO L334 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2022-02-20 20:40:55,138 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 51 transitions, 120 flow [2022-02-20 20:40:55,151 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 177 states, 174 states have (on average 1.6724137931034482) internal successors, (291), 176 states have internal predecessors, (291), 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:55,153 INFO L78 Accepts]: Start accepts. Automaton has has 177 states, 174 states have (on average 1.6724137931034482) internal successors, (291), 176 states have internal predecessors, (291), 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 36 [2022-02-20 20:40:55,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:55,154 INFO L470 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 120 flow [2022-02-20 20:40:55,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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:55,155 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:55,155 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] [2022-02-20 20:40:55,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:40:55,155 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:55,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:55,156 INFO L85 PathProgramCache]: Analyzing trace with hash 83167749, now seen corresponding path program 1 times [2022-02-20 20:40:55,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:55,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358059273] [2022-02-20 20:40:55,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:55,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:55,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#true} [126] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-02-20 20:40:55,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} [116] 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] {254#true} is VALID [2022-02-20 20:40:55,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} [135] 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[] {254#true} is VALID [2022-02-20 20:40:55,289 INFO L290 TraceCheckUtils]: 3: Hoare triple {254#true} [138] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {254#true} is VALID [2022-02-20 20:40:55,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {254#true} [99] 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[] {254#true} is VALID [2022-02-20 20:40:55,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {254#true} [127] 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[] {254#true} is VALID [2022-02-20 20:40:55,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {254#true} [121] 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[] {254#true} is VALID [2022-02-20 20:40:55,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {254#true} [123] L18-3-->L18-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 42 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {254#true} is VALID [2022-02-20 20:40:55,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {254#true} [124] L18-4-->L682: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#(= ~g~0 0)} [81] 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] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {256#(= ~g~0 0)} [100] 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[] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#(= ~g~0 0)} [87] 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[] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {256#(= ~g~0 0)} [136] 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[] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {256#(= ~g~0 0)} [109] 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[] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {256#(= ~g~0 0)} [142] 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[] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {256#(= ~g~0 0)} [91] 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[] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {256#(= ~g~0 0)} [132] L682-7-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {256#(= ~g~0 0)} [141] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {256#(= ~g~0 0)} [122] 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] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {256#(= ~g~0 0)} [90] L-1-5-->L690: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre2#1] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {256#(= ~g~0 0)} [131] L690-->L690-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {256#(= ~g~0 0)} [86] L690-1-->L691: Formula: (= |v_ULTIMATE.start_main_#t~pre2#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {256#(= ~g~0 0)} [113] L691-->L691-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {256#(= ~g~0 0)} [143] L691-1-->L691-2: Formula: (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre2#1_3|)) |v_#memory_int_8|) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} AuxVars[] AssignedVars[#memory_int] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {256#(= ~g~0 0)} [154] L691-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre2#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~pre2#1=|v_ULTIMATE.start_main_#t~pre2#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_#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, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {256#(= ~g~0 0)} [130] L691-3-->L691-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {256#(= ~g~0 0)} [139] L691-4-->L692: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {256#(= ~g~0 0)} [111] L692-->L692-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#A~0.base_7|))) (and (= |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) (= |v_ULTIMATE.start_main_#t~nondet4#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|, #pthreadsMutex=|v_#pthreadsMutex_1|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, #pthreadsMutex] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {256#(= ~g~0 0)} [118] L692-1-->L693: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {256#(= ~g~0 0)} [129] L693-->L696: Formula: (= v_~g~0_4 0) InVars {~g~0=v_~g~0_4} OutVars{~g~0=v_~g~0_4} AuxVars[] AssignedVars[] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {256#(= ~g~0 0)} [125] L696-->L696-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {256#(= ~g~0 0)} [114] L696-1-->L696-2: Formula: (= (ite (= v_~g~0_5 0) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_3|) InVars {~g~0=v_~g~0_5} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_3|, ~g~0=v_~g~0_5} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {257#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:55,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {257#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [94] L696-2-->L19-6: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {257#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:55,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {257#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [137] L19-6-->L19-7: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_6| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_6|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {258#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:55,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {258#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [82] L19-7-->L19-8: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_7| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[] {255#false} is VALID [2022-02-20 20:40:55,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {255#false} [84] L19-8-->ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {255#false} is VALID [2022-02-20 20:40:55,308 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:55,309 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:55,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358059273] [2022-02-20 20:40:55,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358059273] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:55,309 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:55,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:40:55,310 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240175048] [2022-02-20 20:40:55,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:55,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 36 [2022-02-20 20:40:55,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:55,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:55,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:55,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:40:55,342 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:55,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:40:55,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:40:55,348 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 66 [2022-02-20 20:40:55,351 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 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:55,351 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:55,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 66 [2022-02-20 20:40:55,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:55,454 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2022-02-20 20:40:55,456 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-02-20 20:40:55,457 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 73 events. 2/73 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 164 event pairs, 0 based on Foata normal form. 3/76 useless extension candidates. Maximal degree in co-relation 86. Up to 12 conditions per place. [2022-02-20 20:40:55,458 INFO L132 encePairwiseOnDemand]: 60/66 looper letters, 11 selfloop transitions, 2 changer transitions 8/58 dead transitions. [2022-02-20 20:40:55,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 184 flow [2022-02-20 20:40:55,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:40:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:40:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 352 transitions. [2022-02-20 20:40:55,475 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2022-02-20 20:40:55,475 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 352 transitions. [2022-02-20 20:40:55,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 352 transitions. [2022-02-20 20:40:55,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:55,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 352 transitions. [2022-02-20 20:40:55,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 50.285714285714285) internal successors, (352), 7 states have internal predecessors, (352), 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:55,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 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:55,480 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 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:55,480 INFO L186 Difference]: Start difference. First operand has 57 places, 51 transitions, 120 flow. Second operand 7 states and 352 transitions. [2022-02-20 20:40:55,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 184 flow [2022-02-20 20:40:55,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:40:55,491 INFO L242 Difference]: Finished difference. Result has 66 places, 50 transitions, 126 flow [2022-02-20 20:40:55,492 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=126, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2022-02-20 20:40:55,493 INFO L334 CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places. [2022-02-20 20:40:55,493 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 50 transitions, 126 flow [2022-02-20 20:40:55,501 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 129 states, 127 states have (on average 1.5905511811023623) internal successors, (202), 128 states have internal predecessors, (202), 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:55,506 INFO L78 Accepts]: Start accepts. Automaton has has 129 states, 127 states have (on average 1.5905511811023623) internal successors, (202), 128 states have internal predecessors, (202), 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 36 [2022-02-20 20:40:55,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:55,507 INFO L470 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 126 flow [2022-02-20 20:40:55,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 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:55,511 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:55,511 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] [2022-02-20 20:40:55,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:40:55,512 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:55,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:55,515 INFO L85 PathProgramCache]: Analyzing trace with hash -740331581, now seen corresponding path program 1 times [2022-02-20 20:40:55,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:55,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147286785] [2022-02-20 20:40:55,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:55,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:55,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {401#true} [126] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#true} is VALID [2022-02-20 20:40:55,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {401#true} [116] 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] {401#true} is VALID [2022-02-20 20:40:55,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {401#true} [135] 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[] {401#true} is VALID [2022-02-20 20:40:55,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {401#true} [138] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {401#true} is VALID [2022-02-20 20:40:55,590 INFO L290 TraceCheckUtils]: 4: Hoare triple {401#true} [99] 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[] {401#true} is VALID [2022-02-20 20:40:55,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {401#true} [127] 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[] {401#true} is VALID [2022-02-20 20:40:55,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {401#true} [121] 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[] {401#true} is VALID [2022-02-20 20:40:55,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {401#true} [123] L18-3-->L18-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 42 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {401#true} is VALID [2022-02-20 20:40:55,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {401#true} [124] L18-4-->L682: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {401#true} is VALID [2022-02-20 20:40:55,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {401#true} [81] 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] {401#true} is VALID [2022-02-20 20:40:55,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {401#true} [100] 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[] {401#true} is VALID [2022-02-20 20:40:55,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {401#true} [87] 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[] {401#true} is VALID [2022-02-20 20:40:55,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {401#true} [136] 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[] {401#true} is VALID [2022-02-20 20:40:55,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {401#true} [109] 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[] {401#true} is VALID [2022-02-20 20:40:55,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {401#true} [142] 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[] {401#true} is VALID [2022-02-20 20:40:55,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {401#true} [91] 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[] {401#true} is VALID [2022-02-20 20:40:55,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {401#true} [132] L682-7-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#true} is VALID [2022-02-20 20:40:55,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {401#true} [141] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#true} is VALID [2022-02-20 20:40:55,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {401#true} [122] 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] {401#true} is VALID [2022-02-20 20:40:55,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {401#true} [90] L-1-5-->L690: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre2#1] {401#true} is VALID [2022-02-20 20:40:55,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {401#true} [131] L690-->L690-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {401#true} is VALID [2022-02-20 20:40:55,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {401#true} [86] L690-1-->L691: Formula: (= |v_ULTIMATE.start_main_#t~pre2#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {401#true} is VALID [2022-02-20 20:40:55,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {401#true} [113] L691-->L691-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {401#true} is VALID [2022-02-20 20:40:55,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {401#true} [143] L691-1-->L691-2: Formula: (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre2#1_3|)) |v_#memory_int_8|) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} AuxVars[] AssignedVars[#memory_int] {401#true} is VALID [2022-02-20 20:40:55,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {401#true} [154] L691-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre2#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~pre2#1=|v_ULTIMATE.start_main_#t~pre2#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_#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, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {401#true} is VALID [2022-02-20 20:40:55,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {401#true} [130] L691-3-->L691-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {401#true} is VALID [2022-02-20 20:40:55,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {401#true} [139] L691-4-->L692: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {401#true} is VALID [2022-02-20 20:40:55,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {401#true} [111] L692-->L692-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#A~0.base_7|))) (and (= |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) (= |v_ULTIMATE.start_main_#t~nondet4#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|, #pthreadsMutex=|v_#pthreadsMutex_1|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, #pthreadsMutex] {403#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:40:55,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {403#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [118] L692-1-->L693: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {403#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:40:55,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {403#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [129] L693-->L696: Formula: (= v_~g~0_4 0) InVars {~g~0=v_~g~0_4} OutVars{~g~0=v_~g~0_4} AuxVars[] AssignedVars[] {403#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:40:55,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {403#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [125] L696-->L696-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {403#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:40:55,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {403#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [146] t_funENTRY-->L684: 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] {403#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:40:55,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {403#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [147] L684-->L684-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#A~0.base_9|))) (and (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#A~0.base_9| (store .cse0 |v_~#A~0.offset_9| 1))) (= 0 (select .cse0 |v_~#A~0.offset_9|)) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#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_5|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {402#false} is VALID [2022-02-20 20:40:55,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {402#false} [148] L684-1-->L685: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {402#false} is VALID [2022-02-20 20:40:55,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {402#false} [149] L685-->L686: Formula: (= v_~g~0_6 1) InVars {} OutVars{~g~0=v_~g~0_6} AuxVars[] AssignedVars[~g~0] {404#(= ~g~0 0)} is VALID [2022-02-20 20:40:55,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {404#(= ~g~0 0)} [114] L696-1-->L696-2: Formula: (= (ite (= v_~g~0_5 0) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_3|) InVars {~g~0=v_~g~0_5} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_3|, ~g~0=v_~g~0_5} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {405#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:55,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {405#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [94] L696-2-->L19-6: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {405#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:55,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {405#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [137] L19-6-->L19-7: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_6| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_6|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {406#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:55,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {406#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [82] L19-7-->L19-8: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_7| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[] {402#false} is VALID [2022-02-20 20:40:55,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {402#false} [84] L19-8-->ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#false} is VALID [2022-02-20 20:40:55,600 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:55,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:55,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147286785] [2022-02-20 20:40:55,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147286785] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:55,601 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:55,601 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:40:55,601 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320601652] [2022-02-20 20:40:55,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:55,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 40 [2022-02-20 20:40:55,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:55,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:55,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:55,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:40:55,624 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:55,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:40:55,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:40:55,625 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2022-02-20 20:40:55,625 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 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:55,626 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:55,626 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2022-02-20 20:40:55,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:55,695 INFO L129 PetriNetUnfolder]: 0/47 cut-off events. [2022-02-20 20:40:55,696 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-02-20 20:40:55,696 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 47 events. 0/47 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 4/51 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-02-20 20:40:55,696 INFO L132 encePairwiseOnDemand]: 61/66 looper letters, 12 selfloop transitions, 5 changer transitions 3/46 dead transitions. [2022-02-20 20:40:55,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 46 transitions, 146 flow [2022-02-20 20:40:55,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:40:55,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:40:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 207 transitions. [2022-02-20 20:40:55,699 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2022-02-20 20:40:55,700 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 207 transitions. [2022-02-20 20:40:55,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 207 transitions. [2022-02-20 20:40:55,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:55,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 207 transitions. [2022-02-20 20:40:55,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 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:55,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 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:55,701 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 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:55,702 INFO L186 Difference]: Start difference. First operand has 66 places, 50 transitions, 126 flow. Second operand 5 states and 207 transitions. [2022-02-20 20:40:55,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 46 transitions, 146 flow [2022-02-20 20:40:55,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 46 transitions, 140 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-02-20 20:40:55,703 INFO L242 Difference]: Finished difference. Result has 58 places, 43 transitions, 104 flow [2022-02-20 20:40:55,703 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2022-02-20 20:40:55,704 INFO L334 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2022-02-20 20:40:55,704 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 43 transitions, 104 flow [2022-02-20 20:40:55,706 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 76 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 75 states have internal predecessors, (107), 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:55,706 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 75 states have internal predecessors, (107), 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 40 [2022-02-20 20:40:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:55,707 INFO L470 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 104 flow [2022-02-20 20:40:55,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 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:55,707 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:55,707 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] [2022-02-20 20:40:55,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:40:55,708 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:55,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:55,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1940122568, now seen corresponding path program 1 times [2022-02-20 20:40:55,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:55,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667808549] [2022-02-20 20:40:55,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:55,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:55,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {487#true} [126] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#true} is VALID [2022-02-20 20:40:55,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {487#true} [116] 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] {487#true} is VALID [2022-02-20 20:40:55,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#true} [135] 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[] {487#true} is VALID [2022-02-20 20:40:55,749 INFO L290 TraceCheckUtils]: 3: Hoare triple {487#true} [138] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {487#true} is VALID [2022-02-20 20:40:55,749 INFO L290 TraceCheckUtils]: 4: Hoare triple {487#true} [99] 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[] {487#true} is VALID [2022-02-20 20:40:55,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {487#true} [127] 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[] {487#true} is VALID [2022-02-20 20:40:55,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {487#true} [121] 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[] {487#true} is VALID [2022-02-20 20:40:55,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {487#true} [123] L18-3-->L18-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 42 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {487#true} is VALID [2022-02-20 20:40:55,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {487#true} [124] L18-4-->L682: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {487#true} is VALID [2022-02-20 20:40:55,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {487#true} [81] 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] {487#true} is VALID [2022-02-20 20:40:55,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {487#true} [100] 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[] {487#true} is VALID [2022-02-20 20:40:55,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {487#true} [87] 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[] {487#true} is VALID [2022-02-20 20:40:55,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {487#true} [136] 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[] {487#true} is VALID [2022-02-20 20:40:55,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {487#true} [109] 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[] {487#true} is VALID [2022-02-20 20:40:55,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {487#true} [142] 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[] {487#true} is VALID [2022-02-20 20:40:55,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {487#true} [91] 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[] {487#true} is VALID [2022-02-20 20:40:55,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {487#true} [132] L682-7-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#true} is VALID [2022-02-20 20:40:55,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {487#true} [141] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#true} is VALID [2022-02-20 20:40:55,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {487#true} [122] 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] {487#true} is VALID [2022-02-20 20:40:55,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {487#true} [90] L-1-5-->L690: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre2#1] {487#true} is VALID [2022-02-20 20:40:55,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {487#true} [131] L690-->L690-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {487#true} is VALID [2022-02-20 20:40:55,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {487#true} [86] L690-1-->L691: Formula: (= |v_ULTIMATE.start_main_#t~pre2#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {487#true} is VALID [2022-02-20 20:40:55,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {487#true} [113] L691-->L691-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {487#true} is VALID [2022-02-20 20:40:55,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {487#true} [143] L691-1-->L691-2: Formula: (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre2#1_3|)) |v_#memory_int_8|) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} AuxVars[] AssignedVars[#memory_int] {487#true} is VALID [2022-02-20 20:40:55,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {487#true} [154] L691-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre2#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~pre2#1=|v_ULTIMATE.start_main_#t~pre2#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_#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, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {487#true} is VALID [2022-02-20 20:40:55,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {487#true} [146] t_funENTRY-->L684: 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] {487#true} is VALID [2022-02-20 20:40:55,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {487#true} [147] L684-->L684-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#A~0.base_9|))) (and (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#A~0.base_9| (store .cse0 |v_~#A~0.offset_9| 1))) (= 0 (select .cse0 |v_~#A~0.offset_9|)) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#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_5|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {487#true} is VALID [2022-02-20 20:40:55,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {487#true} [148] L684-1-->L685: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {487#true} is VALID [2022-02-20 20:40:55,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {487#true} [149] L685-->L686: Formula: (= v_~g~0_6 1) InVars {} OutVars{~g~0=v_~g~0_6} AuxVars[] AssignedVars[~g~0] {487#true} is VALID [2022-02-20 20:40:55,754 INFO L290 TraceCheckUtils]: 29: Hoare triple {487#true} [150] L686-->L687: Formula: (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#A~0.base_10| (store (select |v_#pthreadsMutex_8| |v_~#A~0.base_10|) |v_~#A~0.offset_10| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#A~0.offset=|v_~#A~0.offset_10|, ~#A~0.base=|v_~#A~0.base_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, ~#A~0.offset=|v_~#A~0.offset_10|, ~#A~0.base=|v_~#A~0.base_10|} AuxVars[] AssignedVars[#pthreadsMutex] {487#true} is VALID [2022-02-20 20:40:55,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {487#true} [130] L691-3-->L691-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {487#true} is VALID [2022-02-20 20:40:55,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {487#true} [139] L691-4-->L692: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {487#true} is VALID [2022-02-20 20:40:55,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {487#true} [111] L692-->L692-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#A~0.base_7|))) (and (= |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) (= |v_ULTIMATE.start_main_#t~nondet4#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|, #pthreadsMutex=|v_#pthreadsMutex_1|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, #pthreadsMutex] {487#true} is VALID [2022-02-20 20:40:55,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {487#true} [118] L692-1-->L693: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {487#true} is VALID [2022-02-20 20:40:55,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {487#true} [128] L693-->L694: Formula: (not (= v_~g~0_2 0)) InVars {~g~0=v_~g~0_2} OutVars{~g~0=v_~g~0_2} AuxVars[] AssignedVars[] {489#(not (= ~g~0 0))} is VALID [2022-02-20 20:40:55,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {489#(not (= ~g~0 0))} [93] L694-->L694-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#(not (= ~g~0 0))} is VALID [2022-02-20 20:40:55,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {489#(not (= ~g~0 0))} [119] L694-1-->L694-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| v_~g~0_3) InVars {~g~0=v_~g~0_3} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_3} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {490#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:55,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {490#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [144] L694-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] {490#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:55,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {490#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [104] 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] {491#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:55,757 INFO L290 TraceCheckUtils]: 39: Hoare triple {491#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [95] 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[] {488#false} is VALID [2022-02-20 20:40:55,757 INFO L290 TraceCheckUtils]: 40: Hoare triple {488#false} [107] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {488#false} is VALID [2022-02-20 20:40:55,757 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:55,757 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:55,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667808549] [2022-02-20 20:40:55,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667808549] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:55,758 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:55,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:40:55,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395030269] [2022-02-20 20:40:55,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:55,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 41 [2022-02-20 20:40:55,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:55,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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:55,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:55,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:40:55,781 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:55,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:40:55,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:40:55,782 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 66 [2022-02-20 20:40:55,782 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:55,782 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:55,782 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 66 [2022-02-20 20:40:55,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:55,813 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2022-02-20 20:40:55,813 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-02-20 20:40:55,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 41 events. 0/41 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 5 event pairs, 0 based on Foata normal form. 1/42 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-02-20 20:40:55,813 INFO L132 encePairwiseOnDemand]: 62/66 looper letters, 0 selfloop transitions, 0 changer transitions 41/41 dead transitions. [2022-02-20 20:40:55,813 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 41 transitions, 114 flow [2022-02-20 20:40:55,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:40:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:40:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2022-02-20 20:40:55,816 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7363636363636363 [2022-02-20 20:40:55,816 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 243 transitions. [2022-02-20 20:40:55,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 243 transitions. [2022-02-20 20:40:55,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:55,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 243 transitions. [2022-02-20 20:40:55,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:55,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 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:55,818 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 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:55,818 INFO L186 Difference]: Start difference. First operand has 58 places, 43 transitions, 104 flow. Second operand 5 states and 243 transitions. [2022-02-20 20:40:55,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 41 transitions, 114 flow [2022-02-20 20:40:55,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 41 transitions, 101 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-02-20 20:40:55,819 INFO L242 Difference]: Finished difference. Result has 53 places, 0 transitions, 0 flow [2022-02-20 20:40:55,819 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=53, PETRI_TRANSITIONS=0} [2022-02-20 20:40:55,820 INFO L334 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2022-02-20 20:40:55,820 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 0 transitions, 0 flow [2022-02-20 20:40:55,820 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:55,820 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 41 [2022-02-20 20:40:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:55,820 INFO L470 AbstractCegarLoop]: Abstraction has has 53 places, 0 transitions, 0 flow [2022-02-20 20:40:55,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:55,823 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-20 20:40:55,823 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-02-20 20:40:55,823 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 3 remaining) [2022-02-20 20:40:55,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:40:55,826 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 20:40:55,827 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:40:55,827 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:40:55,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:40:55 BasicIcfg [2022-02-20 20:40:55,830 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:40:55,830 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:40:55,830 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:40:55,830 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:40:55,831 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:54" (3/4) ... [2022-02-20 20:40:55,832 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 20:40:55,836 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2022-02-20 20:40:55,842 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 20:40:55,843 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 20:40:55,843 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 20:40:55,843 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 20:40:55,862 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:40:55,863 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:40:55,864 INFO L158 Benchmark]: Toolchain (without parser) took 1960.01ms. Allocated memory was 88.1MB in the beginning and 119.5MB in the end (delta: 31.5MB). Free memory was 54.1MB in the beginning and 93.9MB in the end (delta: -39.8MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2022-02-20 20:40:55,864 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 88.1MB. Free memory is still 44.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:55,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.97ms. Allocated memory is still 88.1MB. Free memory was 53.9MB in the beginning and 53.4MB in the end (delta: 558.3kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 20:40:55,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.98ms. Allocated memory is still 88.1MB. Free memory was 53.4MB in the beginning and 51.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:55,865 INFO L158 Benchmark]: Boogie Preprocessor took 34.88ms. Allocated memory is still 88.1MB. Free memory was 51.3MB in the beginning and 49.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:55,865 INFO L158 Benchmark]: RCFGBuilder took 270.37ms. Allocated memory is still 88.1MB. Free memory was 49.9MB in the beginning and 38.3MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 20:40:55,865 INFO L158 Benchmark]: TraceAbstraction took 1213.62ms. Allocated memory is still 119.5MB. Free memory was 96.7MB in the beginning and 37.1MB in the end (delta: 59.6MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2022-02-20 20:40:55,865 INFO L158 Benchmark]: Witness Printer took 32.73ms. Allocated memory is still 119.5MB. Free memory was 37.1MB in the beginning and 93.9MB in the end (delta: -56.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:55,866 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.32ms. Allocated memory is still 88.1MB. Free memory is still 44.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.97ms. Allocated memory is still 88.1MB. Free memory was 53.9MB in the beginning and 53.4MB in the end (delta: 558.3kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.98ms. Allocated memory is still 88.1MB. Free memory was 53.4MB in the beginning and 51.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.88ms. Allocated memory is still 88.1MB. Free memory was 51.3MB in the beginning and 49.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 270.37ms. Allocated memory is still 88.1MB. Free memory was 49.9MB in the beginning and 38.3MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1213.62ms. Allocated memory is still 119.5MB. Free memory was 96.7MB in the beginning and 37.1MB in the end (delta: 59.6MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. * Witness Printer took 32.73ms. Allocated memory is still 119.5MB. Free memory was 37.1MB in the beginning and 93.9MB in the end (delta: -56.8MB). 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, 73 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.1s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 33 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=2, InterpolantAutomatonStates: 20, 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.3s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 149 ConstructedInterpolants, 0 QuantifiedInterpolants, 302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, 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:55,891 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