./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_42-traces-ex-mini_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_42-traces-ex-mini_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 a1b66927274f90f2d29b42a27dd6906879a79472ec3d29ac0ef54d445fc2204b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:40:48,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:40:48,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:40:48,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:40:48,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:40:48,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:40:48,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:40:48,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:40:48,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:40:48,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:40:48,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:40:48,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:40:48,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:40:48,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:40:48,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:40:48,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:40:48,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:40:48,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:40:48,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:40:48,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:40:48,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:40:48,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:40:48,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:40:48,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:40:48,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:40:48,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:40:48,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:40:48,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:40:48,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:40:48,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:40:48,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:40:48,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:40:48,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:40:48,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:40:48,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:40:48,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:40:48,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:40:48,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:40:48,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:40:48,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:40:48,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:40:48,923 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:48,950 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:40:48,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:40:48,951 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:40:48,951 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:40:48,952 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:40:48,952 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:40:48,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:40:48,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:40:48,953 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:40:48,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:40:48,953 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:40:48,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:40:48,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:40:48,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:40:48,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:40:48,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:40:48,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:40:48,954 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:40:48,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:40:48,955 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:40:48,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:40:48,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:40:48,955 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:40:48,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:40:48,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:48,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:40:48,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:40:48,956 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:40:48,956 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:40:48,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:40:48,956 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:40:48,956 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:40:48,957 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:40:48,957 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 -> a1b66927274f90f2d29b42a27dd6906879a79472ec3d29ac0ef54d445fc2204b [2022-02-20 20:40:49,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:40:49,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:40:49,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:40:49,202 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:40:49,203 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:40:49,204 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_42-traces-ex-mini_true.i [2022-02-20 20:40:49,257 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a6294b90/a6ea3c08b1984c33adcfa4f5054d317a/FLAG42ea408cb [2022-02-20 20:40:49,707 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:40:49,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_42-traces-ex-mini_true.i [2022-02-20 20:40:49,731 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a6294b90/a6ea3c08b1984c33adcfa4f5054d317a/FLAG42ea408cb [2022-02-20 20:40:50,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a6294b90/a6ea3c08b1984c33adcfa4f5054d317a [2022-02-20 20:40:50,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:40:50,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:40:50,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:50,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:40:50,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:40:50,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:50" (1/1) ... [2022-02-20 20:40:50,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70564f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:50, skipping insertion in model container [2022-02-20 20:40:50,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:50" (1/1) ... [2022-02-20 20:40:50,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:40:50,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:40:50,407 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_42-traces-ex-mini_true.i[1091,1104] [2022-02-20 20:40:50,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:50,557 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:40:50,565 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_42-traces-ex-mini_true.i[1091,1104] [2022-02-20 20:40:50,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:50,633 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:40:50,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:50 WrapperNode [2022-02-20 20:40:50,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:50,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:50,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:40:50,634 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:40:50,639 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:50" (1/1) ... [2022-02-20 20:40:50,661 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:50" (1/1) ... [2022-02-20 20:40:50,684 INFO L137 Inliner]: procedures = 162, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2022-02-20 20:40:50,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:50,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:40:50,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:40:50,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:40:50,689 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:50" (1/1) ... [2022-02-20 20:40:50,690 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:50" (1/1) ... [2022-02-20 20:40:50,696 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:50" (1/1) ... [2022-02-20 20:40:50,696 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:50" (1/1) ... [2022-02-20 20:40:50,708 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:50" (1/1) ... [2022-02-20 20:40:50,710 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:50" (1/1) ... [2022-02-20 20:40:50,713 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:50" (1/1) ... [2022-02-20 20:40:50,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:40:50,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:40:50,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:40:50,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:40:50,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:50" (1/1) ... [2022-02-20 20:40:50,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:50,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:40:50,742 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:50,776 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:50,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:40:50,801 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:40:50,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:40:50,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:40:50,802 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-20 20:40:50,802 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-20 20:40:50,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:40:50,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:40:50,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:40:50,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:40:50,803 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:50,903 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:40:50,904 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:40:51,017 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:40:51,022 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:40:51,022 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:40:51,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:51 BoogieIcfgContainer [2022-02-20 20:40:51,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:40:51,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:40:51,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:40:51,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:40:51,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:40:50" (1/3) ... [2022-02-20 20:40:51,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a79d674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:51, skipping insertion in model container [2022-02-20 20:40:51,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:50" (2/3) ... [2022-02-20 20:40:51,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a79d674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:51, skipping insertion in model container [2022-02-20 20:40:51,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:51" (3/3) ... [2022-02-20 20:40:51,029 INFO L111 eAbstractionObserver]: Analyzing ICFG 13-privatized_42-traces-ex-mini_true.i [2022-02-20 20:40:51,032 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:40:51,032 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:40:51,032 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:40:51,032 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:40:51,078 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:51,078 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:51,078 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,079 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,079 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:51,079 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:51,079 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,079 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,080 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,080 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,081 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,081 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,081 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,081 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,103 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,103 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,104 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,104 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,104 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,105 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,107 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,108 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,108 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,108 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,108 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,108 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:51,110 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:40:51,170 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:40:51,175 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:51,175 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:40:51,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 78 transitions, 161 flow [2022-02-20 20:40:51,217 INFO L129 PetriNetUnfolder]: 1/77 cut-off events. [2022-02-20 20:40:51,218 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:51,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 77 events. 1/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2022-02-20 20:40:51,220 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 78 transitions, 161 flow [2022-02-20 20:40:51,222 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 64 transitions, 131 flow [2022-02-20 20:40:51,236 INFO L129 PetriNetUnfolder]: 0/63 cut-off events. [2022-02-20 20:40:51,239 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:51,239 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:51,240 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] [2022-02-20 20:40:51,240 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:51,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:51,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1063551480, now seen corresponding path program 1 times [2022-02-20 20:40:51,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:51,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399204025] [2022-02-20 20:40:51,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:51,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:51,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {84#true} [136] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {84#true} is VALID [2022-02-20 20:40:51,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {84#true} [121] 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] {84#true} is VALID [2022-02-20 20:40:51,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {84#true} [144] 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[] {84#true} is VALID [2022-02-20 20:40:51,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {84#true} [147] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {84#true} is VALID [2022-02-20 20:40:51,592 INFO L290 TraceCheckUtils]: 4: Hoare triple {84#true} [104] 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[] {84#true} is VALID [2022-02-20 20:40:51,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {84#true} [137] 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[] {84#true} is VALID [2022-02-20 20:40:51,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {84#true} [126] 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[] {84#true} is VALID [2022-02-20 20:40:51,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {84#true} [129] L18-3-->L18-4: Formula: (and (= 39 (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[] {84#true} is VALID [2022-02-20 20:40:51,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {84#true} [130] L18-4-->L682: Formula: (= 17 v_~g~0_1) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {86#(= ~g~0 17)} [86] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {86#(= ~g~0 17)} [105] 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[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {86#(= ~g~0 17)} [91] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {86#(= ~g~0 17)} [146] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {86#(= ~g~0 17)} [116] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {86#(= ~g~0 17)} [152] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {86#(= ~g~0 17)} [97] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {86#(= ~g~0 17)} [140] L682-7-->L683: Formula: (and (= 4 |v_~#B~0.base_1|) (= |v_~#B~0.offset_1| 0)) InVars {} OutVars{~#B~0.base=|v_~#B~0.base_1|, ~#B~0.offset=|v_~#B~0.offset_1|} AuxVars[] AssignedVars[~#B~0.base, ~#B~0.offset] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {86#(= ~g~0 17)} [93] 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[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {86#(= ~g~0 17)} [135] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#B~0.base_2|) |v_~#B~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} AuxVars[] AssignedVars[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {86#(= ~g~0 17)} [119] L683-2-->L683-3: Formula: (= 0 (select (select |v_#memory_int_9| |v_~#B~0.base_3|) (+ |v_~#B~0.offset_3| 4))) InVars {#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} AuxVars[] AssignedVars[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {86#(= ~g~0 17)} [141] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#B~0.base_4|) (+ |v_~#B~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} AuxVars[] AssignedVars[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {86#(= ~g~0 17)} [85] L683-4-->L683-5: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_11| |v_~#B~0.base_5|) (+ |v_~#B~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} AuxVars[] AssignedVars[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {86#(= ~g~0 17)} [142] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#B~0.base_6|) (+ |v_~#B~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} AuxVars[] AssignedVars[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {86#(= ~g~0 17)} [117] L683-6-->L684: Formula: (and (= 5 |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] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {86#(= ~g~0 17)} [87] 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[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {86#(= ~g~0 17)} [112] L684-1-->L684-2: Formula: (= (select (select |v_#memory_int_13| |v_~#C~0.base_2|) |v_~#C~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_13|, ~#C~0.base=|v_~#C~0.base_2|, ~#C~0.offset=|v_~#C~0.offset_2|} OutVars{#memory_int=|v_#memory_int_13|, ~#C~0.base=|v_~#C~0.base_2|, ~#C~0.offset=|v_~#C~0.offset_2|} AuxVars[] AssignedVars[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {86#(= ~g~0 17)} [90] L684-2-->L684-3: Formula: (= (select (select |v_#memory_int_14| |v_~#C~0.base_3|) (+ |v_~#C~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_14|, ~#C~0.base=|v_~#C~0.base_3|, ~#C~0.offset=|v_~#C~0.offset_3|} OutVars{#memory_int=|v_#memory_int_14|, ~#C~0.base=|v_~#C~0.base_3|, ~#C~0.offset=|v_~#C~0.offset_3|} AuxVars[] AssignedVars[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {86#(= ~g~0 17)} [157] L684-3-->L684-4: Formula: (= (select (select |v_#memory_int_15| |v_~#C~0.base_4|) (+ |v_~#C~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_15|, ~#C~0.base=|v_~#C~0.base_4|, ~#C~0.offset=|v_~#C~0.offset_4|} OutVars{#memory_int=|v_#memory_int_15|, ~#C~0.base=|v_~#C~0.base_4|, ~#C~0.offset=|v_~#C~0.offset_4|} AuxVars[] AssignedVars[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {86#(= ~g~0 17)} [155] L684-4-->L684-5: Formula: (= (select (select |v_#memory_int_16| |v_~#C~0.base_5|) (+ |v_~#C~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_16|, ~#C~0.base=|v_~#C~0.base_5|, ~#C~0.offset=|v_~#C~0.offset_5|} OutVars{#memory_int=|v_#memory_int_16|, ~#C~0.base=|v_~#C~0.base_5|, ~#C~0.offset=|v_~#C~0.offset_5|} AuxVars[] AssignedVars[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {86#(= ~g~0 17)} [156] L684-5-->L684-6: Formula: (= (select (select |v_#memory_int_17| |v_~#C~0.base_6|) (+ |v_~#C~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_17|, ~#C~0.base=|v_~#C~0.base_6|, ~#C~0.offset=|v_~#C~0.offset_6|} OutVars{#memory_int=|v_#memory_int_17|, ~#C~0.base=|v_~#C~0.base_6|, ~#C~0.offset=|v_~#C~0.offset_6|} AuxVars[] AssignedVars[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {86#(= ~g~0 17)} [133] L684-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {86#(= ~g~0 17)} [151] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {86#(= ~g~0 17)} [128] 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] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {86#(= ~g~0 17)} [95] L-1-5-->L695: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre3#1] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {86#(= ~g~0 17)} [149] L695-->L695-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] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {86#(= ~g~0 17)} [120] L695-1-->L696: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {86#(= ~g~0 17)} [131] L696-->L696-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {86#(= ~g~0 17)} [118] L696-1-->L696-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~pre3#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {86#(= ~g~0 17)} [173] L696-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {86#(= ~g~0 17)} [153] L696-3-->L696-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {86#(= ~g~0 17)} [132] L696-4-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {86#(= ~g~0 17)} [111] L697-->L697-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#A~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet5#1_2| 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))) (= (select .cse0 |v_~#A~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet5#1] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,621 INFO L290 TraceCheckUtils]: 42: Hoare triple {86#(= ~g~0 17)} [96] L697-1-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,621 INFO L290 TraceCheckUtils]: 43: Hoare triple {86#(= ~g~0 17)} [109] L698-->L698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#B~0.base_7|))) (and (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#B~0.base_7| (store .cse0 |v_~#B~0.offset_7| 1))) (= (select .cse0 |v_~#B~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {86#(= ~g~0 17)} [108] 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] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,622 INFO L290 TraceCheckUtils]: 45: Hoare triple {86#(= ~g~0 17)} [124] L699-->L699-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#C~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet7#1_2| 0) (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#C~0.base_7| (store .cse0 |v_~#C~0.offset_7| 1))) (= (select .cse0 |v_~#C~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#C~0.base=|v_~#C~0.base_7|, ~#C~0.offset=|v_~#C~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#C~0.base=|v_~#C~0.base_7|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ~#C~0.offset=|v_~#C~0.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet7#1] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,622 INFO L290 TraceCheckUtils]: 46: Hoare triple {86#(= ~g~0 17)} [98] 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] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,623 INFO L290 TraceCheckUtils]: 47: Hoare triple {86#(= ~g~0 17)} [148] L700-->L700-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#(= ~g~0 17)} is VALID [2022-02-20 20:40:51,623 INFO L290 TraceCheckUtils]: 48: Hoare triple {86#(= ~g~0 17)} [154] L700-1-->L700-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 17 v_~g~0_2) 1 0)) InVars {~g~0=v_~g~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {87#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:51,624 INFO L290 TraceCheckUtils]: 49: Hoare triple {87#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [106] L700-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] {87#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:51,624 INFO L290 TraceCheckUtils]: 50: Hoare triple {87#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [110] 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] {88#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:51,625 INFO L290 TraceCheckUtils]: 51: Hoare triple {88#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [100] 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[] {85#false} is VALID [2022-02-20 20:40:51,625 INFO L290 TraceCheckUtils]: 52: Hoare triple {85#false} [114] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85#false} is VALID [2022-02-20 20:40:51,626 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:51,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:51,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399204025] [2022-02-20 20:40:51,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399204025] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:51,628 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:51,628 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:40:51,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607094261] [2022-02-20 20:40:51,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:51,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2022-02-20 20:40:51,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:51,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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:51,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:51,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:40:51,696 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:51,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:40:51,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:40:51,729 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 78 [2022-02-20 20:40:51,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:51,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:51,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 78 [2022-02-20 20:40:51,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:51,795 INFO L129 PetriNetUnfolder]: 8/99 cut-off events. [2022-02-20 20:40:51,795 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:51,796 INFO L84 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 99 events. 8/99 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 148 event pairs, 0 based on Foata normal form. 3/101 useless extension candidates. Maximal degree in co-relation 87. Up to 10 conditions per place. [2022-02-20 20:40:51,797 INFO L132 encePairwiseOnDemand]: 72/78 looper letters, 8 selfloop transitions, 3 changer transitions 9/76 dead transitions. [2022-02-20 20:40:51,797 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 76 transitions, 195 flow [2022-02-20 20:40:51,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:40:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:40:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 491 transitions. [2022-02-20 20:40:51,812 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8992673992673993 [2022-02-20 20:40:51,813 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 491 transitions. [2022-02-20 20:40:51,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 491 transitions. [2022-02-20 20:40:51,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:51,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 491 transitions. [2022-02-20 20:40:51,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 70.14285714285714) internal successors, (491), 7 states have internal predecessors, (491), 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:51,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 78.0) internal successors, (624), 8 states have internal predecessors, (624), 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:51,822 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 78.0) internal successors, (624), 8 states have internal predecessors, (624), 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:51,823 INFO L186 Difference]: Start difference. First operand has 68 places, 64 transitions, 131 flow. Second operand 7 states and 491 transitions. [2022-02-20 20:40:51,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 76 transitions, 195 flow [2022-02-20 20:40:51,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 76 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:40:51,827 INFO L242 Difference]: Finished difference. Result has 78 places, 64 transitions, 149 flow [2022-02-20 20:40:51,828 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=149, PETRI_PLACES=78, PETRI_TRANSITIONS=64} [2022-02-20 20:40:51,831 INFO L334 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2022-02-20 20:40:51,831 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 64 transitions, 149 flow [2022-02-20 20:40:51,841 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 189 states, 187 states have (on average 1.6470588235294117) internal successors, (308), 188 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:51,842 INFO L78 Accepts]: Start accepts. Automaton has has 189 states, 187 states have (on average 1.6470588235294117) internal successors, (308), 188 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 20:40:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:51,843 INFO L470 AbstractCegarLoop]: Abstraction has has 78 places, 64 transitions, 149 flow [2022-02-20 20:40:51,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:51,843 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:51,843 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:51,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:40:51,844 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:51,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:51,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1855259157, now seen corresponding path program 1 times [2022-02-20 20:40:51,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:51,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333163996] [2022-02-20 20:40:51,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:51,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:51,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {291#true} [136] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {291#true} is VALID [2022-02-20 20:40:51,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#true} [121] 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] {291#true} is VALID [2022-02-20 20:40:51,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {291#true} [144] 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[] {291#true} is VALID [2022-02-20 20:40:51,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {291#true} [147] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {291#true} is VALID [2022-02-20 20:40:51,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {291#true} [104] 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[] {291#true} is VALID [2022-02-20 20:40:51,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {291#true} [137] 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[] {291#true} is VALID [2022-02-20 20:40:51,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {291#true} [126] 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[] {291#true} is VALID [2022-02-20 20:40:51,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#true} [129] L18-3-->L18-4: Formula: (and (= 39 (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[] {291#true} is VALID [2022-02-20 20:40:51,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {291#true} [130] L18-4-->L682: Formula: (= 17 v_~g~0_1) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {291#true} is VALID [2022-02-20 20:40:51,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {291#true} [86] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {293#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:51,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {293#(<= |~#A~0.base| 3)} [105] 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[] {293#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:51,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {293#(<= |~#A~0.base| 3)} [91] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {293#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:51,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {293#(<= |~#A~0.base| 3)} [146] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {293#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:51,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {293#(<= |~#A~0.base| 3)} [116] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {293#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:51,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {293#(<= |~#A~0.base| 3)} [152] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {293#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:51,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {293#(<= |~#A~0.base| 3)} [97] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {293#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:51,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {293#(<= |~#A~0.base| 3)} [140] L682-7-->L683: Formula: (and (= 4 |v_~#B~0.base_1|) (= |v_~#B~0.offset_1| 0)) InVars {} OutVars{~#B~0.base=|v_~#B~0.base_1|, ~#B~0.offset=|v_~#B~0.offset_1|} AuxVars[] AssignedVars[~#B~0.base, ~#B~0.offset] {294#(and (<= |~#B~0.base| 4) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:51,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {294#(and (<= |~#B~0.base| 4) (not (= |~#B~0.base| |~#A~0.base|)))} [93] 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[] {294#(and (<= |~#B~0.base| 4) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:51,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {294#(and (<= |~#B~0.base| 4) (not (= |~#B~0.base| |~#A~0.base|)))} [135] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#B~0.base_2|) |v_~#B~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} AuxVars[] AssignedVars[] {294#(and (<= |~#B~0.base| 4) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:51,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {294#(and (<= |~#B~0.base| 4) (not (= |~#B~0.base| |~#A~0.base|)))} [119] L683-2-->L683-3: Formula: (= 0 (select (select |v_#memory_int_9| |v_~#B~0.base_3|) (+ |v_~#B~0.offset_3| 4))) InVars {#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} AuxVars[] AssignedVars[] {294#(and (<= |~#B~0.base| 4) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:51,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {294#(and (<= |~#B~0.base| 4) (not (= |~#B~0.base| |~#A~0.base|)))} [141] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#B~0.base_4|) (+ |v_~#B~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} AuxVars[] AssignedVars[] {294#(and (<= |~#B~0.base| 4) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:51,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {294#(and (<= |~#B~0.base| 4) (not (= |~#B~0.base| |~#A~0.base|)))} [85] L683-4-->L683-5: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_11| |v_~#B~0.base_5|) (+ |v_~#B~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} AuxVars[] AssignedVars[] {294#(and (<= |~#B~0.base| 4) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:51,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {294#(and (<= |~#B~0.base| 4) (not (= |~#B~0.base| |~#A~0.base|)))} [142] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#B~0.base_6|) (+ |v_~#B~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} AuxVars[] AssignedVars[] {294#(and (<= |~#B~0.base| 4) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:51,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {294#(and (<= |~#B~0.base| 4) (not (= |~#B~0.base| |~#A~0.base|)))} [117] L683-6-->L684: Formula: (and (= 5 |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] {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:51,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [87] 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[] {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [112] L684-1-->L684-2: Formula: (= (select (select |v_#memory_int_13| |v_~#C~0.base_2|) |v_~#C~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_13|, ~#C~0.base=|v_~#C~0.base_2|, ~#C~0.offset=|v_~#C~0.offset_2|} OutVars{#memory_int=|v_#memory_int_13|, ~#C~0.base=|v_~#C~0.base_2|, ~#C~0.offset=|v_~#C~0.offset_2|} AuxVars[] AssignedVars[] {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [90] L684-2-->L684-3: Formula: (= (select (select |v_#memory_int_14| |v_~#C~0.base_3|) (+ |v_~#C~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_14|, ~#C~0.base=|v_~#C~0.base_3|, ~#C~0.offset=|v_~#C~0.offset_3|} OutVars{#memory_int=|v_#memory_int_14|, ~#C~0.base=|v_~#C~0.base_3|, ~#C~0.offset=|v_~#C~0.offset_3|} AuxVars[] AssignedVars[] {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [157] L684-3-->L684-4: Formula: (= (select (select |v_#memory_int_15| |v_~#C~0.base_4|) (+ |v_~#C~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_15|, ~#C~0.base=|v_~#C~0.base_4|, ~#C~0.offset=|v_~#C~0.offset_4|} OutVars{#memory_int=|v_#memory_int_15|, ~#C~0.base=|v_~#C~0.base_4|, ~#C~0.offset=|v_~#C~0.offset_4|} AuxVars[] AssignedVars[] {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,001 INFO L290 TraceCheckUtils]: 28: Hoare triple {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [155] L684-4-->L684-5: Formula: (= (select (select |v_#memory_int_16| |v_~#C~0.base_5|) (+ |v_~#C~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_16|, ~#C~0.base=|v_~#C~0.base_5|, ~#C~0.offset=|v_~#C~0.offset_5|} OutVars{#memory_int=|v_#memory_int_16|, ~#C~0.base=|v_~#C~0.base_5|, ~#C~0.offset=|v_~#C~0.offset_5|} AuxVars[] AssignedVars[] {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [156] L684-5-->L684-6: Formula: (= (select (select |v_#memory_int_17| |v_~#C~0.base_6|) (+ |v_~#C~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_17|, ~#C~0.base=|v_~#C~0.base_6|, ~#C~0.offset=|v_~#C~0.offset_6|} OutVars{#memory_int=|v_#memory_int_17|, ~#C~0.base=|v_~#C~0.base_6|, ~#C~0.offset=|v_~#C~0.offset_6|} AuxVars[] AssignedVars[] {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [133] L684-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,003 INFO L290 TraceCheckUtils]: 31: Hoare triple {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [151] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,003 INFO L290 TraceCheckUtils]: 32: Hoare triple {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [128] 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] {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [95] L-1-5-->L695: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre3#1] {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [149] L695-->L695-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] {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,005 INFO L290 TraceCheckUtils]: 35: Hoare triple {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [120] L695-1-->L696: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [131] L696-->L696-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [118] L696-1-->L696-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~pre3#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int] {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,007 INFO L290 TraceCheckUtils]: 38: Hoare triple {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [173] L696-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,007 INFO L290 TraceCheckUtils]: 39: Hoare triple {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [161] 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] {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {295#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [162] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#B~0.base_9|))) (and (= (select .cse0 |v_~#B~0.offset_9|) 0) (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#B~0.base_9| (store .cse0 |v_~#B~0.offset_9| 1))) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|, #pthreadsMutex=|v_#pthreadsMutex_15|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {296#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {296#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [163] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {296#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {296#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [164] L687-->L687-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_18| |v_~#C~0.base_10|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet2_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#C~0.base_10| (store .cse0 |v_~#C~0.offset_10| 1))) (= (select .cse0 |v_~#C~0.offset_10|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_18|, ~#C~0.base=|v_~#C~0.base_10|, ~#C~0.offset=|v_~#C~0.offset_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_1|, ~#C~0.base=|v_~#C~0.base_10|, ~#C~0.offset=|v_~#C~0.offset_10|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2] {296#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,010 INFO L290 TraceCheckUtils]: 43: Hoare triple {296#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [165] L687-1-->L688: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2] {296#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,010 INFO L290 TraceCheckUtils]: 44: Hoare triple {296#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [166] L688-->L689: Formula: (= 42 v_~g~0_4) InVars {} OutVars{~g~0=v_~g~0_4} AuxVars[] AssignedVars[~g~0] {296#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,011 INFO L290 TraceCheckUtils]: 45: Hoare triple {296#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [153] L696-3-->L696-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {296#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,011 INFO L290 TraceCheckUtils]: 46: Hoare triple {296#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [132] L696-4-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {296#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:52,012 INFO L290 TraceCheckUtils]: 47: Hoare triple {296#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [111] L697-->L697-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#A~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet5#1_2| 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))) (= (select .cse0 |v_~#A~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet5#1] {297#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} is VALID [2022-02-20 20:40:52,012 INFO L290 TraceCheckUtils]: 48: Hoare triple {297#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} [96] L697-1-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {297#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} is VALID [2022-02-20 20:40:52,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {297#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} [109] L698-->L698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#B~0.base_7|))) (and (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#B~0.base_7| (store .cse0 |v_~#B~0.offset_7| 1))) (= (select .cse0 |v_~#B~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {292#false} is VALID [2022-02-20 20:40:52,013 INFO L290 TraceCheckUtils]: 50: Hoare triple {292#false} [108] 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] {292#false} is VALID [2022-02-20 20:40:52,013 INFO L290 TraceCheckUtils]: 51: Hoare triple {292#false} [124] L699-->L699-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#C~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet7#1_2| 0) (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#C~0.base_7| (store .cse0 |v_~#C~0.offset_7| 1))) (= (select .cse0 |v_~#C~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#C~0.base=|v_~#C~0.base_7|, ~#C~0.offset=|v_~#C~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#C~0.base=|v_~#C~0.base_7|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ~#C~0.offset=|v_~#C~0.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet7#1] {292#false} is VALID [2022-02-20 20:40:52,014 INFO L290 TraceCheckUtils]: 52: Hoare triple {292#false} [98] 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] {292#false} is VALID [2022-02-20 20:40:52,014 INFO L290 TraceCheckUtils]: 53: Hoare triple {292#false} [148] L700-->L700-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#false} is VALID [2022-02-20 20:40:52,014 INFO L290 TraceCheckUtils]: 54: Hoare triple {292#false} [154] L700-1-->L700-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 17 v_~g~0_2) 1 0)) InVars {~g~0=v_~g~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {292#false} is VALID [2022-02-20 20:40:52,014 INFO L290 TraceCheckUtils]: 55: Hoare triple {292#false} [106] L700-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] {292#false} is VALID [2022-02-20 20:40:52,014 INFO L290 TraceCheckUtils]: 56: Hoare triple {292#false} [110] 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] {292#false} is VALID [2022-02-20 20:40:52,015 INFO L290 TraceCheckUtils]: 57: Hoare triple {292#false} [100] 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[] {292#false} is VALID [2022-02-20 20:40:52,015 INFO L290 TraceCheckUtils]: 58: Hoare triple {292#false} [114] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#false} is VALID [2022-02-20 20:40:52,016 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:52,016 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:52,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333163996] [2022-02-20 20:40:52,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333163996] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:52,016 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:52,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:40:52,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913134693] [2022-02-20 20:40:52,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:52,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-02-20 20:40:52,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:52,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:52,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:52,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:40:52,062 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:52,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:40:52,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:40:52,064 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 78 [2022-02-20 20:40:52,064 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 64 transitions, 149 flow. Second operand has 7 states, 7 states have (on average 50.42857142857143) internal successors, (353), 7 states have internal predecessors, (353), 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:52,065 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:52,065 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 78 [2022-02-20 20:40:52,065 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:52,236 INFO L129 PetriNetUnfolder]: 6/94 cut-off events. [2022-02-20 20:40:52,237 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-02-20 20:40:52,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 94 events. 6/94 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 2 based on Foata normal form. 4/98 useless extension candidates. Maximal degree in co-relation 146. Up to 15 conditions per place. [2022-02-20 20:40:52,237 INFO L132 encePairwiseOnDemand]: 72/78 looper letters, 21 selfloop transitions, 6 changer transitions 1/66 dead transitions. [2022-02-20 20:40:52,238 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 66 transitions, 209 flow [2022-02-20 20:40:52,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:40:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-02-20 20:40:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 312 transitions. [2022-02-20 20:40:52,241 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-02-20 20:40:52,241 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 312 transitions. [2022-02-20 20:40:52,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 312 transitions. [2022-02-20 20:40:52,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:52,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 312 transitions. [2022-02-20 20:40:52,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 52.0) internal successors, (312), 6 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:52,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 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:52,244 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 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:52,244 INFO L186 Difference]: Start difference. First operand has 78 places, 64 transitions, 149 flow. Second operand 6 states and 312 transitions. [2022-02-20 20:40:52,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 66 transitions, 209 flow [2022-02-20 20:40:52,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 66 transitions, 195 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-02-20 20:40:52,748 INFO L242 Difference]: Finished difference. Result has 73 places, 64 transitions, 147 flow [2022-02-20 20:40:52,748 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2022-02-20 20:40:52,749 INFO L334 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2022-02-20 20:40:52,749 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 64 transitions, 147 flow [2022-02-20 20:40:52,753 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 159 states, 156 states have (on average 1.5576923076923077) internal successors, (243), 158 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:52,754 INFO L78 Accepts]: Start accepts. Automaton has has 159 states, 156 states have (on average 1.5576923076923077) internal successors, (243), 158 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-02-20 20:40:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:52,755 INFO L470 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 147 flow [2022-02-20 20:40:52,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.42857142857143) internal successors, (353), 7 states have internal predecessors, (353), 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:52,755 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:52,755 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] [2022-02-20 20:40:52,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:40:52,756 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:52,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash -237159032, now seen corresponding path program 1 times [2022-02-20 20:40:52,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:52,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084536117] [2022-02-20 20:40:52,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:52,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:52,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {465#true} [136] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {465#true} is VALID [2022-02-20 20:40:52,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {465#true} [121] 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] {465#true} is VALID [2022-02-20 20:40:52,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {465#true} [144] 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[] {465#true} is VALID [2022-02-20 20:40:52,838 INFO L290 TraceCheckUtils]: 3: Hoare triple {465#true} [147] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {465#true} is VALID [2022-02-20 20:40:52,838 INFO L290 TraceCheckUtils]: 4: Hoare triple {465#true} [104] 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[] {465#true} is VALID [2022-02-20 20:40:52,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {465#true} [137] 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[] {465#true} is VALID [2022-02-20 20:40:52,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {465#true} [126] 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[] {465#true} is VALID [2022-02-20 20:40:52,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {465#true} [129] L18-3-->L18-4: Formula: (and (= 39 (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[] {465#true} is VALID [2022-02-20 20:40:52,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {465#true} [130] L18-4-->L682: Formula: (= 17 v_~g~0_1) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {465#true} is VALID [2022-02-20 20:40:52,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {465#true} [86] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {465#true} is VALID [2022-02-20 20:40:52,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {465#true} [105] 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[] {465#true} is VALID [2022-02-20 20:40:52,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {465#true} [91] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {465#true} is VALID [2022-02-20 20:40:52,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {465#true} [146] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {465#true} is VALID [2022-02-20 20:40:52,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {465#true} [116] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {465#true} is VALID [2022-02-20 20:40:52,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {465#true} [152] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {465#true} is VALID [2022-02-20 20:40:52,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {465#true} [97] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {465#true} is VALID [2022-02-20 20:40:52,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {465#true} [140] L682-7-->L683: Formula: (and (= 4 |v_~#B~0.base_1|) (= |v_~#B~0.offset_1| 0)) InVars {} OutVars{~#B~0.base=|v_~#B~0.base_1|, ~#B~0.offset=|v_~#B~0.offset_1|} AuxVars[] AssignedVars[~#B~0.base, ~#B~0.offset] {467#(<= |~#B~0.base| 4)} is VALID [2022-02-20 20:40:52,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {467#(<= |~#B~0.base| 4)} [93] 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[] {467#(<= |~#B~0.base| 4)} is VALID [2022-02-20 20:40:52,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {467#(<= |~#B~0.base| 4)} [135] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#B~0.base_2|) |v_~#B~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} AuxVars[] AssignedVars[] {467#(<= |~#B~0.base| 4)} is VALID [2022-02-20 20:40:52,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {467#(<= |~#B~0.base| 4)} [119] L683-2-->L683-3: Formula: (= 0 (select (select |v_#memory_int_9| |v_~#B~0.base_3|) (+ |v_~#B~0.offset_3| 4))) InVars {#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} AuxVars[] AssignedVars[] {467#(<= |~#B~0.base| 4)} is VALID [2022-02-20 20:40:52,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {467#(<= |~#B~0.base| 4)} [141] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#B~0.base_4|) (+ |v_~#B~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} AuxVars[] AssignedVars[] {467#(<= |~#B~0.base| 4)} is VALID [2022-02-20 20:40:52,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {467#(<= |~#B~0.base| 4)} [85] L683-4-->L683-5: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_11| |v_~#B~0.base_5|) (+ |v_~#B~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} AuxVars[] AssignedVars[] {467#(<= |~#B~0.base| 4)} is VALID [2022-02-20 20:40:52,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {467#(<= |~#B~0.base| 4)} [142] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#B~0.base_6|) (+ |v_~#B~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} AuxVars[] AssignedVars[] {467#(<= |~#B~0.base| 4)} is VALID [2022-02-20 20:40:52,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {467#(<= |~#B~0.base| 4)} [117] L683-6-->L684: Formula: (and (= 5 |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] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [87] 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[] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [112] L684-1-->L684-2: Formula: (= (select (select |v_#memory_int_13| |v_~#C~0.base_2|) |v_~#C~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_13|, ~#C~0.base=|v_~#C~0.base_2|, ~#C~0.offset=|v_~#C~0.offset_2|} OutVars{#memory_int=|v_#memory_int_13|, ~#C~0.base=|v_~#C~0.base_2|, ~#C~0.offset=|v_~#C~0.offset_2|} AuxVars[] AssignedVars[] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [90] L684-2-->L684-3: Formula: (= (select (select |v_#memory_int_14| |v_~#C~0.base_3|) (+ |v_~#C~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_14|, ~#C~0.base=|v_~#C~0.base_3|, ~#C~0.offset=|v_~#C~0.offset_3|} OutVars{#memory_int=|v_#memory_int_14|, ~#C~0.base=|v_~#C~0.base_3|, ~#C~0.offset=|v_~#C~0.offset_3|} AuxVars[] AssignedVars[] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [157] L684-3-->L684-4: Formula: (= (select (select |v_#memory_int_15| |v_~#C~0.base_4|) (+ |v_~#C~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_15|, ~#C~0.base=|v_~#C~0.base_4|, ~#C~0.offset=|v_~#C~0.offset_4|} OutVars{#memory_int=|v_#memory_int_15|, ~#C~0.base=|v_~#C~0.base_4|, ~#C~0.offset=|v_~#C~0.offset_4|} AuxVars[] AssignedVars[] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [155] L684-4-->L684-5: Formula: (= (select (select |v_#memory_int_16| |v_~#C~0.base_5|) (+ |v_~#C~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_16|, ~#C~0.base=|v_~#C~0.base_5|, ~#C~0.offset=|v_~#C~0.offset_5|} OutVars{#memory_int=|v_#memory_int_16|, ~#C~0.base=|v_~#C~0.base_5|, ~#C~0.offset=|v_~#C~0.offset_5|} AuxVars[] AssignedVars[] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,847 INFO L290 TraceCheckUtils]: 29: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [156] L684-5-->L684-6: Formula: (= (select (select |v_#memory_int_17| |v_~#C~0.base_6|) (+ |v_~#C~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_17|, ~#C~0.base=|v_~#C~0.base_6|, ~#C~0.offset=|v_~#C~0.offset_6|} OutVars{#memory_int=|v_#memory_int_17|, ~#C~0.base=|v_~#C~0.base_6|, ~#C~0.offset=|v_~#C~0.offset_6|} AuxVars[] AssignedVars[] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [133] L684-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [151] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [128] 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] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,848 INFO L290 TraceCheckUtils]: 33: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [95] L-1-5-->L695: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre3#1] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [149] L695-->L695-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] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [120] L695-1-->L696: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [131] L696-->L696-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,850 INFO L290 TraceCheckUtils]: 37: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [118] L696-1-->L696-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~pre3#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,850 INFO L290 TraceCheckUtils]: 38: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [173] L696-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,851 INFO L290 TraceCheckUtils]: 39: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [161] 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] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,851 INFO L290 TraceCheckUtils]: 40: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [153] L696-3-->L696-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,852 INFO L290 TraceCheckUtils]: 41: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [132] L696-4-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,852 INFO L290 TraceCheckUtils]: 42: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [111] L697-->L697-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#A~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet5#1_2| 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))) (= (select .cse0 |v_~#A~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet5#1] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,852 INFO L290 TraceCheckUtils]: 43: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [162] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#B~0.base_9|))) (and (= (select .cse0 |v_~#B~0.offset_9|) 0) (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#B~0.base_9| (store .cse0 |v_~#B~0.offset_9| 1))) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|, #pthreadsMutex=|v_#pthreadsMutex_15|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [163] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {468#(not (= |~#B~0.base| |~#C~0.base|))} is VALID [2022-02-20 20:40:52,853 INFO L290 TraceCheckUtils]: 45: Hoare triple {468#(not (= |~#B~0.base| |~#C~0.base|))} [164] L687-->L687-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_18| |v_~#C~0.base_10|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet2_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#C~0.base_10| (store .cse0 |v_~#C~0.offset_10| 1))) (= (select .cse0 |v_~#C~0.offset_10|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_18|, ~#C~0.base=|v_~#C~0.base_10|, ~#C~0.offset=|v_~#C~0.offset_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_1|, ~#C~0.base=|v_~#C~0.base_10|, ~#C~0.offset=|v_~#C~0.offset_10|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2] {469#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1))} is VALID [2022-02-20 20:40:52,854 INFO L290 TraceCheckUtils]: 46: Hoare triple {469#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1))} [165] L687-1-->L688: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2] {469#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1))} is VALID [2022-02-20 20:40:52,854 INFO L290 TraceCheckUtils]: 47: Hoare triple {469#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1))} [166] L688-->L689: Formula: (= 42 v_~g~0_4) InVars {} OutVars{~g~0=v_~g~0_4} AuxVars[] AssignedVars[~g~0] {469#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1))} is VALID [2022-02-20 20:40:52,855 INFO L290 TraceCheckUtils]: 48: Hoare triple {469#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1))} [167] L689-->L690: Formula: (= |v_#pthreadsMutex_19| (store |v_#pthreadsMutex_20| |v_~#B~0.base_10| (store (select |v_#pthreadsMutex_20| |v_~#B~0.base_10|) |v_~#B~0.offset_10| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_20|, ~#B~0.base=|v_~#B~0.base_10|, ~#B~0.offset=|v_~#B~0.offset_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_19|, ~#B~0.base=|v_~#B~0.base_10|, ~#B~0.offset=|v_~#B~0.offset_10|} AuxVars[] AssignedVars[#pthreadsMutex] {469#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1))} is VALID [2022-02-20 20:40:52,855 INFO L290 TraceCheckUtils]: 49: Hoare triple {469#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1))} [96] L697-1-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {469#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1))} is VALID [2022-02-20 20:40:52,856 INFO L290 TraceCheckUtils]: 50: Hoare triple {469#(and (not (= |~#B~0.base| |~#C~0.base|)) (= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1))} [109] L698-->L698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#B~0.base_7|))) (and (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#B~0.base_7| (store .cse0 |v_~#B~0.offset_7| 1))) (= (select .cse0 |v_~#B~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {470#(= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1)} is VALID [2022-02-20 20:40:52,856 INFO L290 TraceCheckUtils]: 51: Hoare triple {470#(= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1)} [108] 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] {470#(= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1)} is VALID [2022-02-20 20:40:52,857 INFO L290 TraceCheckUtils]: 52: Hoare triple {470#(= (select (select |#pthreadsMutex| |~#C~0.base|) |~#C~0.offset|) 1)} [124] L699-->L699-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#C~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet7#1_2| 0) (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#C~0.base_7| (store .cse0 |v_~#C~0.offset_7| 1))) (= (select .cse0 |v_~#C~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#C~0.base=|v_~#C~0.base_7|, ~#C~0.offset=|v_~#C~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#C~0.base=|v_~#C~0.base_7|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ~#C~0.offset=|v_~#C~0.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet7#1] {466#false} is VALID [2022-02-20 20:40:52,857 INFO L290 TraceCheckUtils]: 53: Hoare triple {466#false} [98] 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] {466#false} is VALID [2022-02-20 20:40:52,857 INFO L290 TraceCheckUtils]: 54: Hoare triple {466#false} [148] L700-->L700-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#false} is VALID [2022-02-20 20:40:52,857 INFO L290 TraceCheckUtils]: 55: Hoare triple {466#false} [154] L700-1-->L700-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 17 v_~g~0_2) 1 0)) InVars {~g~0=v_~g~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {466#false} is VALID [2022-02-20 20:40:52,858 INFO L290 TraceCheckUtils]: 56: Hoare triple {466#false} [106] L700-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] {466#false} is VALID [2022-02-20 20:40:52,858 INFO L290 TraceCheckUtils]: 57: Hoare triple {466#false} [110] 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] {466#false} is VALID [2022-02-20 20:40:52,858 INFO L290 TraceCheckUtils]: 58: Hoare triple {466#false} [100] 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[] {466#false} is VALID [2022-02-20 20:40:52,858 INFO L290 TraceCheckUtils]: 59: Hoare triple {466#false} [114] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#false} is VALID [2022-02-20 20:40:52,859 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:52,859 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:52,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084536117] [2022-02-20 20:40:52,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084536117] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:52,859 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:52,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:40:52,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602674181] [2022-02-20 20:40:52,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:52,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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 60 [2022-02-20 20:40:52,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:52,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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:52,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:52,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:40:52,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:52,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:40:52,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:40:52,898 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 78 [2022-02-20 20:40:52,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 147 flow. Second operand has 6 states, 6 states have (on average 56.166666666666664) internal successors, (337), 6 states have internal predecessors, (337), 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:52,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:52,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 78 [2022-02-20 20:40:52,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:52,975 INFO L129 PetriNetUnfolder]: 5/81 cut-off events. [2022-02-20 20:40:52,975 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-02-20 20:40:52,976 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 81 events. 5/81 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 2 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 70. Up to 17 conditions per place. [2022-02-20 20:40:52,976 INFO L132 encePairwiseOnDemand]: 73/78 looper letters, 0 selfloop transitions, 0 changer transitions 61/61 dead transitions. [2022-02-20 20:40:52,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 61 transitions, 185 flow [2022-02-20 20:40:52,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:40:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:40:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 288 transitions. [2022-02-20 20:40:52,979 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7384615384615385 [2022-02-20 20:40:52,979 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 288 transitions. [2022-02-20 20:40:52,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 288 transitions. [2022-02-20 20:40:52,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:52,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 288 transitions. [2022-02-20 20:40:52,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:52,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 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:52,981 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 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:52,981 INFO L186 Difference]: Start difference. First operand has 73 places, 64 transitions, 147 flow. Second operand 5 states and 288 transitions. [2022-02-20 20:40:52,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 61 transitions, 185 flow [2022-02-20 20:40:52,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 61 transitions, 173 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-02-20 20:40:52,983 INFO L242 Difference]: Finished difference. Result has 67 places, 0 transitions, 0 flow [2022-02-20 20:40:52,983 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=67, PETRI_TRANSITIONS=0} [2022-02-20 20:40:52,984 INFO L334 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2022-02-20 20:40:52,984 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 0 transitions, 0 flow [2022-02-20 20:40:52,984 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:52,984 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 60 [2022-02-20 20:40:52,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:52,984 INFO L470 AbstractCegarLoop]: Abstraction has has 67 places, 0 transitions, 0 flow [2022-02-20 20:40:52,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.166666666666664) internal successors, (337), 6 states have internal predecessors, (337), 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:52,987 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 20:40:52,987 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 2 remaining) [2022-02-20 20:40:52,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:40:52,990 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 20:40:52,991 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:40:52,991 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:40:52,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:40:52 BasicIcfg [2022-02-20 20:40:52,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:40:52,994 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:40:52,994 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:40:52,994 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:40:52,994 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:51" (3/4) ... [2022-02-20 20:40:52,996 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 20:40:53,000 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2022-02-20 20:40:53,002 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 20:40:53,002 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 20:40:53,002 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 20:40:53,002 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 20:40:53,023 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:40:53,024 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:40:53,024 INFO L158 Benchmark]: Toolchain (without parser) took 2787.37ms. Allocated memory was 94.4MB in the beginning and 155.2MB in the end (delta: 60.8MB). Free memory was 54.7MB in the beginning and 69.2MB in the end (delta: -14.5MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2022-02-20 20:40:53,025 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 94.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:53,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.54ms. Allocated memory is still 94.4MB. Free memory was 54.5MB in the beginning and 59.2MB in the end (delta: -4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 20:40:53,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.20ms. Allocated memory is still 94.4MB. Free memory was 59.2MB in the beginning and 56.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:53,026 INFO L158 Benchmark]: Boogie Preprocessor took 35.13ms. Allocated memory is still 94.4MB. Free memory was 56.9MB in the beginning and 55.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:53,026 INFO L158 Benchmark]: RCFGBuilder took 303.09ms. Allocated memory is still 94.4MB. Free memory was 55.3MB in the beginning and 42.5MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 20:40:53,026 INFO L158 Benchmark]: TraceAbstraction took 1968.95ms. Allocated memory was 94.4MB in the beginning and 155.2MB in the end (delta: 60.8MB). Free memory was 41.9MB in the beginning and 72.3MB in the end (delta: -30.4MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2022-02-20 20:40:53,026 INFO L158 Benchmark]: Witness Printer took 29.83ms. Allocated memory is still 155.2MB. Free memory was 72.3MB in the beginning and 69.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:53,028 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.18ms. Allocated memory is still 94.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.54ms. Allocated memory is still 94.4MB. Free memory was 54.5MB in the beginning and 59.2MB in the end (delta: -4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.20ms. Allocated memory is still 94.4MB. Free memory was 59.2MB in the beginning and 56.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.13ms. Allocated memory is still 94.4MB. Free memory was 56.9MB in the beginning and 55.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 303.09ms. Allocated memory is still 94.4MB. Free memory was 55.3MB in the beginning and 42.5MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1968.95ms. Allocated memory was 94.4MB in the beginning and 155.2MB in the end (delta: 60.8MB). Free memory was 41.9MB in the beginning and 72.3MB in the end (delta: -30.4MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * Witness Printer took 29.83ms. Allocated memory is still 155.2MB. Free memory was 72.3MB in the beginning and 69.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 91 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: 1.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 123 IncrementalHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 16 mSDtfsCounter, 123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=1, InterpolantAutomatonStates: 18, 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, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 20:40:53,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE