./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_33-traces-v-matters_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_33-traces-v-matters_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 5093baaae269ae8f20fbce19a6dc2a002c438d5951124b2c99d459b145e3e5a5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:40:30,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:40:30,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:40:30,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:40:30,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:40:30,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:40:30,744 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:40:30,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:40:30,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:40:30,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:40:30,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:40:30,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:40:30,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:40:30,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:40:30,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:40:30,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:40:30,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:40:30,758 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:40:30,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:40:30,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:40:30,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:40:30,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:40:30,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:40:30,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:40:30,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:40:30,773 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:40:30,773 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:40:30,774 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:40:30,774 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:40:30,775 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:40:30,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:40:30,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:40:30,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:40:30,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:40:30,780 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:40:30,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:40:30,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:40:30,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:40:30,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:40:30,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:40:30,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:40:30,783 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:30,805 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:40:30,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:40:30,806 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:40:30,806 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:40:30,807 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:40:30,807 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:40:30,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:40:30,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:40:30,808 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:40:30,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:40:30,809 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:40:30,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:40:30,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:40:30,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:40:30,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:40:30,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:40:30,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:40:30,810 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:40:30,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:40:30,810 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:40:30,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:40:30,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:40:30,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:40:30,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:40:30,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:30,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:40:30,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:40:30,812 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:40:30,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:40:30,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:40:30,812 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:40:30,813 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:40:30,813 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:40:30,813 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 -> 5093baaae269ae8f20fbce19a6dc2a002c438d5951124b2c99d459b145e3e5a5 [2022-02-20 20:40:31,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:40:31,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:40:31,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:40:31,030 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:40:31,031 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:40:31,031 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_33-traces-v-matters_true.i [2022-02-20 20:40:31,078 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec16f28bf/0bbb3a69484b45c1a812f5e9e7b7bd57/FLAG7db4d1be1 [2022-02-20 20:40:31,518 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:40:31,520 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_33-traces-v-matters_true.i [2022-02-20 20:40:31,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec16f28bf/0bbb3a69484b45c1a812f5e9e7b7bd57/FLAG7db4d1be1 [2022-02-20 20:40:31,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec16f28bf/0bbb3a69484b45c1a812f5e9e7b7bd57 [2022-02-20 20:40:31,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:40:31,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:40:31,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:31,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:40:31,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:40:31,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:31" (1/1) ... [2022-02-20 20:40:31,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b07a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:31, skipping insertion in model container [2022-02-20 20:40:31,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:31" (1/1) ... [2022-02-20 20:40:31,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:40:31,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:40:31,736 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_33-traces-v-matters_true.i[1093,1106] [2022-02-20 20:40:31,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:31,882 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:40:31,891 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_33-traces-v-matters_true.i[1093,1106] [2022-02-20 20:40:31,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:31,935 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:40:31,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:31 WrapperNode [2022-02-20 20:40:31,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:31,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:31,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:40:31,937 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:40:31,945 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:31" (1/1) ... [2022-02-20 20:40:31,961 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:31" (1/1) ... [2022-02-20 20:40:31,984 INFO L137 Inliner]: procedures = 162, calls = 36, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2022-02-20 20:40:31,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:31,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:40:31,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:40:31,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:40:31,990 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:31" (1/1) ... [2022-02-20 20:40:31,990 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:31" (1/1) ... [2022-02-20 20:40:32,002 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:31" (1/1) ... [2022-02-20 20:40:32,003 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:31" (1/1) ... [2022-02-20 20:40:32,011 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:31" (1/1) ... [2022-02-20 20:40:32,018 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:31" (1/1) ... [2022-02-20 20:40:32,019 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:31" (1/1) ... [2022-02-20 20:40:32,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:40:32,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:40:32,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:40:32,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:40:32,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:31" (1/1) ... [2022-02-20 20:40:32,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:32,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:40:32,050 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:32,055 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:32,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:40:32,078 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:40:32,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:40:32,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:40:32,078 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-20 20:40:32,079 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-20 20:40:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:40:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:40:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:40:32,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:40:32,080 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:32,210 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:40:32,212 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:40:32,406 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:40:32,413 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:40:32,413 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:40:32,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:32 BoogieIcfgContainer [2022-02-20 20:40:32,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:40:32,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:40:32,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:40:32,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:40:32,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:40:31" (1/3) ... [2022-02-20 20:40:32,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ace68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:32, skipping insertion in model container [2022-02-20 20:40:32,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:31" (2/3) ... [2022-02-20 20:40:32,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ace68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:32, skipping insertion in model container [2022-02-20 20:40:32,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:32" (3/3) ... [2022-02-20 20:40:32,423 INFO L111 eAbstractionObserver]: Analyzing ICFG 13-privatized_33-traces-v-matters_true.i [2022-02-20 20:40:32,426 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:40:32,427 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:40:32,427 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:40:32,427 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:40:32,477 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:32,477 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:32,477 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,477 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,478 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:32,478 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:32,478 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,478 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,479 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,480 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,481 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,481 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,481 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,481 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,482 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,482 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,482 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,483 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,484 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,484 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,485 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,485 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,485 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,485 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,491 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,493 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,493 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,494 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,494 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,494 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,494 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:32,497 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:40:32,529 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:40:32,534 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:32,534 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:40:32,542 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 79 transitions, 163 flow [2022-02-20 20:40:32,572 INFO L129 PetriNetUnfolder]: 1/78 cut-off events. [2022-02-20 20:40:32,574 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:32,576 INFO L84 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 78 events. 1/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2022-02-20 20:40:32,577 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 79 transitions, 163 flow [2022-02-20 20:40:32,579 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 68 transitions, 139 flow [2022-02-20 20:40:32,598 INFO L129 PetriNetUnfolder]: 0/67 cut-off events. [2022-02-20 20:40:32,598 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:32,598 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:32,599 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:32,599 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:32,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:32,603 INFO L85 PathProgramCache]: Analyzing trace with hash 733907834, now seen corresponding path program 1 times [2022-02-20 20:40:32,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:32,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145849917] [2022-02-20 20:40:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:32,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:32,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {85#true} [140] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {85#true} [126] 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] {85#true} is VALID [2022-02-20 20:40:32,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {85#true} [148] 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[] {85#true} is VALID [2022-02-20 20:40:32,886 INFO L290 TraceCheckUtils]: 3: Hoare triple {85#true} [151] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,887 INFO L290 TraceCheckUtils]: 4: Hoare triple {85#true} [108] 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[] {85#true} is VALID [2022-02-20 20:40:32,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {85#true} [141] 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[] {85#true} is VALID [2022-02-20 20:40:32,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {85#true} [130] 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[] {85#true} is VALID [2022-02-20 20:40:32,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {85#true} [133] L18-3-->L18-4: Formula: (and (= 41 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {85#true} [134] L18-4-->L682: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {85#true} is VALID [2022-02-20 20:40:32,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {85#true} [89] L682-->L682-1: Formula: (and (= 3 |v_~#C~0.base_1|) (= |v_~#C~0.offset_1| 0)) InVars {} OutVars{~#C~0.base=|v_~#C~0.base_1|, ~#C~0.offset=|v_~#C~0.offset_1|} AuxVars[] AssignedVars[~#C~0.base, ~#C~0.offset] {85#true} is VALID [2022-02-20 20:40:32,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {85#true} [109] 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[] {85#true} is VALID [2022-02-20 20:40:32,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {85#true} [94] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#C~0.base_2|) |v_~#C~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#C~0.base=|v_~#C~0.base_2|, ~#C~0.offset=|v_~#C~0.offset_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#C~0.base=|v_~#C~0.base_2|, ~#C~0.offset=|v_~#C~0.offset_2|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {85#true} [150] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#C~0.base_3|) (+ |v_~#C~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#C~0.base=|v_~#C~0.base_3|, ~#C~0.offset=|v_~#C~0.offset_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#C~0.base=|v_~#C~0.base_3|, ~#C~0.offset=|v_~#C~0.offset_3|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {85#true} [122] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#C~0.base_4|) (+ |v_~#C~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#C~0.base=|v_~#C~0.base_4|, ~#C~0.offset=|v_~#C~0.offset_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#C~0.base=|v_~#C~0.base_4|, ~#C~0.offset=|v_~#C~0.offset_4|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {85#true} [155] L682-5-->L682-6: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_6| |v_~#C~0.base_5|) (+ |v_~#C~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_6|, ~#C~0.base=|v_~#C~0.base_5|, ~#C~0.offset=|v_~#C~0.offset_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#C~0.base=|v_~#C~0.base_5|, ~#C~0.offset=|v_~#C~0.offset_5|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {85#true} [100] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#C~0.base_6|) (+ |v_~#C~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#C~0.base=|v_~#C~0.base_6|, ~#C~0.offset=|v_~#C~0.offset_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#C~0.base=|v_~#C~0.base_6|, ~#C~0.offset=|v_~#C~0.offset_6|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {85#true} [144] L682-7-->L683: Formula: (and (= |v_~#D~0.offset_1| 0) (= |v_~#D~0.base_1| 4)) InVars {} OutVars{~#D~0.offset=|v_~#D~0.offset_1|, ~#D~0.base=|v_~#D~0.base_1|} AuxVars[] AssignedVars[~#D~0.base, ~#D~0.offset] {85#true} is VALID [2022-02-20 20:40:32,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {85#true} [96] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {85#true} [139] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#D~0.base_2|) |v_~#D~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#D~0.base=|v_~#D~0.base_2|, ~#D~0.offset=|v_~#D~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#D~0.base=|v_~#D~0.base_2|, ~#D~0.offset=|v_~#D~0.offset_2|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {85#true} [125] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_9| |v_~#D~0.base_3|) (+ |v_~#D~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#D~0.base=|v_~#D~0.base_3|, ~#D~0.offset=|v_~#D~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#D~0.base=|v_~#D~0.base_3|, ~#D~0.offset=|v_~#D~0.offset_3|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {85#true} [145] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#D~0.base_4|) (+ |v_~#D~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#D~0.base=|v_~#D~0.base_4|, ~#D~0.offset=|v_~#D~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#D~0.base=|v_~#D~0.base_4|, ~#D~0.offset=|v_~#D~0.offset_4|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {85#true} [88] L683-4-->L683-5: Formula: (= (select (select |v_#memory_int_11| |v_~#D~0.base_5|) (+ |v_~#D~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_11|, ~#D~0.base=|v_~#D~0.base_5|, ~#D~0.offset=|v_~#D~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#D~0.base=|v_~#D~0.base_5|, ~#D~0.offset=|v_~#D~0.offset_5|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {85#true} [146] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#D~0.base_6|) (+ |v_~#D~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#D~0.base=|v_~#D~0.base_6|, ~#D~0.offset=|v_~#D~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#D~0.base=|v_~#D~0.base_6|, ~#D~0.offset=|v_~#D~0.offset_6|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {85#true} [123] L683-6-->L684: Formula: (and (= 5 |v_~#E~0.base_1|) (= |v_~#E~0.offset_1| 0)) InVars {} OutVars{~#E~0.base=|v_~#E~0.base_1|, ~#E~0.offset=|v_~#E~0.offset_1|} AuxVars[] AssignedVars[~#E~0.offset, ~#E~0.base] {85#true} is VALID [2022-02-20 20:40:32,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {85#true} [90] L684-->L684-1: Formula: (and (= (select |v_#valid_6| 5) 1) (= 24 (select |v_#length_5| 5))) InVars {#length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {85#true} [118] L684-1-->L684-2: Formula: (= (select (select |v_#memory_int_13| |v_~#E~0.base_2|) |v_~#E~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_13|, ~#E~0.base=|v_~#E~0.base_2|, ~#E~0.offset=|v_~#E~0.offset_2|} OutVars{#memory_int=|v_#memory_int_13|, ~#E~0.base=|v_~#E~0.base_2|, ~#E~0.offset=|v_~#E~0.offset_2|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {85#true} [93] L684-2-->L684-3: Formula: (= (select (select |v_#memory_int_14| |v_~#E~0.base_3|) (+ |v_~#E~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_14|, ~#E~0.base=|v_~#E~0.base_3|, ~#E~0.offset=|v_~#E~0.offset_3|} OutVars{#memory_int=|v_#memory_int_14|, ~#E~0.base=|v_~#E~0.base_3|, ~#E~0.offset=|v_~#E~0.offset_3|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {85#true} [159] L684-3-->L684-4: Formula: (= 0 (select (select |v_#memory_int_15| |v_~#E~0.base_4|) (+ |v_~#E~0.offset_4| 8))) InVars {#memory_int=|v_#memory_int_15|, ~#E~0.base=|v_~#E~0.base_4|, ~#E~0.offset=|v_~#E~0.offset_4|} OutVars{#memory_int=|v_#memory_int_15|, ~#E~0.base=|v_~#E~0.base_4|, ~#E~0.offset=|v_~#E~0.offset_4|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {85#true} [157] L684-4-->L684-5: Formula: (= (select (select |v_#memory_int_16| |v_~#E~0.base_5|) (+ |v_~#E~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_16|, ~#E~0.base=|v_~#E~0.base_5|, ~#E~0.offset=|v_~#E~0.offset_5|} OutVars{#memory_int=|v_#memory_int_16|, ~#E~0.base=|v_~#E~0.base_5|, ~#E~0.offset=|v_~#E~0.offset_5|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {85#true} [158] L684-5-->L684-6: Formula: (= (select (select |v_#memory_int_17| |v_~#E~0.base_6|) (+ |v_~#E~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_17|, ~#E~0.base=|v_~#E~0.base_6|, ~#E~0.offset=|v_~#E~0.offset_6|} OutVars{#memory_int=|v_#memory_int_17|, ~#E~0.base=|v_~#E~0.base_6|, ~#E~0.offset=|v_~#E~0.offset_6|} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {85#true} [137] L684-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {85#true} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85#true} is VALID [2022-02-20 20:40:32,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {85#true} [132] 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] {85#true} is VALID [2022-02-20 20:40:32,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {85#true} [98] L-1-5-->L696: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre4#1] {85#true} is VALID [2022-02-20 20:40:32,900 INFO L290 TraceCheckUtils]: 34: Hoare triple {85#true} [135] L696-->L696-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#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_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {85#true} is VALID [2022-02-20 20:40:32,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {85#true} [124] L696-1-->L697: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {85#true} is VALID [2022-02-20 20:40:32,901 INFO L290 TraceCheckUtils]: 36: Hoare triple {85#true} [117] L697-->L697-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {85#true} is VALID [2022-02-20 20:40:32,901 INFO L290 TraceCheckUtils]: 37: Hoare triple {85#true} [99] L697-1-->L697-2: Formula: (= |v_#memory_int_18| (store |v_#memory_int_19| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|))) InVars {#memory_int=|v_#memory_int_19|, 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~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{#memory_int=|v_#memory_int_18|, 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~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[#memory_int] {85#true} is VALID [2022-02-20 20:40:32,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {85#true} [177] L697-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#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~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_6|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {85#true} is VALID [2022-02-20 20:40:32,902 INFO L290 TraceCheckUtils]: 39: Hoare triple {85#true} [87] L697-3-->L697-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {85#true} is VALID [2022-02-20 20:40:32,902 INFO L290 TraceCheckUtils]: 40: Hoare triple {85#true} [110] L697-4-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {85#true} is VALID [2022-02-20 20:40:32,902 INFO L290 TraceCheckUtils]: 41: Hoare triple {85#true} [114] L698-->L698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#C~0.base_7|))) (and (= (select .cse0 |v_~#C~0.offset_7|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#C~0.base_7| (store .cse0 |v_~#C~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#C~0.base=|v_~#C~0.base_7|, ~#C~0.offset=|v_~#C~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#C~0.base=|v_~#C~0.base_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|, ~#C~0.offset=|v_~#C~0.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {85#true} is VALID [2022-02-20 20:40:32,906 INFO L290 TraceCheckUtils]: 42: Hoare triple {85#true} [112] L698-1-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {85#true} is VALID [2022-02-20 20:40:32,907 INFO L290 TraceCheckUtils]: 43: Hoare triple {85#true} [128] L699-->L699-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#D~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet7#1_2| 0) (= (select .cse0 |v_~#D~0.offset_7|) 0) (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#D~0.base_7| (store .cse0 |v_~#D~0.offset_7| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#D~0.base=|v_~#D~0.base_7|, ~#D~0.offset=|v_~#D~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#D~0.base=|v_~#D~0.base_7|, ~#D~0.offset=|v_~#D~0.offset_7|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet7#1] {85#true} is VALID [2022-02-20 20:40:32,907 INFO L290 TraceCheckUtils]: 44: Hoare triple {85#true} [101] L699-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {85#true} is VALID [2022-02-20 20:40:32,908 INFO L290 TraceCheckUtils]: 45: Hoare triple {85#true} [152] L700-->L701: Formula: (= 2 v_~g~0_2) InVars {} OutVars{~g~0=v_~g~0_2} AuxVars[] AssignedVars[~g~0] {87#(= 2 ~g~0)} is VALID [2022-02-20 20:40:32,908 INFO L290 TraceCheckUtils]: 46: Hoare triple {87#(= 2 ~g~0)} [142] L701-->L702: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#C~0.base_8| (store (select |v_#pthreadsMutex_6| |v_~#C~0.base_8|) |v_~#C~0.offset_8| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#C~0.base=|v_~#C~0.base_8|, ~#C~0.offset=|v_~#C~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#C~0.base=|v_~#C~0.base_8|, ~#C~0.offset=|v_~#C~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex] {87#(= 2 ~g~0)} is VALID [2022-02-20 20:40:32,909 INFO L290 TraceCheckUtils]: 47: Hoare triple {87#(= 2 ~g~0)} [106] L702-->L702-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_8| |v_~#E~0.base_7|))) (and (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#E~0.base_7| (store .cse0 |v_~#E~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet8#1_2| 0) (= (select .cse0 |v_~#E~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#E~0.base=|v_~#E~0.base_7|, ~#E~0.offset=|v_~#E~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, ~#E~0.base=|v_~#E~0.base_7|, ~#E~0.offset=|v_~#E~0.offset_7|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet8#1] {87#(= 2 ~g~0)} is VALID [2022-02-20 20:40:32,911 INFO L290 TraceCheckUtils]: 48: Hoare triple {87#(= 2 ~g~0)} [115] L702-1-->L703: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {87#(= 2 ~g~0)} is VALID [2022-02-20 20:40:32,912 INFO L290 TraceCheckUtils]: 49: Hoare triple {87#(= 2 ~g~0)} [95] L703-->L703-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87#(= 2 ~g~0)} is VALID [2022-02-20 20:40:32,914 INFO L290 TraceCheckUtils]: 50: Hoare triple {87#(= 2 ~g~0)} [136] L703-1-->L703-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 2 v_~g~0_3) 1 0)) 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] {88#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:32,915 INFO L290 TraceCheckUtils]: 51: Hoare triple {88#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [113] L703-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] {88#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:32,916 INFO L290 TraceCheckUtils]: 52: Hoare triple {88#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [116] 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] {89#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:32,916 INFO L290 TraceCheckUtils]: 53: Hoare triple {89#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [102] 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[] {86#false} is VALID [2022-02-20 20:40:32,917 INFO L290 TraceCheckUtils]: 54: Hoare triple {86#false} [120] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#false} is VALID [2022-02-20 20:40:32,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:40:32,918 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:32,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145849917] [2022-02-20 20:40:32,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145849917] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:32,919 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:32,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:40:32,920 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193847614] [2022-02-20 20:40:32,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:32,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 55 [2022-02-20 20:40:32,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:32,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:32,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:32,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:40:32,986 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:33,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:40:33,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:40:33,018 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 79 [2022-02-20 20:40:33,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:33,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:33,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 79 [2022-02-20 20:40:33,025 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:33,117 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2022-02-20 20:40:33,117 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:33,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 106 events. 2/106 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 189 event pairs, 0 based on Foata normal form. 3/109 useless extension candidates. Maximal degree in co-relation 86. Up to 9 conditions per place. [2022-02-20 20:40:33,118 INFO L132 encePairwiseOnDemand]: 74/79 looper letters, 6 selfloop transitions, 2 changer transitions 8/76 dead transitions. [2022-02-20 20:40:33,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 76 transitions, 187 flow [2022-02-20 20:40:33,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:40:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:40:33,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 494 transitions. [2022-02-20 20:40:33,135 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8933092224231465 [2022-02-20 20:40:33,135 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 494 transitions. [2022-02-20 20:40:33,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 494 transitions. [2022-02-20 20:40:33,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:33,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 494 transitions. [2022-02-20 20:40:33,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 70.57142857142857) internal successors, (494), 7 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:33,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:33,147 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:33,149 INFO L186 Difference]: Start difference. First operand has 72 places, 68 transitions, 139 flow. Second operand 7 states and 494 transitions. [2022-02-20 20:40:33,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 76 transitions, 187 flow [2022-02-20 20:40:33,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 76 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:40:33,153 INFO L242 Difference]: Finished difference. Result has 82 places, 68 transitions, 154 flow [2022-02-20 20:40:33,154 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=154, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2022-02-20 20:40:33,157 INFO L334 CegarLoopForPetriNet]: 72 programPoint places, 10 predicate places. [2022-02-20 20:40:33,157 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 68 transitions, 154 flow [2022-02-20 20:40:33,167 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 191 states, 190 states have (on average 1.6421052631578947) internal successors, (312), 190 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:33,168 INFO L78 Accepts]: Start accepts. Automaton has has 191 states, 190 states have (on average 1.6421052631578947) internal successors, (312), 190 states have internal predecessors, (312), 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 55 [2022-02-20 20:40:33,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:33,168 INFO L470 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 154 flow [2022-02-20 20:40:33,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:33,169 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:33,169 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:33,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:40:33,169 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:33,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:33,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1624863671, now seen corresponding path program 1 times [2022-02-20 20:40:33,170 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:33,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764550229] [2022-02-20 20:40:33,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:33,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:33,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#true} [140] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {294#true} is VALID [2022-02-20 20:40:33,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#true} [126] 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] {294#true} is VALID [2022-02-20 20:40:33,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} [148] 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[] {294#true} is VALID [2022-02-20 20:40:33,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {294#true} [151] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {294#true} is VALID [2022-02-20 20:40:33,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {294#true} [108] 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[] {294#true} is VALID [2022-02-20 20:40:33,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#true} [141] 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[] {294#true} is VALID [2022-02-20 20:40:33,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {294#true} [130] 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[] {294#true} is VALID [2022-02-20 20:40:33,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#true} [133] L18-3-->L18-4: Formula: (and (= 41 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {294#true} is VALID [2022-02-20 20:40:33,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#true} [134] L18-4-->L682: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {294#true} is VALID [2022-02-20 20:40:33,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#true} [89] L682-->L682-1: Formula: (and (= 3 |v_~#C~0.base_1|) (= |v_~#C~0.offset_1| 0)) InVars {} OutVars{~#C~0.base=|v_~#C~0.base_1|, ~#C~0.offset=|v_~#C~0.offset_1|} AuxVars[] AssignedVars[~#C~0.base, ~#C~0.offset] {296#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:33,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#(<= |~#C~0.base| 3)} [109] 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[] {296#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:33,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#(<= |~#C~0.base| 3)} [94] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#C~0.base_2|) |v_~#C~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#C~0.base=|v_~#C~0.base_2|, ~#C~0.offset=|v_~#C~0.offset_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#C~0.base=|v_~#C~0.base_2|, ~#C~0.offset=|v_~#C~0.offset_2|} AuxVars[] AssignedVars[] {296#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:33,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {296#(<= |~#C~0.base| 3)} [150] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#C~0.base_3|) (+ |v_~#C~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#C~0.base=|v_~#C~0.base_3|, ~#C~0.offset=|v_~#C~0.offset_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#C~0.base=|v_~#C~0.base_3|, ~#C~0.offset=|v_~#C~0.offset_3|} AuxVars[] AssignedVars[] {296#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:33,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {296#(<= |~#C~0.base| 3)} [122] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#C~0.base_4|) (+ |v_~#C~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#C~0.base=|v_~#C~0.base_4|, ~#C~0.offset=|v_~#C~0.offset_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#C~0.base=|v_~#C~0.base_4|, ~#C~0.offset=|v_~#C~0.offset_4|} AuxVars[] AssignedVars[] {296#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:33,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {296#(<= |~#C~0.base| 3)} [155] L682-5-->L682-6: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_6| |v_~#C~0.base_5|) (+ |v_~#C~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_6|, ~#C~0.base=|v_~#C~0.base_5|, ~#C~0.offset=|v_~#C~0.offset_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#C~0.base=|v_~#C~0.base_5|, ~#C~0.offset=|v_~#C~0.offset_5|} AuxVars[] AssignedVars[] {296#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:33,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {296#(<= |~#C~0.base| 3)} [100] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#C~0.base_6|) (+ |v_~#C~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#C~0.base=|v_~#C~0.base_6|, ~#C~0.offset=|v_~#C~0.offset_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#C~0.base=|v_~#C~0.base_6|, ~#C~0.offset=|v_~#C~0.offset_6|} AuxVars[] AssignedVars[] {296#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:33,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {296#(<= |~#C~0.base| 3)} [144] L682-7-->L683: Formula: (and (= |v_~#D~0.offset_1| 0) (= |v_~#D~0.base_1| 4)) InVars {} OutVars{~#D~0.offset=|v_~#D~0.offset_1|, ~#D~0.base=|v_~#D~0.base_1|} AuxVars[] AssignedVars[~#D~0.base, ~#D~0.offset] {296#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:33,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {296#(<= |~#C~0.base| 3)} [96] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {296#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:33,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {296#(<= |~#C~0.base| 3)} [139] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#D~0.base_2|) |v_~#D~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#D~0.base=|v_~#D~0.base_2|, ~#D~0.offset=|v_~#D~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#D~0.base=|v_~#D~0.base_2|, ~#D~0.offset=|v_~#D~0.offset_2|} AuxVars[] AssignedVars[] {296#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:33,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {296#(<= |~#C~0.base| 3)} [125] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_9| |v_~#D~0.base_3|) (+ |v_~#D~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#D~0.base=|v_~#D~0.base_3|, ~#D~0.offset=|v_~#D~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#D~0.base=|v_~#D~0.base_3|, ~#D~0.offset=|v_~#D~0.offset_3|} AuxVars[] AssignedVars[] {296#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:33,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {296#(<= |~#C~0.base| 3)} [145] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#D~0.base_4|) (+ |v_~#D~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#D~0.base=|v_~#D~0.base_4|, ~#D~0.offset=|v_~#D~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#D~0.base=|v_~#D~0.base_4|, ~#D~0.offset=|v_~#D~0.offset_4|} AuxVars[] AssignedVars[] {296#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:33,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {296#(<= |~#C~0.base| 3)} [88] L683-4-->L683-5: Formula: (= (select (select |v_#memory_int_11| |v_~#D~0.base_5|) (+ |v_~#D~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_11|, ~#D~0.base=|v_~#D~0.base_5|, ~#D~0.offset=|v_~#D~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#D~0.base=|v_~#D~0.base_5|, ~#D~0.offset=|v_~#D~0.offset_5|} AuxVars[] AssignedVars[] {296#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:33,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {296#(<= |~#C~0.base| 3)} [146] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#D~0.base_6|) (+ |v_~#D~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#D~0.base=|v_~#D~0.base_6|, ~#D~0.offset=|v_~#D~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#D~0.base=|v_~#D~0.base_6|, ~#D~0.offset=|v_~#D~0.offset_6|} AuxVars[] AssignedVars[] {296#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:33,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {296#(<= |~#C~0.base| 3)} [123] L683-6-->L684: Formula: (and (= 5 |v_~#E~0.base_1|) (= |v_~#E~0.offset_1| 0)) InVars {} OutVars{~#E~0.base=|v_~#E~0.base_1|, ~#E~0.offset=|v_~#E~0.offset_1|} AuxVars[] AssignedVars[~#E~0.offset, ~#E~0.base] {297#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:33,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {297#(not (= |~#E~0.base| |~#C~0.base|))} [90] L684-->L684-1: Formula: (and (= (select |v_#valid_6| 5) 1) (= 24 (select |v_#length_5| 5))) InVars {#length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] {297#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:33,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {297#(not (= |~#E~0.base| |~#C~0.base|))} [118] L684-1-->L684-2: Formula: (= (select (select |v_#memory_int_13| |v_~#E~0.base_2|) |v_~#E~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_13|, ~#E~0.base=|v_~#E~0.base_2|, ~#E~0.offset=|v_~#E~0.offset_2|} OutVars{#memory_int=|v_#memory_int_13|, ~#E~0.base=|v_~#E~0.base_2|, ~#E~0.offset=|v_~#E~0.offset_2|} AuxVars[] AssignedVars[] {297#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:33,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {297#(not (= |~#E~0.base| |~#C~0.base|))} [93] L684-2-->L684-3: Formula: (= (select (select |v_#memory_int_14| |v_~#E~0.base_3|) (+ |v_~#E~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_14|, ~#E~0.base=|v_~#E~0.base_3|, ~#E~0.offset=|v_~#E~0.offset_3|} OutVars{#memory_int=|v_#memory_int_14|, ~#E~0.base=|v_~#E~0.base_3|, ~#E~0.offset=|v_~#E~0.offset_3|} AuxVars[] AssignedVars[] {297#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:33,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {297#(not (= |~#E~0.base| |~#C~0.base|))} [159] L684-3-->L684-4: Formula: (= 0 (select (select |v_#memory_int_15| |v_~#E~0.base_4|) (+ |v_~#E~0.offset_4| 8))) InVars {#memory_int=|v_#memory_int_15|, ~#E~0.base=|v_~#E~0.base_4|, ~#E~0.offset=|v_~#E~0.offset_4|} OutVars{#memory_int=|v_#memory_int_15|, ~#E~0.base=|v_~#E~0.base_4|, ~#E~0.offset=|v_~#E~0.offset_4|} AuxVars[] AssignedVars[] {297#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:33,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {297#(not (= |~#E~0.base| |~#C~0.base|))} [157] L684-4-->L684-5: Formula: (= (select (select |v_#memory_int_16| |v_~#E~0.base_5|) (+ |v_~#E~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_16|, ~#E~0.base=|v_~#E~0.base_5|, ~#E~0.offset=|v_~#E~0.offset_5|} OutVars{#memory_int=|v_#memory_int_16|, ~#E~0.base=|v_~#E~0.base_5|, ~#E~0.offset=|v_~#E~0.offset_5|} AuxVars[] AssignedVars[] {297#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:33,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {297#(not (= |~#E~0.base| |~#C~0.base|))} [158] L684-5-->L684-6: Formula: (= (select (select |v_#memory_int_17| |v_~#E~0.base_6|) (+ |v_~#E~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_17|, ~#E~0.base=|v_~#E~0.base_6|, ~#E~0.offset=|v_~#E~0.offset_6|} OutVars{#memory_int=|v_#memory_int_17|, ~#E~0.base=|v_~#E~0.base_6|, ~#E~0.offset=|v_~#E~0.offset_6|} AuxVars[] AssignedVars[] {297#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:33,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {297#(not (= |~#E~0.base| |~#C~0.base|))} [137] L684-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {297#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:33,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {297#(not (= |~#E~0.base| |~#C~0.base|))} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {297#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:33,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {297#(not (= |~#E~0.base| |~#C~0.base|))} [132] 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] {297#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:33,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {297#(not (= |~#E~0.base| |~#C~0.base|))} [98] L-1-5-->L696: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre4#1] {297#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:33,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {297#(not (= |~#E~0.base| |~#C~0.base|))} [135] L696-->L696-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#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_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {297#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:33,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {297#(not (= |~#E~0.base| |~#C~0.base|))} [124] L696-1-->L697: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {297#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:33,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {297#(not (= |~#E~0.base| |~#C~0.base|))} [117] L697-->L697-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {297#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:33,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {297#(not (= |~#E~0.base| |~#C~0.base|))} [99] L697-1-->L697-2: Formula: (= |v_#memory_int_18| (store |v_#memory_int_19| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|))) InVars {#memory_int=|v_#memory_int_19|, 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~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{#memory_int=|v_#memory_int_18|, 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~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[#memory_int] {297#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:33,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {297#(not (= |~#E~0.base| |~#C~0.base|))} [177] L697-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#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~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_6|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {297#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:33,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {297#(not (= |~#E~0.base| |~#C~0.base|))} [163] t_funENTRY-->L686: 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] {297#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:33,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {297#(not (= |~#E~0.base| |~#C~0.base|))} [164] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_10| |v_~#C~0.base_9|))) (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#C~0.base_9| (store .cse0 |v_~#C~0.offset_9| 1))) (= (select .cse0 |v_~#C~0.offset_9|) 0) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#C~0.base=|v_~#C~0.base_9|, ~#C~0.offset=|v_~#C~0.offset_9|} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|, #pthreadsMutex=|v_#pthreadsMutex_9|, ~#C~0.base=|v_~#C~0.base_9|, ~#C~0.offset=|v_~#C~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {298#(and (not (= |~#E~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1))} is VALID [2022-02-20 20:40:33,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {298#(and (not (= |~#E~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1))} [165] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {298#(and (not (= |~#E~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1))} is VALID [2022-02-20 20:40:33,306 INFO L290 TraceCheckUtils]: 42: Hoare triple {298#(and (not (= |~#E~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1))} [166] L687-->L687-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#E~0.base_8|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet2_1| 0) (= (select .cse0 |v_~#E~0.offset_8|) 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#E~0.base_8| (store .cse0 |v_~#E~0.offset_8| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#E~0.base=|v_~#E~0.base_8|, ~#E~0.offset=|v_~#E~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_11|, ~#E~0.base=|v_~#E~0.base_8|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_1|, ~#E~0.offset=|v_~#E~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2] {299#(= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1)} is VALID [2022-02-20 20:40:33,306 INFO L290 TraceCheckUtils]: 43: Hoare triple {299#(= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1)} [167] L687-1-->L688: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2] {299#(= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1)} is VALID [2022-02-20 20:40:33,307 INFO L290 TraceCheckUtils]: 44: Hoare triple {299#(= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1)} [87] L697-3-->L697-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {299#(= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1)} is VALID [2022-02-20 20:40:33,307 INFO L290 TraceCheckUtils]: 45: Hoare triple {299#(= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1)} [110] L697-4-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {299#(= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1)} is VALID [2022-02-20 20:40:33,307 INFO L290 TraceCheckUtils]: 46: Hoare triple {299#(= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1)} [114] L698-->L698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#C~0.base_7|))) (and (= (select .cse0 |v_~#C~0.offset_7|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#C~0.base_7| (store .cse0 |v_~#C~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#C~0.base=|v_~#C~0.base_7|, ~#C~0.offset=|v_~#C~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#C~0.base=|v_~#C~0.base_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|, ~#C~0.offset=|v_~#C~0.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {295#false} is VALID [2022-02-20 20:40:33,308 INFO L290 TraceCheckUtils]: 47: Hoare triple {295#false} [112] L698-1-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {295#false} is VALID [2022-02-20 20:40:33,308 INFO L290 TraceCheckUtils]: 48: Hoare triple {295#false} [128] L699-->L699-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#D~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet7#1_2| 0) (= (select .cse0 |v_~#D~0.offset_7|) 0) (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#D~0.base_7| (store .cse0 |v_~#D~0.offset_7| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#D~0.base=|v_~#D~0.base_7|, ~#D~0.offset=|v_~#D~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#D~0.base=|v_~#D~0.base_7|, ~#D~0.offset=|v_~#D~0.offset_7|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet7#1] {295#false} is VALID [2022-02-20 20:40:33,308 INFO L290 TraceCheckUtils]: 49: Hoare triple {295#false} [101] L699-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {295#false} is VALID [2022-02-20 20:40:33,308 INFO L290 TraceCheckUtils]: 50: Hoare triple {295#false} [152] L700-->L701: Formula: (= 2 v_~g~0_2) InVars {} OutVars{~g~0=v_~g~0_2} AuxVars[] AssignedVars[~g~0] {295#false} is VALID [2022-02-20 20:40:33,308 INFO L290 TraceCheckUtils]: 51: Hoare triple {295#false} [168] L688-->L689: Formula: (= 42 v_~g~0_4) InVars {} OutVars{~g~0=v_~g~0_4} AuxVars[] AssignedVars[~g~0] {295#false} is VALID [2022-02-20 20:40:33,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {295#false} [142] L701-->L702: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#C~0.base_8| (store (select |v_#pthreadsMutex_6| |v_~#C~0.base_8|) |v_~#C~0.offset_8| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#C~0.base=|v_~#C~0.base_8|, ~#C~0.offset=|v_~#C~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#C~0.base=|v_~#C~0.base_8|, ~#C~0.offset=|v_~#C~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex] {295#false} is VALID [2022-02-20 20:40:33,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {295#false} [106] L702-->L702-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_8| |v_~#E~0.base_7|))) (and (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#E~0.base_7| (store .cse0 |v_~#E~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet8#1_2| 0) (= (select .cse0 |v_~#E~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#E~0.base=|v_~#E~0.base_7|, ~#E~0.offset=|v_~#E~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, ~#E~0.base=|v_~#E~0.base_7|, ~#E~0.offset=|v_~#E~0.offset_7|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet8#1] {295#false} is VALID [2022-02-20 20:40:33,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {295#false} [115] L702-1-->L703: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {295#false} is VALID [2022-02-20 20:40:33,309 INFO L290 TraceCheckUtils]: 55: Hoare triple {295#false} [95] L703-->L703-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#false} is VALID [2022-02-20 20:40:33,309 INFO L290 TraceCheckUtils]: 56: Hoare triple {295#false} [136] L703-1-->L703-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 2 v_~g~0_3) 1 0)) 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] {295#false} is VALID [2022-02-20 20:40:33,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {295#false} [113] L703-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] {295#false} is VALID [2022-02-20 20:40:33,310 INFO L290 TraceCheckUtils]: 58: Hoare triple {295#false} [116] 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] {295#false} is VALID [2022-02-20 20:40:33,310 INFO L290 TraceCheckUtils]: 59: Hoare triple {295#false} [102] 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[] {295#false} is VALID [2022-02-20 20:40:33,310 INFO L290 TraceCheckUtils]: 60: Hoare triple {295#false} [120] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#false} is VALID [2022-02-20 20:40:33,311 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:33,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:33,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764550229] [2022-02-20 20:40:33,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764550229] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:33,311 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:33,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:40:33,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250140040] [2022-02-20 20:40:33,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:33,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 61 [2022-02-20 20:40:33,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:33,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:33,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:33,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:40:33,351 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:33,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:40:33,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:40:33,352 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 79 [2022-02-20 20:40:33,353 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 57.166666666666664) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:33,353 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:33,353 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 79 [2022-02-20 20:40:33,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:33,472 INFO L129 PetriNetUnfolder]: 6/97 cut-off events. [2022-02-20 20:40:33,472 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-02-20 20:40:33,472 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 97 events. 6/97 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 2 based on Foata normal form. 4/101 useless extension candidates. Maximal degree in co-relation 143. Up to 16 conditions per place. [2022-02-20 20:40:33,473 INFO L132 encePairwiseOnDemand]: 73/79 looper letters, 18 selfloop transitions, 6 changer transitions 0/69 dead transitions. [2022-02-20 20:40:33,473 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 69 transitions, 204 flow [2022-02-20 20:40:33,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:40:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:40:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 296 transitions. [2022-02-20 20:40:33,476 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7493670886075949 [2022-02-20 20:40:33,477 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 296 transitions. [2022-02-20 20:40:33,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 296 transitions. [2022-02-20 20:40:33,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:33,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 296 transitions. [2022-02-20 20:40:33,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:33,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:33,479 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:33,479 INFO L186 Difference]: Start difference. First operand has 82 places, 68 transitions, 154 flow. Second operand 5 states and 296 transitions. [2022-02-20 20:40:33,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 69 transitions, 204 flow [2022-02-20 20:40:37,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 69 transitions, 194 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-02-20 20:40:37,285 INFO L242 Difference]: Finished difference. Result has 77 places, 68 transitions, 156 flow [2022-02-20 20:40:37,285 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2022-02-20 20:40:37,286 INFO L334 CegarLoopForPetriNet]: 72 programPoint places, 5 predicate places. [2022-02-20 20:40:37,286 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 68 transitions, 156 flow [2022-02-20 20:40:37,290 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 163 states, 161 states have (on average 1.565217391304348) internal successors, (252), 162 states have internal predecessors, (252), 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:37,291 INFO L78 Accepts]: Start accepts. Automaton has has 163 states, 161 states have (on average 1.565217391304348) internal successors, (252), 162 states have internal predecessors, (252), 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 61 [2022-02-20 20:40:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:37,291 INFO L470 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 156 flow [2022-02-20 20:40:37,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.166666666666664) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:37,292 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:37,292 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:37,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:40:37,292 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:37,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:37,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1286636087, now seen corresponding path program 2 times [2022-02-20 20:40:37,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:37,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699691007] [2022-02-20 20:40:37,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:37,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:37,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {469#true} [140] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#true} is VALID [2022-02-20 20:40:37,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#true} [126] 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] {469#true} is VALID [2022-02-20 20:40:37,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} [148] 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[] {469#true} is VALID [2022-02-20 20:40:37,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {469#true} [151] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {469#true} is VALID [2022-02-20 20:40:37,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {469#true} [108] 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[] {469#true} is VALID [2022-02-20 20:40:37,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {469#true} [141] 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[] {469#true} is VALID [2022-02-20 20:40:37,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {469#true} [130] 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[] {469#true} is VALID [2022-02-20 20:40:37,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#true} [133] L18-3-->L18-4: Formula: (and (= 41 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {469#true} is VALID [2022-02-20 20:40:37,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {469#true} [134] L18-4-->L682: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {469#true} is VALID [2022-02-20 20:40:37,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {469#true} [89] L682-->L682-1: Formula: (and (= 3 |v_~#C~0.base_1|) (= |v_~#C~0.offset_1| 0)) InVars {} OutVars{~#C~0.base=|v_~#C~0.base_1|, ~#C~0.offset=|v_~#C~0.offset_1|} AuxVars[] AssignedVars[~#C~0.base, ~#C~0.offset] {471#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {471#(<= |~#C~0.base| 3)} [109] 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[] {471#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#(<= |~#C~0.base| 3)} [94] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#C~0.base_2|) |v_~#C~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#C~0.base=|v_~#C~0.base_2|, ~#C~0.offset=|v_~#C~0.offset_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#C~0.base=|v_~#C~0.base_2|, ~#C~0.offset=|v_~#C~0.offset_2|} AuxVars[] AssignedVars[] {471#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {471#(<= |~#C~0.base| 3)} [150] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#C~0.base_3|) (+ |v_~#C~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#C~0.base=|v_~#C~0.base_3|, ~#C~0.offset=|v_~#C~0.offset_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#C~0.base=|v_~#C~0.base_3|, ~#C~0.offset=|v_~#C~0.offset_3|} AuxVars[] AssignedVars[] {471#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {471#(<= |~#C~0.base| 3)} [122] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#C~0.base_4|) (+ |v_~#C~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#C~0.base=|v_~#C~0.base_4|, ~#C~0.offset=|v_~#C~0.offset_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#C~0.base=|v_~#C~0.base_4|, ~#C~0.offset=|v_~#C~0.offset_4|} AuxVars[] AssignedVars[] {471#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {471#(<= |~#C~0.base| 3)} [155] L682-5-->L682-6: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_6| |v_~#C~0.base_5|) (+ |v_~#C~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_6|, ~#C~0.base=|v_~#C~0.base_5|, ~#C~0.offset=|v_~#C~0.offset_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#C~0.base=|v_~#C~0.base_5|, ~#C~0.offset=|v_~#C~0.offset_5|} AuxVars[] AssignedVars[] {471#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {471#(<= |~#C~0.base| 3)} [100] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#C~0.base_6|) (+ |v_~#C~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#C~0.base=|v_~#C~0.base_6|, ~#C~0.offset=|v_~#C~0.offset_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#C~0.base=|v_~#C~0.base_6|, ~#C~0.offset=|v_~#C~0.offset_6|} AuxVars[] AssignedVars[] {471#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {471#(<= |~#C~0.base| 3)} [144] L682-7-->L683: Formula: (and (= |v_~#D~0.offset_1| 0) (= |v_~#D~0.base_1| 4)) InVars {} OutVars{~#D~0.offset=|v_~#D~0.offset_1|, ~#D~0.base=|v_~#D~0.base_1|} AuxVars[] AssignedVars[~#D~0.base, ~#D~0.offset] {471#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {471#(<= |~#C~0.base| 3)} [96] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {471#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {471#(<= |~#C~0.base| 3)} [139] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#D~0.base_2|) |v_~#D~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#D~0.base=|v_~#D~0.base_2|, ~#D~0.offset=|v_~#D~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#D~0.base=|v_~#D~0.base_2|, ~#D~0.offset=|v_~#D~0.offset_2|} AuxVars[] AssignedVars[] {471#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {471#(<= |~#C~0.base| 3)} [125] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_9| |v_~#D~0.base_3|) (+ |v_~#D~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#D~0.base=|v_~#D~0.base_3|, ~#D~0.offset=|v_~#D~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#D~0.base=|v_~#D~0.base_3|, ~#D~0.offset=|v_~#D~0.offset_3|} AuxVars[] AssignedVars[] {471#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {471#(<= |~#C~0.base| 3)} [145] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#D~0.base_4|) (+ |v_~#D~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#D~0.base=|v_~#D~0.base_4|, ~#D~0.offset=|v_~#D~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#D~0.base=|v_~#D~0.base_4|, ~#D~0.offset=|v_~#D~0.offset_4|} AuxVars[] AssignedVars[] {471#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {471#(<= |~#C~0.base| 3)} [88] L683-4-->L683-5: Formula: (= (select (select |v_#memory_int_11| |v_~#D~0.base_5|) (+ |v_~#D~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_11|, ~#D~0.base=|v_~#D~0.base_5|, ~#D~0.offset=|v_~#D~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#D~0.base=|v_~#D~0.base_5|, ~#D~0.offset=|v_~#D~0.offset_5|} AuxVars[] AssignedVars[] {471#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {471#(<= |~#C~0.base| 3)} [146] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#D~0.base_6|) (+ |v_~#D~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#D~0.base=|v_~#D~0.base_6|, ~#D~0.offset=|v_~#D~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#D~0.base=|v_~#D~0.base_6|, ~#D~0.offset=|v_~#D~0.offset_6|} AuxVars[] AssignedVars[] {471#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {471#(<= |~#C~0.base| 3)} [123] L683-6-->L684: Formula: (and (= 5 |v_~#E~0.base_1|) (= |v_~#E~0.offset_1| 0)) InVars {} OutVars{~#E~0.base=|v_~#E~0.base_1|, ~#E~0.offset=|v_~#E~0.offset_1|} AuxVars[] AssignedVars[~#E~0.offset, ~#E~0.base] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [90] L684-->L684-1: Formula: (and (= (select |v_#valid_6| 5) 1) (= 24 (select |v_#length_5| 5))) InVars {#length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [118] L684-1-->L684-2: Formula: (= (select (select |v_#memory_int_13| |v_~#E~0.base_2|) |v_~#E~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_13|, ~#E~0.base=|v_~#E~0.base_2|, ~#E~0.offset=|v_~#E~0.offset_2|} OutVars{#memory_int=|v_#memory_int_13|, ~#E~0.base=|v_~#E~0.base_2|, ~#E~0.offset=|v_~#E~0.offset_2|} AuxVars[] AssignedVars[] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [93] L684-2-->L684-3: Formula: (= (select (select |v_#memory_int_14| |v_~#E~0.base_3|) (+ |v_~#E~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_14|, ~#E~0.base=|v_~#E~0.base_3|, ~#E~0.offset=|v_~#E~0.offset_3|} OutVars{#memory_int=|v_#memory_int_14|, ~#E~0.base=|v_~#E~0.base_3|, ~#E~0.offset=|v_~#E~0.offset_3|} AuxVars[] AssignedVars[] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [159] L684-3-->L684-4: Formula: (= 0 (select (select |v_#memory_int_15| |v_~#E~0.base_4|) (+ |v_~#E~0.offset_4| 8))) InVars {#memory_int=|v_#memory_int_15|, ~#E~0.base=|v_~#E~0.base_4|, ~#E~0.offset=|v_~#E~0.offset_4|} OutVars{#memory_int=|v_#memory_int_15|, ~#E~0.base=|v_~#E~0.base_4|, ~#E~0.offset=|v_~#E~0.offset_4|} AuxVars[] AssignedVars[] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [157] L684-4-->L684-5: Formula: (= (select (select |v_#memory_int_16| |v_~#E~0.base_5|) (+ |v_~#E~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_16|, ~#E~0.base=|v_~#E~0.base_5|, ~#E~0.offset=|v_~#E~0.offset_5|} OutVars{#memory_int=|v_#memory_int_16|, ~#E~0.base=|v_~#E~0.base_5|, ~#E~0.offset=|v_~#E~0.offset_5|} AuxVars[] AssignedVars[] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [158] L684-5-->L684-6: Formula: (= (select (select |v_#memory_int_17| |v_~#E~0.base_6|) (+ |v_~#E~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_17|, ~#E~0.base=|v_~#E~0.base_6|, ~#E~0.offset=|v_~#E~0.offset_6|} OutVars{#memory_int=|v_#memory_int_17|, ~#E~0.base=|v_~#E~0.base_6|, ~#E~0.offset=|v_~#E~0.offset_6|} AuxVars[] AssignedVars[] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [137] L684-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [132] 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] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,401 INFO L290 TraceCheckUtils]: 33: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [98] L-1-5-->L696: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre4#1] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [135] L696-->L696-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#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_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [124] L696-1-->L697: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,403 INFO L290 TraceCheckUtils]: 36: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [117] L697-->L697-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,403 INFO L290 TraceCheckUtils]: 37: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [99] L697-1-->L697-2: Formula: (= |v_#memory_int_18| (store |v_#memory_int_19| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|))) InVars {#memory_int=|v_#memory_int_19|, 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~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{#memory_int=|v_#memory_int_18|, 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~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[#memory_int] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,403 INFO L290 TraceCheckUtils]: 38: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [177] L697-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#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~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_6|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,404 INFO L290 TraceCheckUtils]: 39: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [87] L697-3-->L697-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,404 INFO L290 TraceCheckUtils]: 40: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [110] L697-4-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,404 INFO L290 TraceCheckUtils]: 41: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [114] L698-->L698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#C~0.base_7|))) (and (= (select .cse0 |v_~#C~0.offset_7|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#C~0.base_7| (store .cse0 |v_~#C~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#C~0.base=|v_~#C~0.base_7|, ~#C~0.offset=|v_~#C~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#C~0.base=|v_~#C~0.base_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|, ~#C~0.offset=|v_~#C~0.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,405 INFO L290 TraceCheckUtils]: 42: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [112] L698-1-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,405 INFO L290 TraceCheckUtils]: 43: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [128] L699-->L699-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#D~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet7#1_2| 0) (= (select .cse0 |v_~#D~0.offset_7|) 0) (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#D~0.base_7| (store .cse0 |v_~#D~0.offset_7| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#D~0.base=|v_~#D~0.base_7|, ~#D~0.offset=|v_~#D~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#D~0.base=|v_~#D~0.base_7|, ~#D~0.offset=|v_~#D~0.offset_7|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet7#1] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,406 INFO L290 TraceCheckUtils]: 44: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [101] L699-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,406 INFO L290 TraceCheckUtils]: 45: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [152] L700-->L701: Formula: (= 2 v_~g~0_2) InVars {} OutVars{~g~0=v_~g~0_2} AuxVars[] AssignedVars[~g~0] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,406 INFO L290 TraceCheckUtils]: 46: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [142] L701-->L702: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#C~0.base_8| (store (select |v_#pthreadsMutex_6| |v_~#C~0.base_8|) |v_~#C~0.offset_8| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#C~0.base=|v_~#C~0.base_8|, ~#C~0.offset=|v_~#C~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#C~0.base=|v_~#C~0.base_8|, ~#C~0.offset=|v_~#C~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex] {472#(not (= |~#E~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:37,407 INFO L290 TraceCheckUtils]: 47: Hoare triple {472#(not (= |~#E~0.base| |~#C~0.base|))} [106] L702-->L702-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_8| |v_~#E~0.base_7|))) (and (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#E~0.base_7| (store .cse0 |v_~#E~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet8#1_2| 0) (= (select .cse0 |v_~#E~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#E~0.base=|v_~#E~0.base_7|, ~#E~0.offset=|v_~#E~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, ~#E~0.base=|v_~#E~0.base_7|, ~#E~0.offset=|v_~#E~0.offset_7|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet8#1] {473#(and (not (= |~#E~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#E~0.base|) |~#E~0.offset|) 1))} is VALID [2022-02-20 20:40:37,407 INFO L290 TraceCheckUtils]: 48: Hoare triple {473#(and (not (= |~#E~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#E~0.base|) |~#E~0.offset|) 1))} [163] t_funENTRY-->L686: 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] {473#(and (not (= |~#E~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#E~0.base|) |~#E~0.offset|) 1))} is VALID [2022-02-20 20:40:37,408 INFO L290 TraceCheckUtils]: 49: Hoare triple {473#(and (not (= |~#E~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#E~0.base|) |~#E~0.offset|) 1))} [164] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_10| |v_~#C~0.base_9|))) (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#C~0.base_9| (store .cse0 |v_~#C~0.offset_9| 1))) (= (select .cse0 |v_~#C~0.offset_9|) 0) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#C~0.base=|v_~#C~0.base_9|, ~#C~0.offset=|v_~#C~0.offset_9|} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|, #pthreadsMutex=|v_#pthreadsMutex_9|, ~#C~0.base=|v_~#C~0.base_9|, ~#C~0.offset=|v_~#C~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {474#(= (select (select |#pthreadsMutex| |~#E~0.base|) |~#E~0.offset|) 1)} is VALID [2022-02-20 20:40:37,408 INFO L290 TraceCheckUtils]: 50: Hoare triple {474#(= (select (select |#pthreadsMutex| |~#E~0.base|) |~#E~0.offset|) 1)} [165] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {474#(= (select (select |#pthreadsMutex| |~#E~0.base|) |~#E~0.offset|) 1)} is VALID [2022-02-20 20:40:37,409 INFO L290 TraceCheckUtils]: 51: Hoare triple {474#(= (select (select |#pthreadsMutex| |~#E~0.base|) |~#E~0.offset|) 1)} [166] L687-->L687-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#E~0.base_8|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet2_1| 0) (= (select .cse0 |v_~#E~0.offset_8|) 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#E~0.base_8| (store .cse0 |v_~#E~0.offset_8| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#E~0.base=|v_~#E~0.base_8|, ~#E~0.offset=|v_~#E~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_11|, ~#E~0.base=|v_~#E~0.base_8|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_1|, ~#E~0.offset=|v_~#E~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2] {470#false} is VALID [2022-02-20 20:40:37,409 INFO L290 TraceCheckUtils]: 52: Hoare triple {470#false} [167] L687-1-->L688: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2] {470#false} is VALID [2022-02-20 20:40:37,409 INFO L290 TraceCheckUtils]: 53: Hoare triple {470#false} [168] L688-->L689: Formula: (= 42 v_~g~0_4) InVars {} OutVars{~g~0=v_~g~0_4} AuxVars[] AssignedVars[~g~0] {470#false} is VALID [2022-02-20 20:40:37,409 INFO L290 TraceCheckUtils]: 54: Hoare triple {470#false} [115] L702-1-->L703: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {470#false} is VALID [2022-02-20 20:40:37,409 INFO L290 TraceCheckUtils]: 55: Hoare triple {470#false} [95] L703-->L703-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {470#false} is VALID [2022-02-20 20:40:37,410 INFO L290 TraceCheckUtils]: 56: Hoare triple {470#false} [136] L703-1-->L703-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 2 v_~g~0_3) 1 0)) 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] {470#false} is VALID [2022-02-20 20:40:37,410 INFO L290 TraceCheckUtils]: 57: Hoare triple {470#false} [113] L703-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] {470#false} is VALID [2022-02-20 20:40:37,410 INFO L290 TraceCheckUtils]: 58: Hoare triple {470#false} [116] 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] {470#false} is VALID [2022-02-20 20:40:37,410 INFO L290 TraceCheckUtils]: 59: Hoare triple {470#false} [102] 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[] {470#false} is VALID [2022-02-20 20:40:37,410 INFO L290 TraceCheckUtils]: 60: Hoare triple {470#false} [120] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {470#false} is VALID [2022-02-20 20:40:37,411 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:37,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:37,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699691007] [2022-02-20 20:40:37,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699691007] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:37,411 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:37,411 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:40:37,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591991268] [2022-02-20 20:40:37,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:37,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 61 [2022-02-20 20:40:37,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:37,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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:37,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:37,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:40:37,449 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:37,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:40:37,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:40:37,450 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 79 [2022-02-20 20:40:37,451 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 57.166666666666664) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:37,451 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:37,451 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 79 [2022-02-20 20:40:37,451 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:37,542 INFO L129 PetriNetUnfolder]: 2/99 cut-off events. [2022-02-20 20:40:37,542 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-02-20 20:40:37,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 99 events. 2/99 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 109 event pairs, 0 based on Foata normal form. 3/102 useless extension candidates. Maximal degree in co-relation 91. Up to 16 conditions per place. [2022-02-20 20:40:37,551 INFO L132 encePairwiseOnDemand]: 73/79 looper letters, 19 selfloop transitions, 6 changer transitions 1/71 dead transitions. [2022-02-20 20:40:37,551 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 71 transitions, 218 flow [2022-02-20 20:40:37,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:40:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:40:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 298 transitions. [2022-02-20 20:40:37,555 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7544303797468355 [2022-02-20 20:40:37,555 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 298 transitions. [2022-02-20 20:40:37,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 298 transitions. [2022-02-20 20:40:37,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:37,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 298 transitions. [2022-02-20 20:40:37,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 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:37,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 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:37,557 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 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:37,557 INFO L186 Difference]: Start difference. First operand has 77 places, 68 transitions, 156 flow. Second operand 5 states and 298 transitions. [2022-02-20 20:40:37,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 71 transitions, 218 flow [2022-02-20 20:40:37,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 71 transitions, 209 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-02-20 20:40:37,561 INFO L242 Difference]: Finished difference. Result has 79 places, 69 transitions, 169 flow [2022-02-20 20:40:37,561 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2022-02-20 20:40:37,562 INFO L334 CegarLoopForPetriNet]: 72 programPoint places, 7 predicate places. [2022-02-20 20:40:37,562 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 69 transitions, 169 flow [2022-02-20 20:40:37,573 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 157 states, 153 states have (on average 1.477124183006536) internal successors, (226), 156 states have internal predecessors, (226), 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:37,574 INFO L78 Accepts]: Start accepts. Automaton has has 157 states, 153 states have (on average 1.477124183006536) internal successors, (226), 156 states have internal predecessors, (226), 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 61 [2022-02-20 20:40:37,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:37,574 INFO L470 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 169 flow [2022-02-20 20:40:37,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.166666666666664) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:37,575 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:37,575 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:37,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:40:37,575 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:37,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:37,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1438548197, now seen corresponding path program 1 times [2022-02-20 20:40:37,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:37,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710758809] [2022-02-20 20:40:37,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:37,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:37,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {639#true} [140] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {639#true} is VALID [2022-02-20 20:40:37,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {639#true} [126] 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] {639#true} is VALID [2022-02-20 20:40:37,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {639#true} [148] 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[] {639#true} is VALID [2022-02-20 20:40:37,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {639#true} [151] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {639#true} is VALID [2022-02-20 20:40:37,730 INFO L290 TraceCheckUtils]: 4: Hoare triple {639#true} [108] 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[] {639#true} is VALID [2022-02-20 20:40:37,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {639#true} [141] 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[] {639#true} is VALID [2022-02-20 20:40:37,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {639#true} [130] 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[] {639#true} is VALID [2022-02-20 20:40:37,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {639#true} [133] L18-3-->L18-4: Formula: (and (= 41 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {639#true} is VALID [2022-02-20 20:40:37,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {639#true} [134] L18-4-->L682: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {639#true} is VALID [2022-02-20 20:40:37,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {639#true} [89] L682-->L682-1: Formula: (and (= 3 |v_~#C~0.base_1|) (= |v_~#C~0.offset_1| 0)) InVars {} OutVars{~#C~0.base=|v_~#C~0.base_1|, ~#C~0.offset=|v_~#C~0.offset_1|} AuxVars[] AssignedVars[~#C~0.base, ~#C~0.offset] {641#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {641#(<= |~#C~0.base| 3)} [109] 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[] {641#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {641#(<= |~#C~0.base| 3)} [94] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#C~0.base_2|) |v_~#C~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#C~0.base=|v_~#C~0.base_2|, ~#C~0.offset=|v_~#C~0.offset_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#C~0.base=|v_~#C~0.base_2|, ~#C~0.offset=|v_~#C~0.offset_2|} AuxVars[] AssignedVars[] {641#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {641#(<= |~#C~0.base| 3)} [150] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#C~0.base_3|) (+ |v_~#C~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#C~0.base=|v_~#C~0.base_3|, ~#C~0.offset=|v_~#C~0.offset_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#C~0.base=|v_~#C~0.base_3|, ~#C~0.offset=|v_~#C~0.offset_3|} AuxVars[] AssignedVars[] {641#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {641#(<= |~#C~0.base| 3)} [122] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#C~0.base_4|) (+ |v_~#C~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#C~0.base=|v_~#C~0.base_4|, ~#C~0.offset=|v_~#C~0.offset_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#C~0.base=|v_~#C~0.base_4|, ~#C~0.offset=|v_~#C~0.offset_4|} AuxVars[] AssignedVars[] {641#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {641#(<= |~#C~0.base| 3)} [155] L682-5-->L682-6: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_6| |v_~#C~0.base_5|) (+ |v_~#C~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_6|, ~#C~0.base=|v_~#C~0.base_5|, ~#C~0.offset=|v_~#C~0.offset_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#C~0.base=|v_~#C~0.base_5|, ~#C~0.offset=|v_~#C~0.offset_5|} AuxVars[] AssignedVars[] {641#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {641#(<= |~#C~0.base| 3)} [100] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#C~0.base_6|) (+ |v_~#C~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#C~0.base=|v_~#C~0.base_6|, ~#C~0.offset=|v_~#C~0.offset_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#C~0.base=|v_~#C~0.base_6|, ~#C~0.offset=|v_~#C~0.offset_6|} AuxVars[] AssignedVars[] {641#(<= |~#C~0.base| 3)} is VALID [2022-02-20 20:40:37,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {641#(<= |~#C~0.base| 3)} [144] L682-7-->L683: Formula: (and (= |v_~#D~0.offset_1| 0) (= |v_~#D~0.base_1| 4)) InVars {} OutVars{~#D~0.offset=|v_~#D~0.offset_1|, ~#D~0.base=|v_~#D~0.base_1|} AuxVars[] AssignedVars[~#D~0.base, ~#D~0.offset] {642#(and (not (= |~#C~0.base| |~#D~0.base|)) (<= |~#D~0.base| 4))} is VALID [2022-02-20 20:40:37,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {642#(and (not (= |~#C~0.base| |~#D~0.base|)) (<= |~#D~0.base| 4))} [96] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {642#(and (not (= |~#C~0.base| |~#D~0.base|)) (<= |~#D~0.base| 4))} is VALID [2022-02-20 20:40:37,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {642#(and (not (= |~#C~0.base| |~#D~0.base|)) (<= |~#D~0.base| 4))} [139] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#D~0.base_2|) |v_~#D~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#D~0.base=|v_~#D~0.base_2|, ~#D~0.offset=|v_~#D~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#D~0.base=|v_~#D~0.base_2|, ~#D~0.offset=|v_~#D~0.offset_2|} AuxVars[] AssignedVars[] {642#(and (not (= |~#C~0.base| |~#D~0.base|)) (<= |~#D~0.base| 4))} is VALID [2022-02-20 20:40:37,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {642#(and (not (= |~#C~0.base| |~#D~0.base|)) (<= |~#D~0.base| 4))} [125] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_9| |v_~#D~0.base_3|) (+ |v_~#D~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#D~0.base=|v_~#D~0.base_3|, ~#D~0.offset=|v_~#D~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#D~0.base=|v_~#D~0.base_3|, ~#D~0.offset=|v_~#D~0.offset_3|} AuxVars[] AssignedVars[] {642#(and (not (= |~#C~0.base| |~#D~0.base|)) (<= |~#D~0.base| 4))} is VALID [2022-02-20 20:40:37,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {642#(and (not (= |~#C~0.base| |~#D~0.base|)) (<= |~#D~0.base| 4))} [145] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#D~0.base_4|) (+ |v_~#D~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#D~0.base=|v_~#D~0.base_4|, ~#D~0.offset=|v_~#D~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#D~0.base=|v_~#D~0.base_4|, ~#D~0.offset=|v_~#D~0.offset_4|} AuxVars[] AssignedVars[] {642#(and (not (= |~#C~0.base| |~#D~0.base|)) (<= |~#D~0.base| 4))} is VALID [2022-02-20 20:40:37,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {642#(and (not (= |~#C~0.base| |~#D~0.base|)) (<= |~#D~0.base| 4))} [88] L683-4-->L683-5: Formula: (= (select (select |v_#memory_int_11| |v_~#D~0.base_5|) (+ |v_~#D~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_11|, ~#D~0.base=|v_~#D~0.base_5|, ~#D~0.offset=|v_~#D~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#D~0.base=|v_~#D~0.base_5|, ~#D~0.offset=|v_~#D~0.offset_5|} AuxVars[] AssignedVars[] {642#(and (not (= |~#C~0.base| |~#D~0.base|)) (<= |~#D~0.base| 4))} is VALID [2022-02-20 20:40:37,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {642#(and (not (= |~#C~0.base| |~#D~0.base|)) (<= |~#D~0.base| 4))} [146] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#D~0.base_6|) (+ |v_~#D~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#D~0.base=|v_~#D~0.base_6|, ~#D~0.offset=|v_~#D~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#D~0.base=|v_~#D~0.base_6|, ~#D~0.offset=|v_~#D~0.offset_6|} AuxVars[] AssignedVars[] {642#(and (not (= |~#C~0.base| |~#D~0.base|)) (<= |~#D~0.base| 4))} is VALID [2022-02-20 20:40:37,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {642#(and (not (= |~#C~0.base| |~#D~0.base|)) (<= |~#D~0.base| 4))} [123] L683-6-->L684: Formula: (and (= 5 |v_~#E~0.base_1|) (= |v_~#E~0.offset_1| 0)) InVars {} OutVars{~#E~0.base=|v_~#E~0.base_1|, ~#E~0.offset=|v_~#E~0.offset_1|} AuxVars[] AssignedVars[~#E~0.offset, ~#E~0.base] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [90] L684-->L684-1: Formula: (and (= (select |v_#valid_6| 5) 1) (= 24 (select |v_#length_5| 5))) InVars {#length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [118] L684-1-->L684-2: Formula: (= (select (select |v_#memory_int_13| |v_~#E~0.base_2|) |v_~#E~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_13|, ~#E~0.base=|v_~#E~0.base_2|, ~#E~0.offset=|v_~#E~0.offset_2|} OutVars{#memory_int=|v_#memory_int_13|, ~#E~0.base=|v_~#E~0.base_2|, ~#E~0.offset=|v_~#E~0.offset_2|} AuxVars[] AssignedVars[] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [93] L684-2-->L684-3: Formula: (= (select (select |v_#memory_int_14| |v_~#E~0.base_3|) (+ |v_~#E~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_14|, ~#E~0.base=|v_~#E~0.base_3|, ~#E~0.offset=|v_~#E~0.offset_3|} OutVars{#memory_int=|v_#memory_int_14|, ~#E~0.base=|v_~#E~0.base_3|, ~#E~0.offset=|v_~#E~0.offset_3|} AuxVars[] AssignedVars[] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [159] L684-3-->L684-4: Formula: (= 0 (select (select |v_#memory_int_15| |v_~#E~0.base_4|) (+ |v_~#E~0.offset_4| 8))) InVars {#memory_int=|v_#memory_int_15|, ~#E~0.base=|v_~#E~0.base_4|, ~#E~0.offset=|v_~#E~0.offset_4|} OutVars{#memory_int=|v_#memory_int_15|, ~#E~0.base=|v_~#E~0.base_4|, ~#E~0.offset=|v_~#E~0.offset_4|} AuxVars[] AssignedVars[] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [157] L684-4-->L684-5: Formula: (= (select (select |v_#memory_int_16| |v_~#E~0.base_5|) (+ |v_~#E~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_16|, ~#E~0.base=|v_~#E~0.base_5|, ~#E~0.offset=|v_~#E~0.offset_5|} OutVars{#memory_int=|v_#memory_int_16|, ~#E~0.base=|v_~#E~0.base_5|, ~#E~0.offset=|v_~#E~0.offset_5|} AuxVars[] AssignedVars[] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [158] L684-5-->L684-6: Formula: (= (select (select |v_#memory_int_17| |v_~#E~0.base_6|) (+ |v_~#E~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_17|, ~#E~0.base=|v_~#E~0.base_6|, ~#E~0.offset=|v_~#E~0.offset_6|} OutVars{#memory_int=|v_#memory_int_17|, ~#E~0.base=|v_~#E~0.base_6|, ~#E~0.offset=|v_~#E~0.offset_6|} AuxVars[] AssignedVars[] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [137] L684-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [132] 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] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [98] L-1-5-->L696: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre4#1] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [135] L696-->L696-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#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_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [124] L696-1-->L697: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [117] L697-->L697-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [99] L697-1-->L697-2: Formula: (= |v_#memory_int_18| (store |v_#memory_int_19| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|))) InVars {#memory_int=|v_#memory_int_19|, 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~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{#memory_int=|v_#memory_int_18|, 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~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[#memory_int] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [177] L697-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#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~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_6|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [87] L697-3-->L697-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [110] L697-4-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,745 INFO L290 TraceCheckUtils]: 41: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [114] L698-->L698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#C~0.base_7|))) (and (= (select .cse0 |v_~#C~0.offset_7|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#C~0.base_7| (store .cse0 |v_~#C~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#C~0.base=|v_~#C~0.base_7|, ~#C~0.offset=|v_~#C~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#C~0.base=|v_~#C~0.base_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|, ~#C~0.offset=|v_~#C~0.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,745 INFO L290 TraceCheckUtils]: 42: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [112] L698-1-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,746 INFO L290 TraceCheckUtils]: 43: Hoare triple {643#(and (not (= |~#C~0.base| |~#D~0.base|)) (not (= |~#E~0.base| |~#D~0.base|)))} [128] L699-->L699-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#D~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet7#1_2| 0) (= (select .cse0 |v_~#D~0.offset_7|) 0) (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#D~0.base_7| (store .cse0 |v_~#D~0.offset_7| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#D~0.base=|v_~#D~0.base_7|, ~#D~0.offset=|v_~#D~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#D~0.base=|v_~#D~0.base_7|, ~#D~0.offset=|v_~#D~0.offset_7|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet7#1] {644#(and (not (= |~#C~0.base| |~#D~0.base|)) (= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {644#(and (not (= |~#C~0.base| |~#D~0.base|)) (= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1) (not (= |~#E~0.base| |~#D~0.base|)))} [101] L699-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {644#(and (not (= |~#C~0.base| |~#D~0.base|)) (= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,747 INFO L290 TraceCheckUtils]: 45: Hoare triple {644#(and (not (= |~#C~0.base| |~#D~0.base|)) (= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1) (not (= |~#E~0.base| |~#D~0.base|)))} [152] L700-->L701: Formula: (= 2 v_~g~0_2) InVars {} OutVars{~g~0=v_~g~0_2} AuxVars[] AssignedVars[~g~0] {644#(and (not (= |~#C~0.base| |~#D~0.base|)) (= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {644#(and (not (= |~#C~0.base| |~#D~0.base|)) (= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1) (not (= |~#E~0.base| |~#D~0.base|)))} [142] L701-->L702: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#C~0.base_8| (store (select |v_#pthreadsMutex_6| |v_~#C~0.base_8|) |v_~#C~0.offset_8| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#C~0.base=|v_~#C~0.base_8|, ~#C~0.offset=|v_~#C~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#C~0.base=|v_~#C~0.base_8|, ~#C~0.offset=|v_~#C~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex] {644#(and (not (= |~#C~0.base| |~#D~0.base|)) (= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {644#(and (not (= |~#C~0.base| |~#D~0.base|)) (= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1) (not (= |~#E~0.base| |~#D~0.base|)))} [163] t_funENTRY-->L686: 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] {644#(and (not (= |~#C~0.base| |~#D~0.base|)) (= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,748 INFO L290 TraceCheckUtils]: 48: Hoare triple {644#(and (not (= |~#C~0.base| |~#D~0.base|)) (= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1) (not (= |~#E~0.base| |~#D~0.base|)))} [164] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_10| |v_~#C~0.base_9|))) (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#C~0.base_9| (store .cse0 |v_~#C~0.offset_9| 1))) (= (select .cse0 |v_~#C~0.offset_9|) 0) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#C~0.base=|v_~#C~0.base_9|, ~#C~0.offset=|v_~#C~0.offset_9|} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|, #pthreadsMutex=|v_#pthreadsMutex_9|, ~#C~0.base=|v_~#C~0.base_9|, ~#C~0.offset=|v_~#C~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {645#(and (= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {645#(and (= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1) (not (= |~#E~0.base| |~#D~0.base|)))} [165] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {645#(and (= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1) (not (= |~#E~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:37,749 INFO L290 TraceCheckUtils]: 50: Hoare triple {645#(and (= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1) (not (= |~#E~0.base| |~#D~0.base|)))} [166] L687-->L687-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#E~0.base_8|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet2_1| 0) (= (select .cse0 |v_~#E~0.offset_8|) 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#E~0.base_8| (store .cse0 |v_~#E~0.offset_8| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#E~0.base=|v_~#E~0.base_8|, ~#E~0.offset=|v_~#E~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_11|, ~#E~0.base=|v_~#E~0.base_8|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_1|, ~#E~0.offset=|v_~#E~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2] {646#(= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1)} is VALID [2022-02-20 20:40:37,750 INFO L290 TraceCheckUtils]: 51: Hoare triple {646#(= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1)} [167] L687-1-->L688: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2] {646#(= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1)} is VALID [2022-02-20 20:40:37,750 INFO L290 TraceCheckUtils]: 52: Hoare triple {646#(= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1)} [168] L688-->L689: Formula: (= 42 v_~g~0_4) InVars {} OutVars{~g~0=v_~g~0_4} AuxVars[] AssignedVars[~g~0] {646#(= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1)} is VALID [2022-02-20 20:40:37,750 INFO L290 TraceCheckUtils]: 53: Hoare triple {646#(= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1)} [169] L689-->L689-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_14| |v_~#D~0.base_8|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet3_1| 0) (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#D~0.base_8| (store .cse0 |v_~#D~0.offset_8| 1))) (= (select .cse0 |v_~#D~0.offset_8|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#D~0.base=|v_~#D~0.base_8|, ~#D~0.offset=|v_~#D~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_13|, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_1|, ~#D~0.base=|v_~#D~0.base_8|, ~#D~0.offset=|v_~#D~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet3] {640#false} is VALID [2022-02-20 20:40:37,750 INFO L290 TraceCheckUtils]: 54: Hoare triple {640#false} [170] L689-1-->L690: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet3] {640#false} is VALID [2022-02-20 20:40:37,751 INFO L290 TraceCheckUtils]: 55: Hoare triple {640#false} [171] L690-->L691: Formula: (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#E~0.base_9| (store (select |v_#pthreadsMutex_16| |v_~#E~0.base_9|) |v_~#E~0.offset_9| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#E~0.base=|v_~#E~0.base_9|, ~#E~0.offset=|v_~#E~0.offset_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#E~0.base=|v_~#E~0.base_9|, ~#E~0.offset=|v_~#E~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex] {640#false} is VALID [2022-02-20 20:40:37,751 INFO L290 TraceCheckUtils]: 56: Hoare triple {640#false} [106] L702-->L702-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_8| |v_~#E~0.base_7|))) (and (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#E~0.base_7| (store .cse0 |v_~#E~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet8#1_2| 0) (= (select .cse0 |v_~#E~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#E~0.base=|v_~#E~0.base_7|, ~#E~0.offset=|v_~#E~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, ~#E~0.base=|v_~#E~0.base_7|, ~#E~0.offset=|v_~#E~0.offset_7|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet8#1] {640#false} is VALID [2022-02-20 20:40:37,751 INFO L290 TraceCheckUtils]: 57: Hoare triple {640#false} [115] L702-1-->L703: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {640#false} is VALID [2022-02-20 20:40:37,751 INFO L290 TraceCheckUtils]: 58: Hoare triple {640#false} [95] L703-->L703-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {640#false} is VALID [2022-02-20 20:40:37,751 INFO L290 TraceCheckUtils]: 59: Hoare triple {640#false} [136] L703-1-->L703-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 2 v_~g~0_3) 1 0)) 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] {640#false} is VALID [2022-02-20 20:40:37,751 INFO L290 TraceCheckUtils]: 60: Hoare triple {640#false} [113] L703-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] {640#false} is VALID [2022-02-20 20:40:37,752 INFO L290 TraceCheckUtils]: 61: Hoare triple {640#false} [116] 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] {640#false} is VALID [2022-02-20 20:40:37,752 INFO L290 TraceCheckUtils]: 62: Hoare triple {640#false} [102] 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[] {640#false} is VALID [2022-02-20 20:40:37,752 INFO L290 TraceCheckUtils]: 63: Hoare triple {640#false} [120] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {640#false} is VALID [2022-02-20 20:40:37,752 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:37,752 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:37,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710758809] [2022-02-20 20:40:37,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710758809] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:37,753 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:37,753 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:40:37,753 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717879890] [2022-02-20 20:40:37,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:37,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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 64 [2022-02-20 20:40:37,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:37,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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:37,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:37,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:40:37,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:37,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:40:37,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:40:37,808 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 79 [2022-02-20 20:40:37,809 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 169 flow. Second operand has 8 states, 8 states have (on average 51.375) internal successors, (411), 8 states have internal predecessors, (411), 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:37,809 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:37,809 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 79 [2022-02-20 20:40:37,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:37,975 INFO L129 PetriNetUnfolder]: 1/64 cut-off events. [2022-02-20 20:40:37,976 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-02-20 20:40:37,976 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 64 events. 1/64 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 1 based on Foata normal form. 1/65 useless extension candidates. Maximal degree in co-relation 42. Up to 10 conditions per place. [2022-02-20 20:40:37,976 INFO L132 encePairwiseOnDemand]: 74/79 looper letters, 0 selfloop transitions, 0 changer transitions 58/58 dead transitions. [2022-02-20 20:40:37,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 58 transitions, 194 flow [2022-02-20 20:40:37,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:40:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-02-20 20:40:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 316 transitions. [2022-02-20 20:40:37,980 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-02-20 20:40:37,980 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 316 transitions. [2022-02-20 20:40:37,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 316 transitions. [2022-02-20 20:40:37,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:37,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 316 transitions. [2022-02-20 20:40:37,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 52.666666666666664) internal successors, (316), 6 states have internal predecessors, (316), 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:37,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 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:37,982 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 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:37,982 INFO L186 Difference]: Start difference. First operand has 79 places, 69 transitions, 169 flow. Second operand 6 states and 316 transitions. [2022-02-20 20:40:37,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 58 transitions, 194 flow [2022-02-20 20:40:45,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 58 transitions, 186 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-02-20 20:40:45,713 INFO L242 Difference]: Finished difference. Result has 68 places, 0 transitions, 0 flow [2022-02-20 20:40:45,713 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=68, PETRI_TRANSITIONS=0} [2022-02-20 20:40:45,714 INFO L334 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2022-02-20 20:40:45,714 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 0 transitions, 0 flow [2022-02-20 20:40:45,714 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:45,714 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 64 [2022-02-20 20:40:45,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:45,714 INFO L470 AbstractCegarLoop]: Abstraction has has 68 places, 0 transitions, 0 flow [2022-02-20 20:40:45,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 51.375) internal successors, (411), 8 states have internal predecessors, (411), 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:45,717 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 20:40:45,717 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 2 remaining) [2022-02-20 20:40:45,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:40:45,719 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-02-20 20:40:45,720 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:40:45,721 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:40:45,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:40:45 BasicIcfg [2022-02-20 20:40:45,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:40:45,723 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:40:45,723 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:40:45,723 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:40:45,723 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:32" (3/4) ... [2022-02-20 20:40:45,725 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 20:40:45,728 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2022-02-20 20:40:45,730 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 20:40:45,731 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 20:40:45,731 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 20:40:45,731 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 20:40:45,750 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:40:45,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:40:45,752 INFO L158 Benchmark]: Toolchain (without parser) took 14199.81ms. Allocated memory was 90.2MB in the beginning and 310.4MB in the end (delta: 220.2MB). Free memory was 55.6MB in the beginning and 237.7MB in the end (delta: -182.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-02-20 20:40:45,752 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory was 45.0MB in the beginning and 45.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:45,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.45ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.4MB in the beginning and 73.7MB in the end (delta: -18.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 20:40:45,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.16ms. Allocated memory is still 109.1MB. Free memory was 73.4MB in the beginning and 71.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:45,753 INFO L158 Benchmark]: Boogie Preprocessor took 36.33ms. Allocated memory is still 109.1MB. Free memory was 71.3MB in the beginning and 69.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:45,753 INFO L158 Benchmark]: RCFGBuilder took 393.56ms. Allocated memory is still 109.1MB. Free memory was 69.9MB in the beginning and 84.3MB in the end (delta: -14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 20:40:45,753 INFO L158 Benchmark]: TraceAbstraction took 13306.30ms. Allocated memory was 109.1MB in the beginning and 310.4MB in the end (delta: 201.3MB). Free memory was 83.5MB in the beginning and 240.9MB in the end (delta: -157.4MB). Peak memory consumption was 185.3MB. Max. memory is 16.1GB. [2022-02-20 20:40:45,753 INFO L158 Benchmark]: Witness Printer took 27.87ms. Allocated memory is still 310.4MB. Free memory was 239.8MB in the beginning and 237.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:45,755 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory was 45.0MB in the beginning and 45.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.45ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.4MB in the beginning and 73.7MB in the end (delta: -18.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.16ms. Allocated memory is still 109.1MB. Free memory was 73.4MB in the beginning and 71.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.33ms. Allocated memory is still 109.1MB. Free memory was 71.3MB in the beginning and 69.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 393.56ms. Allocated memory is still 109.1MB. Free memory was 69.9MB in the beginning and 84.3MB in the end (delta: -14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13306.30ms. Allocated memory was 109.1MB in the beginning and 310.4MB in the end (delta: 201.3MB). Free memory was 83.5MB in the beginning and 240.9MB in the end (delta: -157.4MB). Peak memory consumption was 185.3MB. Max. memory is 16.1GB. * Witness Printer took 27.87ms. Allocated memory is still 310.4MB. Free memory was 239.8MB in the beginning and 237.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 94 locations, 2 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: 13.2s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 204 IncrementalHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 18 mSDtfsCounter, 204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=3, InterpolantAutomatonStates: 23, 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.5s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 853 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 20:40:45,778 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