./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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/36-apron_22-traces-write-centered-vs-meet-mutex_true.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b8a2d8a35be535b4f8c573d98b12278b19043c6b0cec82927e2ac6d7dd36ebb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:12:21,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:12:21,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:12:21,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:12:21,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:12:21,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:12:21,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:12:21,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:12:21,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:12:21,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:12:21,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:12:21,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:12:21,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:12:21,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:12:21,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:12:21,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:12:21,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:12:21,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:12:21,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:12:21,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:12:21,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:12:21,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:12:21,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:12:21,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:12:21,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:12:21,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:12:21,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:12:21,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:12:21,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:12:21,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:12:21,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:12:21,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:12:21,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:12:21,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:12:21,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:12:21,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:12:21,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:12:21,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:12:21,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:12:21,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:12:21,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:12:21,246 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-02-21 03:12:21,275 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:12:21,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:12:21,276 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:12:21,276 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:12:21,277 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:12:21,277 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:12:21,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:12:21,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:12:21,278 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:12:21,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:12:21,279 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:12:21,280 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:12:21,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:12:21,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:12:21,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:12:21,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:12:21,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:12:21,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:12:21,281 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:12:21,281 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:12:21,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:12:21,282 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:12:21,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:12:21,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:12:21,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:12:21,282 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:12:21,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:12:21,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:12:21,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:12:21,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:12:21,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:12:21,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:12:21,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:12:21,284 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 ! overflow) ) 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 -> 7b8a2d8a35be535b4f8c573d98b12278b19043c6b0cec82927e2ac6d7dd36ebb [2022-02-21 03:12:21,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:12:21,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:12:21,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:12:21,552 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:12:21,552 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:12:21,553 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true.i [2022-02-21 03:12:21,604 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fff39014/70943d4975754c159fa6fd96e6324280/FLAG7d0afe243 [2022-02-21 03:12:22,004 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:12:22,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true.i [2022-02-21 03:12:22,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fff39014/70943d4975754c159fa6fd96e6324280/FLAG7d0afe243 [2022-02-21 03:12:22,032 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fff39014/70943d4975754c159fa6fd96e6324280 [2022-02-21 03:12:22,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:12:22,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:12:22,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:12:22,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:12:22,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:12:22,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:12:22" (1/1) ... [2022-02-21 03:12:22,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bc9e2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:12:22, skipping insertion in model container [2022-02-21 03:12:22,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:12:22" (1/1) ... [2022-02-21 03:12:22,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:12:22,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:12:22,243 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/36-apron_22-traces-write-centered-vs-meet-mutex_true.i[1107,1120] [2022-02-21 03:12:22,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:12:22,401 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:12:22,418 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/36-apron_22-traces-write-centered-vs-meet-mutex_true.i[1107,1120] [2022-02-21 03:12:22,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:12:22,514 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:12:22,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:12:22 WrapperNode [2022-02-21 03:12:22,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:12:22,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:12:22,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:12:22,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:12:22,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:12:22" (1/1) ... [2022-02-21 03:12:22,554 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:12:22" (1/1) ... [2022-02-21 03:12:22,590 INFO L137 Inliner]: procedures = 163, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2022-02-21 03:12:22,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:12:22,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:12:22,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:12:22,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:12:22,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:12:22" (1/1) ... [2022-02-21 03:12:22,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:12:22" (1/1) ... [2022-02-21 03:12:22,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:12:22" (1/1) ... [2022-02-21 03:12:22,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:12:22" (1/1) ... [2022-02-21 03:12:22,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:12:22" (1/1) ... [2022-02-21 03:12:22,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:12:22" (1/1) ... [2022-02-21 03:12:22,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:12:22" (1/1) ... [2022-02-21 03:12:22,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:12:22,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:12:22,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:12:22,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:12:22,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:12:22" (1/1) ... [2022-02-21 03:12:22,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:12:22,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:12:22,656 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-21 03:12:22,674 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-21 03:12:22,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:12:22,696 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-21 03:12:22,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:12:22,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:12:22,696 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-21 03:12:22,696 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-21 03:12:22,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:12:22,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:12:22,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:12:22,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:12:22,698 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-21 03:12:22,841 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:12:22,843 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:12:23,100 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:12:23,107 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:12:23,108 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:12:23,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:12:23 BoogieIcfgContainer [2022-02-21 03:12:23,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:12:23,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:12:23,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:12:23,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:12:23,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:12:22" (1/3) ... [2022-02-21 03:12:23,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5290ea74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:12:23, skipping insertion in model container [2022-02-21 03:12:23,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:12:22" (2/3) ... [2022-02-21 03:12:23,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5290ea74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:12:23, skipping insertion in model container [2022-02-21 03:12:23,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:12:23" (3/3) ... [2022-02-21 03:12:23,119 INFO L111 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true.i [2022-02-21 03:12:23,123 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-21 03:12:23,123 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:12:23,123 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-21 03:12:23,123 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-21 03:12:23,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~y~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~y~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~z~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~z~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,212 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,215 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,216 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,216 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,216 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,217 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,217 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,217 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~y~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~y~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~y~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,220 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~y~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,221 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,221 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,222 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,222 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,222 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,223 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,223 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,223 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,223 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,224 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,224 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,224 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,224 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,225 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,225 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,225 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,226 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~y~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,226 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,226 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,226 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~y~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,226 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,227 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,227 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,227 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,227 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,228 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,228 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,228 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,228 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,229 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,229 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,229 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,230 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,231 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,232 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,233 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,234 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,236 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,237 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,238 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,239 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,240 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,240 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~z~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,240 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~z~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,240 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~z~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,241 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,241 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,242 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~z~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,242 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,242 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,245 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,245 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,245 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,245 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,246 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,249 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,250 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,250 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,250 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,250 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,251 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~y~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,251 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~z~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,251 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,251 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,251 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,252 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,252 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,252 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,252 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,252 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-21 03:12:23,254 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-21 03:12:23,299 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:12:23,303 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=FINITE_AUTOMATA, 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-21 03:12:23,303 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-21 03:12:23,315 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-02-21 03:12:23,326 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 134 transitions, 273 flow [2022-02-21 03:12:23,328 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 134 transitions, 273 flow [2022-02-21 03:12:23,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 133 places, 134 transitions, 273 flow [2022-02-21 03:12:23,393 INFO L129 PetriNetUnfolder]: 4/137 cut-off events. [2022-02-21 03:12:23,394 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-21 03:12:23,398 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 137 events. 4/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-02-21 03:12:23,403 INFO L116 LiptonReduction]: Number of co-enabled transitions 3364 [2022-02-21 03:12:28,990 INFO L131 LiptonReduction]: Checked pairs total: 9929 [2022-02-21 03:12:28,991 INFO L133 LiptonReduction]: Total number of compositions: 135 [2022-02-21 03:12:28,998 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 34 transitions, 73 flow [2022-02-21 03:12:29,047 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 174 states, 164 states have (on average 2.1158536585365852) internal successors, (347), 173 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:12:29,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 164 states have (on average 2.1158536585365852) internal successors, (347), 173 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:12:29,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 03:12:29,054 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:12:29,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 03:12:29,055 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-21 03:12:29,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:12:29,063 INFO L85 PathProgramCache]: Analyzing trace with hash 15664268, now seen corresponding path program 1 times [2022-02-21 03:12:29,073 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:12:29,073 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32304174] [2022-02-21 03:12:29,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:12:29,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:12:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:12:29,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {484#true} [483] ULTIMATE.startENTRY-->L713-2: Formula: (let ((.cse1 (select |v_#memory_int_87| 1)) (.cse0 (select |v_#memory_int_87| |v_~#B~0.base_221|)) (.cse3 (select |v_#memory_int_87| |v_~#A~0.base_253|)) (.cse2 (select |v_#memory_int_87| |v_~#C~0.base_215|))) (and (= 4 |v_~#B~0.base_221|) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#id~0#1.base_120|) (= (select .cse0 |v_~#B~0.offset_221|) 0) (= (select .cse1 1) 0) (= (select |v_#valid_166| 1) 1) (= (select |v_#valid_166| 3) 1) (= |v_#NULL.base_12| 0) (= (select .cse0 (+ |v_~#B~0.offset_221| 16)) 0) (= 48 (select .cse1 0)) (= (select |v_#valid_166| 2) 1) (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select .cse0 (+ |v_~#B~0.offset_221| 12))) (= (select |v_#length_63| 3) 24) (< 0 (+ |v_ULTIMATE.start_main_~x~1#1_98| 1000)) (= (select .cse2 (+ 4 |v_~#C~0.offset_215|)) 0) (= |v_~#B~0.offset_221| 0) (= (select .cse3 (+ |v_~#A~0.offset_253| 16)) 0) (= 55 (select |v_#length_63| 2)) (= v_~h~0_70 0) (= |v_#memory_int_86| (store |v_#memory_int_87| |v_ULTIMATE.start_main_~#id~0#1.base_120| (store (select |v_#memory_int_87| |v_ULTIMATE.start_main_~#id~0#1.base_120|) |v_ULTIMATE.start_main_~#id~0#1.offset_72| |v_ULTIMATE.start_main_#t~pre8#1_55|))) (= (+ |v_#pthreadsForks_25| 1) |v_#pthreadsForks_24|) (= (select .cse2 (+ 8 |v_~#C~0.offset_215|)) 0) (= (select .cse2 |v_~#C~0.offset_215|) 0) (= |v_#valid_165| (store |v_#valid_166| |v_ULTIMATE.start_main_~#id~0#1.base_120| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_72| 0) (= (select |v_#valid_166| |v_ULTIMATE.start_main_~#id~0#1.base_120|) 0) (= |v_~#C~0.offset_215| 0) (= (select .cse2 (+ 12 |v_~#C~0.offset_215|)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) (<= |v_ULTIMATE.start_main_~x~1#1_98| 2147483647) (< 0 |v_#StackHeapBarrier_23|) (= (select |v_#length_63| 1) 2) (= (select .cse0 (+ |v_~#B~0.offset_221| 4)) 0) (= |v_~#A~0.offset_253| 0) (= (select |v_#length_63| 4) 24) (= (select |v_#valid_166| 4) 1) (= (select .cse0 (+ |v_~#B~0.offset_221| 8)) 0) (= (store |v_#length_63| |v_ULTIMATE.start_main_~#id~0#1.base_120| 4) |v_#length_62|) (= 5 |v_~#C~0.base_215|) (= |v_ULTIMATE.start_main_#t~pre8#1_55| |v_#pthreadsForks_25|) (= v_~g~0_40 0) (= (select .cse3 |v_~#A~0.offset_253|) 0) (= (select .cse3 (+ |v_~#A~0.offset_253| 8)) 0) (= v_~i~0_65 0) (= |v_#NULL.offset_12| 0) (= 3 |v_~#A~0.base_253|) (= (select .cse3 (+ |v_~#A~0.offset_253| 4)) 0) (= (select |v_#valid_166| 5) 1) (= (select |v_#length_63| 5) 24) (= (select .cse3 (+ |v_~#A~0.offset_253| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) (= (select |v_#valid_166| 0) 0) (= (select .cse2 (+ 16 |v_~#C~0.offset_215|)) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #pthreadsForks=|v_#pthreadsForks_25|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_87|, #length=|v_#length_63|} OutVars{~#B~0.base=|v_~#B~0.base_221|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_120|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_43|, ~h~0=v_~h~0_70, ~#C~0.base=|v_~#C~0.base_215|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_55|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_98|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_64|, #pthreadsForks=|v_#pthreadsForks_24|, ~#C~0.offset=|v_~#C~0.offset_215|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_54|, #length=|v_#length_62|, ~#A~0.base=|v_~#A~0.base_253|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_68|, ~i~0=v_~i~0_65, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_70|, ~g~0=v_~g~0_40, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_72|, ~#B~0.offset=|v_~#B~0.offset_221|, #NULL.base=|v_#NULL.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_68|, ~#A~0.offset=|v_~#A~0.offset_253|, #valid=|v_#valid_165|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_49|, #memory_int=|v_#memory_int_86|} AuxVars[] AssignedVars[~#B~0.base, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet9#1, ~h~0, ~#C~0.base, ULTIMATE.start_main_#t~pre8#1, #NULL.offset, ULTIMATE.start_main_~x~1#1, ULTIMATE.start_main_#t~nondet12#1, #pthreadsForks, ~#C~0.offset, ULTIMATE.start_main_#t~nondet13#1, #length, ~#A~0.base, ULTIMATE.start_main_#t~nondet10#1, ~i~0, ULTIMATE.start_main_#res#1, ~g~0, ULTIMATE.start_main_~#id~0#1.offset, ~#B~0.offset, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ~#A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int] {484#true} is VALID [2022-02-21 03:12:29,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#true} [350] L713-2-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_6|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_8|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_26|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_10|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, t_funThread1of1ForFork0_~z~0#1=|v_t_funThread1of1ForFork0_~z~0#1_8|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_8|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_6|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_14|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_8|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_26|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_~z~0#1, t_funThread1of1ForFork0_#t~nondet2#1, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_#t~nondet5#1] {484#true} is VALID [2022-02-21 03:12:29,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#true} [481] t_funENTRY-->L700: Formula: false InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_131|, #pthreadsMutex=|v_#pthreadsMutex_1112|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_249|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_63|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_29|, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_129|, t_funThread1of1ForFork0_~z~0#1=|v_t_funThread1of1ForFork0_~z~0#1_81|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_61|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_89|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_155|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_29|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_63|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_223|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_67|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet6#1, #pthreadsMutex, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_~z~0#1, t_funThread1of1ForFork0_#t~nondet2#1, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_#t~nondet5#1] {485#false} is VALID [2022-02-21 03:12:29,230 INFO L290 TraceCheckUtils]: 3: Hoare triple {485#false} [433] L700-->t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (not (<= 0 (+ 2147483679 |v_t_funThread1of1ForFork0_~x~0#1_81|))) (= (store |v_#pthreadsMutex_426| |v_~#B~0.base_97| (store (select |v_#pthreadsMutex_426| |v_~#B~0.base_97|) |v_~#B~0.offset_97| 0)) |v_#pthreadsMutex_425|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_426|, ~#B~0.base=|v_~#B~0.base_97|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_81|, ~#B~0.offset=|v_~#B~0.offset_97|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_425|, ~#B~0.base=|v_~#B~0.base_97|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_81|, ~#B~0.offset=|v_~#B~0.offset_97|} AuxVars[] AssignedVars[#pthreadsMutex] {485#false} is VALID [2022-02-21 03:12:29,231 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-21 03:12:29,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:12:29,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32304174] [2022-02-21 03:12:29,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32304174] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:12:29,232 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:12:29,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:12:29,234 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779035775] [2022-02-21 03:12:29,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:12:29,238 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-02-21 03:12:29,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:12:29,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-21 03:12:29,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:12:29,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 03:12:29,251 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:12:29,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:12:29,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:12:29,268 INFO L87 Difference]: Start difference. First operand has 174 states, 164 states have (on average 2.1158536585365852) internal successors, (347), 173 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-21 03:12:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:29,352 INFO L93 Difference]: Finished difference Result 174 states and 324 transitions. [2022-02-21 03:12:29,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:12:29,352 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-02-21 03:12:29,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:12:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-21 03:12:29,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2022-02-21 03:12:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-21 03:12:29,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2022-02-21 03:12:29,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 32 transitions. [2022-02-21 03:12:29,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:12:29,407 INFO L225 Difference]: With dead ends: 174 [2022-02-21 03:12:29,408 INFO L226 Difference]: Without dead ends: 160 [2022-02-21 03:12:29,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:12:29,411 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:12:29,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:12:29,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-02-21 03:12:29,437 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,438 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,439 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,439 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,439 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,439 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,439 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,440 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,440 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,440 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,440 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,440 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,441 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,441 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,441 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,442 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,442 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,442 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,442 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,442 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,443 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,443 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,443 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,443 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,443 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,444 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,444 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,444 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,444 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,444 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,445 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,445 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,445 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,445 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,446 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,446 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,446 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,446 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,446 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,447 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,447 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,447 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,447 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,447 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,448 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,448 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,448 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,448 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,448 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,449 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,449 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,449 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,449 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,449 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,450 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,450 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,450 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,450 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,450 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,451 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,451 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,451 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,451 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,451 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,452 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,452 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,452 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,452 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,452 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,453 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,453 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,453 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,453 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,453 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,454 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,454 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,454 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,454 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,454 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,455 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,455 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,455 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,455 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,455 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,456 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,456 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,456 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,456 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,456 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,457 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,457 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,457 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,457 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,457 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,458 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,458 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,458 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,458 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,458 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,459 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,459 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,459 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,459 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,459 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,459 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,459 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,460 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,460 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,460 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,460 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,460 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,460 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,460 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,461 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,461 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,461 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,461 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,461 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,461 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,462 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,462 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,462 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,462 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,462 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,463 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,463 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,463 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,463 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,464 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,464 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,464 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,464 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,464 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,464 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,465 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,465 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,465 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,465 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,465 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,466 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,466 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,466 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,466 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,466 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,467 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,467 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,467 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,467 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,467 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,468 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,468 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,468 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,468 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,468 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,469 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,469 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,469 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,470 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,470 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,470 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-02-21 03:12:29,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:12:29,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 160 states, 152 states have (on average 1.9407894736842106) internal successors, (295), 159 states have internal predecessors, (295), 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-21 03:12:29,474 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 160 states, 152 states have (on average 1.9407894736842106) internal successors, (295), 159 states have internal predecessors, (295), 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-21 03:12:29,475 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 160 states, 152 states have (on average 1.9407894736842106) internal successors, (295), 159 states have internal predecessors, (295), 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-21 03:12:29,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:29,485 INFO L93 Difference]: Finished difference Result 160 states and 295 transitions. [2022-02-21 03:12:29,485 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 295 transitions. [2022-02-21 03:12:29,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:12:29,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:12:29,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 152 states have (on average 1.9407894736842106) internal successors, (295), 159 states have internal predecessors, (295), 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) Second operand 160 states. [2022-02-21 03:12:29,488 INFO L87 Difference]: Start difference. First operand has 160 states, 152 states have (on average 1.9407894736842106) internal successors, (295), 159 states have internal predecessors, (295), 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) Second operand 160 states. [2022-02-21 03:12:29,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:29,497 INFO L93 Difference]: Finished difference Result 160 states and 295 transitions. [2022-02-21 03:12:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 295 transitions. [2022-02-21 03:12:29,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:12:29,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:12:29,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:12:29,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:12:29,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 152 states have (on average 1.9407894736842106) internal successors, (295), 159 states have internal predecessors, (295), 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-21 03:12:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 295 transitions. [2022-02-21 03:12:29,509 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 295 transitions. Word has length 4 [2022-02-21 03:12:29,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:12:29,510 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 295 transitions. [2022-02-21 03:12:29,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-21 03:12:29,510 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 295 transitions. [2022-02-21 03:12:29,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:12:29,511 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:12:29,511 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:12:29,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:12:29,512 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-21 03:12:29,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:12:29,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2128326776, now seen corresponding path program 1 times [2022-02-21 03:12:29,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:12:29,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499386441] [2022-02-21 03:12:29,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:12:29,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:12:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:12:29,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {1302#true} [483] ULTIMATE.startENTRY-->L713-2: Formula: (let ((.cse1 (select |v_#memory_int_87| 1)) (.cse0 (select |v_#memory_int_87| |v_~#B~0.base_221|)) (.cse3 (select |v_#memory_int_87| |v_~#A~0.base_253|)) (.cse2 (select |v_#memory_int_87| |v_~#C~0.base_215|))) (and (= 4 |v_~#B~0.base_221|) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#id~0#1.base_120|) (= (select .cse0 |v_~#B~0.offset_221|) 0) (= (select .cse1 1) 0) (= (select |v_#valid_166| 1) 1) (= (select |v_#valid_166| 3) 1) (= |v_#NULL.base_12| 0) (= (select .cse0 (+ |v_~#B~0.offset_221| 16)) 0) (= 48 (select .cse1 0)) (= (select |v_#valid_166| 2) 1) (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select .cse0 (+ |v_~#B~0.offset_221| 12))) (= (select |v_#length_63| 3) 24) (< 0 (+ |v_ULTIMATE.start_main_~x~1#1_98| 1000)) (= (select .cse2 (+ 4 |v_~#C~0.offset_215|)) 0) (= |v_~#B~0.offset_221| 0) (= (select .cse3 (+ |v_~#A~0.offset_253| 16)) 0) (= 55 (select |v_#length_63| 2)) (= v_~h~0_70 0) (= |v_#memory_int_86| (store |v_#memory_int_87| |v_ULTIMATE.start_main_~#id~0#1.base_120| (store (select |v_#memory_int_87| |v_ULTIMATE.start_main_~#id~0#1.base_120|) |v_ULTIMATE.start_main_~#id~0#1.offset_72| |v_ULTIMATE.start_main_#t~pre8#1_55|))) (= (+ |v_#pthreadsForks_25| 1) |v_#pthreadsForks_24|) (= (select .cse2 (+ 8 |v_~#C~0.offset_215|)) 0) (= (select .cse2 |v_~#C~0.offset_215|) 0) (= |v_#valid_165| (store |v_#valid_166| |v_ULTIMATE.start_main_~#id~0#1.base_120| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_72| 0) (= (select |v_#valid_166| |v_ULTIMATE.start_main_~#id~0#1.base_120|) 0) (= |v_~#C~0.offset_215| 0) (= (select .cse2 (+ 12 |v_~#C~0.offset_215|)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) (<= |v_ULTIMATE.start_main_~x~1#1_98| 2147483647) (< 0 |v_#StackHeapBarrier_23|) (= (select |v_#length_63| 1) 2) (= (select .cse0 (+ |v_~#B~0.offset_221| 4)) 0) (= |v_~#A~0.offset_253| 0) (= (select |v_#length_63| 4) 24) (= (select |v_#valid_166| 4) 1) (= (select .cse0 (+ |v_~#B~0.offset_221| 8)) 0) (= (store |v_#length_63| |v_ULTIMATE.start_main_~#id~0#1.base_120| 4) |v_#length_62|) (= 5 |v_~#C~0.base_215|) (= |v_ULTIMATE.start_main_#t~pre8#1_55| |v_#pthreadsForks_25|) (= v_~g~0_40 0) (= (select .cse3 |v_~#A~0.offset_253|) 0) (= (select .cse3 (+ |v_~#A~0.offset_253| 8)) 0) (= v_~i~0_65 0) (= |v_#NULL.offset_12| 0) (= 3 |v_~#A~0.base_253|) (= (select .cse3 (+ |v_~#A~0.offset_253| 4)) 0) (= (select |v_#valid_166| 5) 1) (= (select |v_#length_63| 5) 24) (= (select .cse3 (+ |v_~#A~0.offset_253| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) (= (select |v_#valid_166| 0) 0) (= (select .cse2 (+ 16 |v_~#C~0.offset_215|)) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #pthreadsForks=|v_#pthreadsForks_25|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_87|, #length=|v_#length_63|} OutVars{~#B~0.base=|v_~#B~0.base_221|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_120|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_43|, ~h~0=v_~h~0_70, ~#C~0.base=|v_~#C~0.base_215|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_55|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_98|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_64|, #pthreadsForks=|v_#pthreadsForks_24|, ~#C~0.offset=|v_~#C~0.offset_215|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_54|, #length=|v_#length_62|, ~#A~0.base=|v_~#A~0.base_253|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_68|, ~i~0=v_~i~0_65, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_70|, ~g~0=v_~g~0_40, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_72|, ~#B~0.offset=|v_~#B~0.offset_221|, #NULL.base=|v_#NULL.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_68|, ~#A~0.offset=|v_~#A~0.offset_253|, #valid=|v_#valid_165|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_49|, #memory_int=|v_#memory_int_86|} AuxVars[] AssignedVars[~#B~0.base, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet9#1, ~h~0, ~#C~0.base, ULTIMATE.start_main_#t~pre8#1, #NULL.offset, ULTIMATE.start_main_~x~1#1, ULTIMATE.start_main_#t~nondet12#1, #pthreadsForks, ~#C~0.offset, ULTIMATE.start_main_#t~nondet13#1, #length, ~#A~0.base, ULTIMATE.start_main_#t~nondet10#1, ~i~0, ULTIMATE.start_main_#res#1, ~g~0, ULTIMATE.start_main_~#id~0#1.offset, ~#B~0.offset, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ~#A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int] {1304#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} is VALID [2022-02-21 03:12:29,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {1304#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} [350] L713-2-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_6|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_8|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_26|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_10|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, t_funThread1of1ForFork0_~z~0#1=|v_t_funThread1of1ForFork0_~z~0#1_8|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_8|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_6|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_14|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_8|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_26|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_~z~0#1, t_funThread1of1ForFork0_#t~nondet2#1, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_#t~nondet5#1] {1304#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} is VALID [2022-02-21 03:12:29,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {1304#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} [421] L713-3-->L715: Formula: (let ((.cse0 (select |v_#pthreadsMutex_360| |v_~#B~0.base_79|))) (and (= |v_#pthreadsMutex_359| (store |v_#pthreadsMutex_360| |v_~#B~0.base_79| (store .cse0 |v_~#B~0.offset_79| 1))) (= (select .cse0 |v_~#B~0.offset_79|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_360|, ~#B~0.base=|v_~#B~0.base_79|, ~#B~0.offset=|v_~#B~0.offset_79|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_359|, ~#B~0.base=|v_~#B~0.base_79|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_30|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_7|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_13|, ~#B~0.offset=|v_~#B~0.offset_79|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~pre8#1] {1304#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} is VALID [2022-02-21 03:12:29,593 INFO L290 TraceCheckUtils]: 3: Hoare triple {1304#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} [393] L715-->L716: Formula: (let ((.cse0 (select |v_#pthreadsMutex_198| |v_~#A~0.base_53|))) (and (= (store |v_#pthreadsMutex_198| |v_~#A~0.base_53| (store .cse0 |v_~#A~0.offset_53| 1)) |v_#pthreadsMutex_197|) (= (select .cse0 |v_~#A~0.offset_53|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_198|, ~#A~0.offset=|v_~#A~0.offset_53|, ~#A~0.base=|v_~#A~0.base_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_197|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_14|, ~#A~0.offset=|v_~#A~0.offset_53|, ~#A~0.base=|v_~#A~0.base_53|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet11#1] {1304#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} is VALID [2022-02-21 03:12:29,593 INFO L290 TraceCheckUtils]: 4: Hoare triple {1304#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} [204] L716-->L717: Formula: (= 11 v_~i~0_2) InVars {} OutVars{~i~0=v_~i~0_2} AuxVars[] AssignedVars[~i~0] {1304#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} is VALID [2022-02-21 03:12:29,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {1304#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} [436] L717-->ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_ULTIMATE.start_main_~x~1#1_54| v_~g~0_27) (not (<= 0 (+ |v_ULTIMATE.start_main_~x~1#1_54| 2147483631)))) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_54|} OutVars{~g~0=v_~g~0_27, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_54|} AuxVars[] AssignedVars[~g~0] {1303#false} is VALID [2022-02-21 03:12:29,594 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-21 03:12:29,594 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:12:29,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499386441] [2022-02-21 03:12:29,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499386441] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:12:29,595 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:12:29,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-02-21 03:12:29,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587607858] [2022-02-21 03:12:29,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:12:29,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-02-21 03:12:29,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:12:29,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-21 03:12:29,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:12:29,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:12:29,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:12:29,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:12:29,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:12:29,609 INFO L87 Difference]: Start difference. First operand 160 states and 295 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-21 03:12:29,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:29,670 INFO L93 Difference]: Finished difference Result 147 states and 269 transitions. [2022-02-21 03:12:29,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:12:29,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-02-21 03:12:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:12:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-21 03:12:29,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-02-21 03:12:29,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-21 03:12:29,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-02-21 03:12:29,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 30 transitions. [2022-02-21 03:12:29,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:12:29,703 INFO L225 Difference]: With dead ends: 147 [2022-02-21 03:12:29,704 INFO L226 Difference]: Without dead ends: 147 [2022-02-21 03:12:29,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:12:29,705 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:12:29,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 7 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:12:29,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-02-21 03:12:29,711 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,711 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,711 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,711 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,712 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,712 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,712 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,712 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,712 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,713 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,713 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,713 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,713 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,713 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,713 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,714 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,714 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,714 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,714 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,714 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,715 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,715 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,715 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,715 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,715 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,716 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,716 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,716 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,716 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,716 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,717 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,717 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,717 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,717 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,717 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,717 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,718 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,718 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,718 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,718 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,718 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,719 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,719 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,719 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,719 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,719 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,720 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,720 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,720 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,720 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,720 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,721 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,721 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,721 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,721 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,721 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,722 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,722 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,722 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,722 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,722 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,722 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,723 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,723 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,723 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,723 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,723 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,724 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,724 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,724 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,724 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,724 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,725 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,725 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,725 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,725 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,725 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,725 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,726 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,726 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,726 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,726 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,726 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,727 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,727 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,727 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,727 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,727 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,727 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,728 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,728 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,728 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,728 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,728 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,729 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,729 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,729 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,729 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,729 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,730 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,730 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,730 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,730 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,730 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,730 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,731 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,731 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,731 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,731 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,731 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,731 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,732 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,732 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,732 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,732 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,732 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,733 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,733 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,733 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,733 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,733 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,733 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,734 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,734 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,734 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,734 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,734 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,735 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,735 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,735 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,735 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,735 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,736 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,736 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,736 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,736 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,736 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,737 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,737 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,737 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,737 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,737 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,738 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,738 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,738 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,738 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,738 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2022-02-21 03:12:29,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:12:29,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 147 states, 142 states have (on average 1.8943661971830985) internal successors, (269), 146 states have internal predecessors, (269), 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-21 03:12:29,740 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 147 states, 142 states have (on average 1.8943661971830985) internal successors, (269), 146 states have internal predecessors, (269), 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-21 03:12:29,741 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 147 states, 142 states have (on average 1.8943661971830985) internal successors, (269), 146 states have internal predecessors, (269), 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-21 03:12:29,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:29,746 INFO L93 Difference]: Finished difference Result 147 states and 269 transitions. [2022-02-21 03:12:29,746 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 269 transitions. [2022-02-21 03:12:29,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:12:29,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:12:29,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 142 states have (on average 1.8943661971830985) internal successors, (269), 146 states have internal predecessors, (269), 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) Second operand 147 states. [2022-02-21 03:12:29,749 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.8943661971830985) internal successors, (269), 146 states have internal predecessors, (269), 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) Second operand 147 states. [2022-02-21 03:12:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:29,754 INFO L93 Difference]: Finished difference Result 147 states and 269 transitions. [2022-02-21 03:12:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 269 transitions. [2022-02-21 03:12:29,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:12:29,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:12:29,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:12:29,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:12:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.8943661971830985) internal successors, (269), 146 states have internal predecessors, (269), 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-21 03:12:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 269 transitions. [2022-02-21 03:12:29,762 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 269 transitions. Word has length 6 [2022-02-21 03:12:29,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:12:29,762 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 269 transitions. [2022-02-21 03:12:29,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-21 03:12:29,763 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 269 transitions. [2022-02-21 03:12:29,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:12:29,763 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:12:29,763 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:12:29,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:12:29,764 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-21 03:12:29,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:12:29,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2128326855, now seen corresponding path program 1 times [2022-02-21 03:12:29,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:12:29,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16210545] [2022-02-21 03:12:29,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:12:29,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:12:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:12:29,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {2042#true} [483] ULTIMATE.startENTRY-->L713-2: Formula: (let ((.cse1 (select |v_#memory_int_87| 1)) (.cse0 (select |v_#memory_int_87| |v_~#B~0.base_221|)) (.cse3 (select |v_#memory_int_87| |v_~#A~0.base_253|)) (.cse2 (select |v_#memory_int_87| |v_~#C~0.base_215|))) (and (= 4 |v_~#B~0.base_221|) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#id~0#1.base_120|) (= (select .cse0 |v_~#B~0.offset_221|) 0) (= (select .cse1 1) 0) (= (select |v_#valid_166| 1) 1) (= (select |v_#valid_166| 3) 1) (= |v_#NULL.base_12| 0) (= (select .cse0 (+ |v_~#B~0.offset_221| 16)) 0) (= 48 (select .cse1 0)) (= (select |v_#valid_166| 2) 1) (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select .cse0 (+ |v_~#B~0.offset_221| 12))) (= (select |v_#length_63| 3) 24) (< 0 (+ |v_ULTIMATE.start_main_~x~1#1_98| 1000)) (= (select .cse2 (+ 4 |v_~#C~0.offset_215|)) 0) (= |v_~#B~0.offset_221| 0) (= (select .cse3 (+ |v_~#A~0.offset_253| 16)) 0) (= 55 (select |v_#length_63| 2)) (= v_~h~0_70 0) (= |v_#memory_int_86| (store |v_#memory_int_87| |v_ULTIMATE.start_main_~#id~0#1.base_120| (store (select |v_#memory_int_87| |v_ULTIMATE.start_main_~#id~0#1.base_120|) |v_ULTIMATE.start_main_~#id~0#1.offset_72| |v_ULTIMATE.start_main_#t~pre8#1_55|))) (= (+ |v_#pthreadsForks_25| 1) |v_#pthreadsForks_24|) (= (select .cse2 (+ 8 |v_~#C~0.offset_215|)) 0) (= (select .cse2 |v_~#C~0.offset_215|) 0) (= |v_#valid_165| (store |v_#valid_166| |v_ULTIMATE.start_main_~#id~0#1.base_120| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_72| 0) (= (select |v_#valid_166| |v_ULTIMATE.start_main_~#id~0#1.base_120|) 0) (= |v_~#C~0.offset_215| 0) (= (select .cse2 (+ 12 |v_~#C~0.offset_215|)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) (<= |v_ULTIMATE.start_main_~x~1#1_98| 2147483647) (< 0 |v_#StackHeapBarrier_23|) (= (select |v_#length_63| 1) 2) (= (select .cse0 (+ |v_~#B~0.offset_221| 4)) 0) (= |v_~#A~0.offset_253| 0) (= (select |v_#length_63| 4) 24) (= (select |v_#valid_166| 4) 1) (= (select .cse0 (+ |v_~#B~0.offset_221| 8)) 0) (= (store |v_#length_63| |v_ULTIMATE.start_main_~#id~0#1.base_120| 4) |v_#length_62|) (= 5 |v_~#C~0.base_215|) (= |v_ULTIMATE.start_main_#t~pre8#1_55| |v_#pthreadsForks_25|) (= v_~g~0_40 0) (= (select .cse3 |v_~#A~0.offset_253|) 0) (= (select .cse3 (+ |v_~#A~0.offset_253| 8)) 0) (= v_~i~0_65 0) (= |v_#NULL.offset_12| 0) (= 3 |v_~#A~0.base_253|) (= (select .cse3 (+ |v_~#A~0.offset_253| 4)) 0) (= (select |v_#valid_166| 5) 1) (= (select |v_#length_63| 5) 24) (= (select .cse3 (+ |v_~#A~0.offset_253| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) (= (select |v_#valid_166| 0) 0) (= (select .cse2 (+ 16 |v_~#C~0.offset_215|)) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #pthreadsForks=|v_#pthreadsForks_25|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_87|, #length=|v_#length_63|} OutVars{~#B~0.base=|v_~#B~0.base_221|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_120|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_43|, ~h~0=v_~h~0_70, ~#C~0.base=|v_~#C~0.base_215|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_55|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_98|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_64|, #pthreadsForks=|v_#pthreadsForks_24|, ~#C~0.offset=|v_~#C~0.offset_215|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_54|, #length=|v_#length_62|, ~#A~0.base=|v_~#A~0.base_253|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_68|, ~i~0=v_~i~0_65, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_70|, ~g~0=v_~g~0_40, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_72|, ~#B~0.offset=|v_~#B~0.offset_221|, #NULL.base=|v_#NULL.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_68|, ~#A~0.offset=|v_~#A~0.offset_253|, #valid=|v_#valid_165|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_49|, #memory_int=|v_#memory_int_86|} AuxVars[] AssignedVars[~#B~0.base, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet9#1, ~h~0, ~#C~0.base, ULTIMATE.start_main_#t~pre8#1, #NULL.offset, ULTIMATE.start_main_~x~1#1, ULTIMATE.start_main_#t~nondet12#1, #pthreadsForks, ~#C~0.offset, ULTIMATE.start_main_#t~nondet13#1, #length, ~#A~0.base, ULTIMATE.start_main_#t~nondet10#1, ~i~0, ULTIMATE.start_main_#res#1, ~g~0, ULTIMATE.start_main_~#id~0#1.offset, ~#B~0.offset, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ~#A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int] {2044#(<= |ULTIMATE.start_main_~x~1#1| 2147483647)} is VALID [2022-02-21 03:12:29,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {2044#(<= |ULTIMATE.start_main_~x~1#1| 2147483647)} [350] L713-2-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_6|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_8|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_26|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_10|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, t_funThread1of1ForFork0_~z~0#1=|v_t_funThread1of1ForFork0_~z~0#1_8|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_8|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_6|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_14|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_8|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_26|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_~z~0#1, t_funThread1of1ForFork0_#t~nondet2#1, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_#t~nondet5#1] {2044#(<= |ULTIMATE.start_main_~x~1#1| 2147483647)} is VALID [2022-02-21 03:12:29,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {2044#(<= |ULTIMATE.start_main_~x~1#1| 2147483647)} [421] L713-3-->L715: Formula: (let ((.cse0 (select |v_#pthreadsMutex_360| |v_~#B~0.base_79|))) (and (= |v_#pthreadsMutex_359| (store |v_#pthreadsMutex_360| |v_~#B~0.base_79| (store .cse0 |v_~#B~0.offset_79| 1))) (= (select .cse0 |v_~#B~0.offset_79|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_360|, ~#B~0.base=|v_~#B~0.base_79|, ~#B~0.offset=|v_~#B~0.offset_79|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_359|, ~#B~0.base=|v_~#B~0.base_79|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_30|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_7|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_13|, ~#B~0.offset=|v_~#B~0.offset_79|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~pre8#1] {2044#(<= |ULTIMATE.start_main_~x~1#1| 2147483647)} is VALID [2022-02-21 03:12:29,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {2044#(<= |ULTIMATE.start_main_~x~1#1| 2147483647)} [393] L715-->L716: Formula: (let ((.cse0 (select |v_#pthreadsMutex_198| |v_~#A~0.base_53|))) (and (= (store |v_#pthreadsMutex_198| |v_~#A~0.base_53| (store .cse0 |v_~#A~0.offset_53| 1)) |v_#pthreadsMutex_197|) (= (select .cse0 |v_~#A~0.offset_53|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_198|, ~#A~0.offset=|v_~#A~0.offset_53|, ~#A~0.base=|v_~#A~0.base_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_197|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_14|, ~#A~0.offset=|v_~#A~0.offset_53|, ~#A~0.base=|v_~#A~0.base_53|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet11#1] {2044#(<= |ULTIMATE.start_main_~x~1#1| 2147483647)} is VALID [2022-02-21 03:12:29,810 INFO L290 TraceCheckUtils]: 4: Hoare triple {2044#(<= |ULTIMATE.start_main_~x~1#1| 2147483647)} [204] L716-->L717: Formula: (= 11 v_~i~0_2) InVars {} OutVars{~i~0=v_~i~0_2} AuxVars[] AssignedVars[~i~0] {2044#(<= |ULTIMATE.start_main_~x~1#1| 2147483647)} is VALID [2022-02-21 03:12:29,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {2044#(<= |ULTIMATE.start_main_~x~1#1| 2147483647)} [357] L717-->ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (not (<= |v_ULTIMATE.start_main_~x~1#1_24| 2147483664)) (= |v_ULTIMATE.start_main_~x~1#1_24| v_~g~0_12)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_24|} OutVars{~g~0=v_~g~0_12, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_24|} AuxVars[] AssignedVars[~g~0] {2043#false} is VALID [2022-02-21 03:12:29,811 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-21 03:12:29,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:12:29,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16210545] [2022-02-21 03:12:29,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16210545] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:12:29,812 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:12:29,812 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-02-21 03:12:29,812 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643713797] [2022-02-21 03:12:29,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:12:29,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-02-21 03:12:29,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:12:29,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-21 03:12:29,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:12:29,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:12:29,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:12:29,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:12:29,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:12:29,820 INFO L87 Difference]: Start difference. First operand 147 states and 269 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-21 03:12:29,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:29,870 INFO L93 Difference]: Finished difference Result 134 states and 243 transitions. [2022-02-21 03:12:29,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:12:29,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-02-21 03:12:29,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:12:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-21 03:12:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 03:12:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-21 03:12:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 03:12:29,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2022-02-21 03:12:29,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:12:29,901 INFO L225 Difference]: With dead ends: 134 [2022-02-21 03:12:29,901 INFO L226 Difference]: Without dead ends: 114 [2022-02-21 03:12:29,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:12:29,903 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:12:29,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 7 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:12:29,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-02-21 03:12:29,906 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,907 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,907 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,907 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,907 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,907 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,907 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,908 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,908 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,908 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,908 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,909 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,909 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,909 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,909 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,909 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,909 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,910 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,910 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,910 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,910 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,910 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,911 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,911 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,911 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,911 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,911 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,911 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,912 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,912 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,912 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,912 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,912 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,912 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,913 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,913 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,913 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,913 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,913 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,914 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,914 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,914 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,914 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,914 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,914 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,915 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,915 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,915 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,915 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,915 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,916 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,916 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,916 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,916 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,916 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,916 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,917 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,917 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,917 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,917 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,917 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,917 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,918 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,918 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,918 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,918 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,918 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,919 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,919 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,919 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,919 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,919 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,919 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,920 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,920 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,920 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,920 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,920 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,920 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,921 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,921 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,921 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,921 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,921 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,922 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,922 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,922 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,922 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,922 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,922 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,923 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,923 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,923 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,923 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,923 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,924 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,924 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,924 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,924 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,924 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,925 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,925 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,925 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,925 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,925 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,925 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,926 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,926 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,926 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,926 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,926 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,927 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,927 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,927 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-02-21 03:12:29,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:12:29,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 114 states, 112 states have (on average 1.8214285714285714) internal successors, (204), 113 states have internal predecessors, (204), 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-21 03:12:29,929 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 114 states, 112 states have (on average 1.8214285714285714) internal successors, (204), 113 states have internal predecessors, (204), 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-21 03:12:29,929 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 114 states, 112 states have (on average 1.8214285714285714) internal successors, (204), 113 states have internal predecessors, (204), 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-21 03:12:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:29,933 INFO L93 Difference]: Finished difference Result 114 states and 204 transitions. [2022-02-21 03:12:29,933 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 204 transitions. [2022-02-21 03:12:29,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:12:29,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:12:29,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 112 states have (on average 1.8214285714285714) internal successors, (204), 113 states have internal predecessors, (204), 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) Second operand 114 states. [2022-02-21 03:12:29,934 INFO L87 Difference]: Start difference. First operand has 114 states, 112 states have (on average 1.8214285714285714) internal successors, (204), 113 states have internal predecessors, (204), 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) Second operand 114 states. [2022-02-21 03:12:29,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:29,938 INFO L93 Difference]: Finished difference Result 114 states and 204 transitions. [2022-02-21 03:12:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 204 transitions. [2022-02-21 03:12:29,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:12:29,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:12:29,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:12:29,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:12:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 112 states have (on average 1.8214285714285714) internal successors, (204), 113 states have internal predecessors, (204), 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-21 03:12:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 204 transitions. [2022-02-21 03:12:29,942 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 204 transitions. Word has length 6 [2022-02-21 03:12:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:12:29,943 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 204 transitions. [2022-02-21 03:12:29,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-21 03:12:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 204 transitions. [2022-02-21 03:12:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:12:29,944 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:12:29,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:12:29,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:12:29,944 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-21 03:12:29,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:12:29,945 INFO L85 PathProgramCache]: Analyzing trace with hash 585345918, now seen corresponding path program 1 times [2022-02-21 03:12:29,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:12:29,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654083175] [2022-02-21 03:12:29,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:12:29,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:12:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:12:30,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {2637#true} [483] ULTIMATE.startENTRY-->L713-2: Formula: (let ((.cse1 (select |v_#memory_int_87| 1)) (.cse0 (select |v_#memory_int_87| |v_~#B~0.base_221|)) (.cse3 (select |v_#memory_int_87| |v_~#A~0.base_253|)) (.cse2 (select |v_#memory_int_87| |v_~#C~0.base_215|))) (and (= 4 |v_~#B~0.base_221|) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#id~0#1.base_120|) (= (select .cse0 |v_~#B~0.offset_221|) 0) (= (select .cse1 1) 0) (= (select |v_#valid_166| 1) 1) (= (select |v_#valid_166| 3) 1) (= |v_#NULL.base_12| 0) (= (select .cse0 (+ |v_~#B~0.offset_221| 16)) 0) (= 48 (select .cse1 0)) (= (select |v_#valid_166| 2) 1) (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select .cse0 (+ |v_~#B~0.offset_221| 12))) (= (select |v_#length_63| 3) 24) (< 0 (+ |v_ULTIMATE.start_main_~x~1#1_98| 1000)) (= (select .cse2 (+ 4 |v_~#C~0.offset_215|)) 0) (= |v_~#B~0.offset_221| 0) (= (select .cse3 (+ |v_~#A~0.offset_253| 16)) 0) (= 55 (select |v_#length_63| 2)) (= v_~h~0_70 0) (= |v_#memory_int_86| (store |v_#memory_int_87| |v_ULTIMATE.start_main_~#id~0#1.base_120| (store (select |v_#memory_int_87| |v_ULTIMATE.start_main_~#id~0#1.base_120|) |v_ULTIMATE.start_main_~#id~0#1.offset_72| |v_ULTIMATE.start_main_#t~pre8#1_55|))) (= (+ |v_#pthreadsForks_25| 1) |v_#pthreadsForks_24|) (= (select .cse2 (+ 8 |v_~#C~0.offset_215|)) 0) (= (select .cse2 |v_~#C~0.offset_215|) 0) (= |v_#valid_165| (store |v_#valid_166| |v_ULTIMATE.start_main_~#id~0#1.base_120| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_72| 0) (= (select |v_#valid_166| |v_ULTIMATE.start_main_~#id~0#1.base_120|) 0) (= |v_~#C~0.offset_215| 0) (= (select .cse2 (+ 12 |v_~#C~0.offset_215|)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) (<= |v_ULTIMATE.start_main_~x~1#1_98| 2147483647) (< 0 |v_#StackHeapBarrier_23|) (= (select |v_#length_63| 1) 2) (= (select .cse0 (+ |v_~#B~0.offset_221| 4)) 0) (= |v_~#A~0.offset_253| 0) (= (select |v_#length_63| 4) 24) (= (select |v_#valid_166| 4) 1) (= (select .cse0 (+ |v_~#B~0.offset_221| 8)) 0) (= (store |v_#length_63| |v_ULTIMATE.start_main_~#id~0#1.base_120| 4) |v_#length_62|) (= 5 |v_~#C~0.base_215|) (= |v_ULTIMATE.start_main_#t~pre8#1_55| |v_#pthreadsForks_25|) (= v_~g~0_40 0) (= (select .cse3 |v_~#A~0.offset_253|) 0) (= (select .cse3 (+ |v_~#A~0.offset_253| 8)) 0) (= v_~i~0_65 0) (= |v_#NULL.offset_12| 0) (= 3 |v_~#A~0.base_253|) (= (select .cse3 (+ |v_~#A~0.offset_253| 4)) 0) (= (select |v_#valid_166| 5) 1) (= (select |v_#length_63| 5) 24) (= (select .cse3 (+ |v_~#A~0.offset_253| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) (= (select |v_#valid_166| 0) 0) (= (select .cse2 (+ 16 |v_~#C~0.offset_215|)) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #pthreadsForks=|v_#pthreadsForks_25|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_87|, #length=|v_#length_63|} OutVars{~#B~0.base=|v_~#B~0.base_221|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_120|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_43|, ~h~0=v_~h~0_70, ~#C~0.base=|v_~#C~0.base_215|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_55|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_98|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_64|, #pthreadsForks=|v_#pthreadsForks_24|, ~#C~0.offset=|v_~#C~0.offset_215|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_54|, #length=|v_#length_62|, ~#A~0.base=|v_~#A~0.base_253|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_68|, ~i~0=v_~i~0_65, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_70|, ~g~0=v_~g~0_40, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_72|, ~#B~0.offset=|v_~#B~0.offset_221|, #NULL.base=|v_#NULL.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_68|, ~#A~0.offset=|v_~#A~0.offset_253|, #valid=|v_#valid_165|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_49|, #memory_int=|v_#memory_int_86|} AuxVars[] AssignedVars[~#B~0.base, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet9#1, ~h~0, ~#C~0.base, ULTIMATE.start_main_#t~pre8#1, #NULL.offset, ULTIMATE.start_main_~x~1#1, ULTIMATE.start_main_#t~nondet12#1, #pthreadsForks, ~#C~0.offset, ULTIMATE.start_main_#t~nondet13#1, #length, ~#A~0.base, ULTIMATE.start_main_#t~nondet10#1, ~i~0, ULTIMATE.start_main_#res#1, ~g~0, ULTIMATE.start_main_~#id~0#1.offset, ~#B~0.offset, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ~#A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int] {2639#(= ~g~0 0)} is VALID [2022-02-21 03:12:30,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {2639#(= ~g~0 0)} [350] L713-2-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_6|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_8|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_26|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_10|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, t_funThread1of1ForFork0_~z~0#1=|v_t_funThread1of1ForFork0_~z~0#1_8|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_8|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_6|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_14|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_8|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_26|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_~z~0#1, t_funThread1of1ForFork0_#t~nondet2#1, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_#t~nondet5#1] {2639#(= ~g~0 0)} is VALID [2022-02-21 03:12:30,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {2639#(= ~g~0 0)} [474] t_funENTRY-->L694: Formula: (let ((.cse0 (select |v_#pthreadsMutex_917| |v_~#C~0.base_185|))) (and (<= 0 (+ 2147483648 |v_t_funThread1of1ForFork0_#t~nondet1#1_32|)) (= |v_t_funThread1of1ForFork0_~arg#1.offset_7| |v_t_funThread1of1ForFork0_#in~arg#1.offset_7|) (< |v_t_funThread1of1ForFork0_~x~0#1_199| 1000) (<= 0 (+ 2147483648 |v_t_funThread1of1ForFork0_#t~nondet3#1_32|)) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_7| |v_t_funThread1of1ForFork0_~arg#1.base_7|) (= (select .cse0 |v_~#C~0.offset_185|) 0) (<= |v_t_funThread1of1ForFork0_#t~nondet2#1_30| 2147483647) (= |v_t_funThread1of1ForFork0_~x~0#1_199| |v_t_funThread1of1ForFork0_#t~nondet1#1_32|) (= |v_t_funThread1of1ForFork0_~y~0#1_85| |v_t_funThread1of1ForFork0_#t~nondet2#1_30|) (<= 0 (+ 2147483648 |v_t_funThread1of1ForFork0_#t~nondet2#1_30|)) (<= |v_t_funThread1of1ForFork0_#t~nondet3#1_32| 2147483647) (= |v_t_funThread1of1ForFork0_~z~0#1_47| |v_t_funThread1of1ForFork0_#t~nondet3#1_32|) (= |v_#pthreadsMutex_916| (store |v_#pthreadsMutex_917| |v_~#C~0.base_185| (store .cse0 |v_~#C~0.offset_185| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_917|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_32|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_7|, ~#C~0.base=|v_~#C~0.base_185|, ~#C~0.offset=|v_~#C~0.offset_185|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_32|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_7|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_30|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_916|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_199|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_31|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_7|, ~#C~0.base=|v_~#C~0.base_185|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_7|, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_85|, t_funThread1of1ForFork0_~z~0#1=|v_t_funThread1of1ForFork0_~z~0#1_47|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_29|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_69|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_7|, ~#C~0.offset=|v_~#C~0.offset_185|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_31|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_~z~0#1, t_funThread1of1ForFork0_#t~nondet2#1, t_funThread1of1ForFork0_#t~nondet4#1] {2639#(= ~g~0 0)} is VALID [2022-02-21 03:12:30,017 INFO L290 TraceCheckUtils]: 3: Hoare triple {2639#(= ~g~0 0)} [374] L694-->L695: Formula: (let ((.cse0 (select |v_#pthreadsMutex_106| |v_~#A~0.base_37|))) (and (= (store |v_#pthreadsMutex_106| |v_~#A~0.base_37| (store .cse0 |v_~#A~0.offset_37| 1)) |v_#pthreadsMutex_105|) (= (select .cse0 |v_~#A~0.offset_37|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_106|, ~#A~0.offset=|v_~#A~0.offset_37|, ~#A~0.base=|v_~#A~0.base_37|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#A~0.offset=|v_~#A~0.offset_37|, ~#A~0.base=|v_~#A~0.base_37|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_11|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet5#1] {2639#(= ~g~0 0)} is VALID [2022-02-21 03:12:30,018 INFO L290 TraceCheckUtils]: 4: Hoare triple {2639#(= ~g~0 0)} [309] L695-->L696: Formula: (= |v_t_funThread1of1ForFork0_~x~0#1_7| v_~g~0_3) InVars {~g~0=v_~g~0_3} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_7|, ~g~0=v_~g~0_3} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1] {2640#(= |t_funThread1of1ForFork0_~x~0#1| 0)} is VALID [2022-02-21 03:12:30,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {2640#(= |t_funThread1of1ForFork0_~x~0#1| 0)} [440] L696-->L19-1: Formula: (and (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43| |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_69|) (= (ite (<= |v_t_funThread1of1ForFork0_~y~0#1_43| |v_t_funThread1of1ForFork0_~x~0#1_91|) 1 0) |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= v_~h~0_41 |v_t_funThread1of1ForFork0_~y~0#1_43|)) InVars {t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_91|, ~h~0=v_~h~0_41} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_91|, ~h~0=v_~h~0_41, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_43|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_69|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {2640#(= |t_funThread1of1ForFork0_~x~0#1| 0)} is VALID [2022-02-21 03:12:30,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {2640#(= |t_funThread1of1ForFork0_~x~0#1| 0)} [462] L19-1-->L700: Formula: (let ((.cse0 (select |v_#pthreadsMutex_780| |v_~#B~0.base_159|))) (and (= |v_#pthreadsMutex_779| (store |v_#pthreadsMutex_780| |v_~#B~0.base_159| (store .cse0 |v_~#B~0.offset_159| 1))) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_120| 0)) (= (select .cse0 |v_~#B~0.offset_159|) 0) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_119| 0)) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_119| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_69|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_69| (ite (= |v_t_funThread1of1ForFork0_~y~0#1_63| |v_t_funThread1of1ForFork0_~x~0#1_161|) 1 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_780|, ~#B~0.base=|v_~#B~0.base_159|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_161|, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_63|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_120|, ~#B~0.offset=|v_~#B~0.offset_159|} OutVars{t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_97|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_69|, #pthreadsMutex=|v_#pthreadsMutex_779|, ~#B~0.base=|v_~#B~0.base_159|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_161|, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_63|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_119|, ~#B~0.offset=|v_~#B~0.offset_159|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, #pthreadsMutex, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {2640#(= |t_funThread1of1ForFork0_~x~0#1| 0)} is VALID [2022-02-21 03:12:30,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {2640#(= |t_funThread1of1ForFork0_~x~0#1| 0)} [433] L700-->t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (not (<= 0 (+ 2147483679 |v_t_funThread1of1ForFork0_~x~0#1_81|))) (= (store |v_#pthreadsMutex_426| |v_~#B~0.base_97| (store (select |v_#pthreadsMutex_426| |v_~#B~0.base_97|) |v_~#B~0.offset_97| 0)) |v_#pthreadsMutex_425|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_426|, ~#B~0.base=|v_~#B~0.base_97|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_81|, ~#B~0.offset=|v_~#B~0.offset_97|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_425|, ~#B~0.base=|v_~#B~0.base_97|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_81|, ~#B~0.offset=|v_~#B~0.offset_97|} AuxVars[] AssignedVars[#pthreadsMutex] {2638#false} is VALID [2022-02-21 03:12:30,020 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-21 03:12:30,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:12:30,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654083175] [2022-02-21 03:12:30,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654083175] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:12:30,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:12:30,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:12:30,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827908397] [2022-02-21 03:12:30,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:12:30,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-02-21 03:12:30,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:12:30,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-21 03:12:30,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:12:30,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:12:30,030 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:12:30,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:12:30,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:12:30,031 INFO L87 Difference]: Start difference. First operand 114 states and 204 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-21 03:12:30,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:30,157 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2022-02-21 03:12:30,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:12:30,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-02-21 03:12:30,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:12:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-21 03:12:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-02-21 03:12:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-21 03:12:30,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-02-21 03:12:30,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-02-21 03:12:30,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:12:30,215 INFO L225 Difference]: With dead ends: 136 [2022-02-21 03:12:30,215 INFO L226 Difference]: Without dead ends: 94 [2022-02-21 03:12:30,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:12:30,219 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:12:30,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 28 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:12:30,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-21 03:12:30,228 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,229 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,229 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,229 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,229 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,229 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,229 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,230 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,230 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,230 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,230 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,230 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,230 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,231 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,231 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,231 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,231 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,231 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,232 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,232 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,232 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,232 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,232 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,232 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,233 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,233 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,233 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,233 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,233 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,233 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,234 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,234 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,234 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,234 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,234 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,234 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,235 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,235 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,235 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,235 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,235 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,235 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,236 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,236 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,236 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,236 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,236 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,236 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,237 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,237 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,237 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,237 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,237 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,237 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,238 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,238 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,238 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,238 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,239 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,239 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,239 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,239 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,240 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,240 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,240 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,240 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,240 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,240 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,241 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,241 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,241 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,241 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,241 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,242 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,242 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,242 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,242 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,242 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,242 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,243 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,243 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,243 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,243 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,243 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,243 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,244 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,244 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,244 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,244 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,244 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,245 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,245 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,245 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,246 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-02-21 03:12:30,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:12:30,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 92 states have (on average 1.7826086956521738) internal successors, (164), 93 states have internal predecessors, (164), 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-21 03:12:30,247 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 92 states have (on average 1.7826086956521738) internal successors, (164), 93 states have internal predecessors, (164), 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-21 03:12:30,248 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 92 states have (on average 1.7826086956521738) internal successors, (164), 93 states have internal predecessors, (164), 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-21 03:12:30,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:30,250 INFO L93 Difference]: Finished difference Result 94 states and 164 transitions. [2022-02-21 03:12:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 164 transitions. [2022-02-21 03:12:30,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:12:30,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:12:30,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 92 states have (on average 1.7826086956521738) internal successors, (164), 93 states have internal predecessors, (164), 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) Second operand 94 states. [2022-02-21 03:12:30,251 INFO L87 Difference]: Start difference. First operand has 94 states, 92 states have (on average 1.7826086956521738) internal successors, (164), 93 states have internal predecessors, (164), 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) Second operand 94 states. [2022-02-21 03:12:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:30,254 INFO L93 Difference]: Finished difference Result 94 states and 164 transitions. [2022-02-21 03:12:30,254 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 164 transitions. [2022-02-21 03:12:30,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:12:30,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:12:30,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:12:30,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:12:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.7826086956521738) internal successors, (164), 93 states have internal predecessors, (164), 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-21 03:12:30,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 164 transitions. [2022-02-21 03:12:30,258 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 164 transitions. Word has length 8 [2022-02-21 03:12:30,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:12:30,258 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 164 transitions. [2022-02-21 03:12:30,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-21 03:12:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 164 transitions. [2022-02-21 03:12:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-21 03:12:30,259 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:12:30,260 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:12:30,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:12:30,260 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-21 03:12:30,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:12:30,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1824519450, now seen corresponding path program 1 times [2022-02-21 03:12:30,263 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:12:30,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229350449] [2022-02-21 03:12:30,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:12:30,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:12:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:12:30,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {3157#true} [483] ULTIMATE.startENTRY-->L713-2: Formula: (let ((.cse1 (select |v_#memory_int_87| 1)) (.cse0 (select |v_#memory_int_87| |v_~#B~0.base_221|)) (.cse3 (select |v_#memory_int_87| |v_~#A~0.base_253|)) (.cse2 (select |v_#memory_int_87| |v_~#C~0.base_215|))) (and (= 4 |v_~#B~0.base_221|) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#id~0#1.base_120|) (= (select .cse0 |v_~#B~0.offset_221|) 0) (= (select .cse1 1) 0) (= (select |v_#valid_166| 1) 1) (= (select |v_#valid_166| 3) 1) (= |v_#NULL.base_12| 0) (= (select .cse0 (+ |v_~#B~0.offset_221| 16)) 0) (= 48 (select .cse1 0)) (= (select |v_#valid_166| 2) 1) (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select .cse0 (+ |v_~#B~0.offset_221| 12))) (= (select |v_#length_63| 3) 24) (< 0 (+ |v_ULTIMATE.start_main_~x~1#1_98| 1000)) (= (select .cse2 (+ 4 |v_~#C~0.offset_215|)) 0) (= |v_~#B~0.offset_221| 0) (= (select .cse3 (+ |v_~#A~0.offset_253| 16)) 0) (= 55 (select |v_#length_63| 2)) (= v_~h~0_70 0) (= |v_#memory_int_86| (store |v_#memory_int_87| |v_ULTIMATE.start_main_~#id~0#1.base_120| (store (select |v_#memory_int_87| |v_ULTIMATE.start_main_~#id~0#1.base_120|) |v_ULTIMATE.start_main_~#id~0#1.offset_72| |v_ULTIMATE.start_main_#t~pre8#1_55|))) (= (+ |v_#pthreadsForks_25| 1) |v_#pthreadsForks_24|) (= (select .cse2 (+ 8 |v_~#C~0.offset_215|)) 0) (= (select .cse2 |v_~#C~0.offset_215|) 0) (= |v_#valid_165| (store |v_#valid_166| |v_ULTIMATE.start_main_~#id~0#1.base_120| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_72| 0) (= (select |v_#valid_166| |v_ULTIMATE.start_main_~#id~0#1.base_120|) 0) (= |v_~#C~0.offset_215| 0) (= (select .cse2 (+ 12 |v_~#C~0.offset_215|)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) (<= |v_ULTIMATE.start_main_~x~1#1_98| 2147483647) (< 0 |v_#StackHeapBarrier_23|) (= (select |v_#length_63| 1) 2) (= (select .cse0 (+ |v_~#B~0.offset_221| 4)) 0) (= |v_~#A~0.offset_253| 0) (= (select |v_#length_63| 4) 24) (= (select |v_#valid_166| 4) 1) (= (select .cse0 (+ |v_~#B~0.offset_221| 8)) 0) (= (store |v_#length_63| |v_ULTIMATE.start_main_~#id~0#1.base_120| 4) |v_#length_62|) (= 5 |v_~#C~0.base_215|) (= |v_ULTIMATE.start_main_#t~pre8#1_55| |v_#pthreadsForks_25|) (= v_~g~0_40 0) (= (select .cse3 |v_~#A~0.offset_253|) 0) (= (select .cse3 (+ |v_~#A~0.offset_253| 8)) 0) (= v_~i~0_65 0) (= |v_#NULL.offset_12| 0) (= 3 |v_~#A~0.base_253|) (= (select .cse3 (+ |v_~#A~0.offset_253| 4)) 0) (= (select |v_#valid_166| 5) 1) (= (select |v_#length_63| 5) 24) (= (select .cse3 (+ |v_~#A~0.offset_253| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) (= (select |v_#valid_166| 0) 0) (= (select .cse2 (+ 16 |v_~#C~0.offset_215|)) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #pthreadsForks=|v_#pthreadsForks_25|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_87|, #length=|v_#length_63|} OutVars{~#B~0.base=|v_~#B~0.base_221|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_120|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_43|, ~h~0=v_~h~0_70, ~#C~0.base=|v_~#C~0.base_215|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_55|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_98|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_64|, #pthreadsForks=|v_#pthreadsForks_24|, ~#C~0.offset=|v_~#C~0.offset_215|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_54|, #length=|v_#length_62|, ~#A~0.base=|v_~#A~0.base_253|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_68|, ~i~0=v_~i~0_65, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_70|, ~g~0=v_~g~0_40, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_72|, ~#B~0.offset=|v_~#B~0.offset_221|, #NULL.base=|v_#NULL.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_68|, ~#A~0.offset=|v_~#A~0.offset_253|, #valid=|v_#valid_165|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_49|, #memory_int=|v_#memory_int_86|} AuxVars[] AssignedVars[~#B~0.base, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet9#1, ~h~0, ~#C~0.base, ULTIMATE.start_main_#t~pre8#1, #NULL.offset, ULTIMATE.start_main_~x~1#1, ULTIMATE.start_main_#t~nondet12#1, #pthreadsForks, ~#C~0.offset, ULTIMATE.start_main_#t~nondet13#1, #length, ~#A~0.base, ULTIMATE.start_main_#t~nondet10#1, ~i~0, ULTIMATE.start_main_#res#1, ~g~0, ULTIMATE.start_main_~#id~0#1.offset, ~#B~0.offset, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ~#A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int] {3159#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} is VALID [2022-02-21 03:12:30,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {3159#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} [350] L713-2-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_6|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_8|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_26|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_10|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, t_funThread1of1ForFork0_~z~0#1=|v_t_funThread1of1ForFork0_~z~0#1_8|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_8|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_6|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_14|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_8|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_26|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_~z~0#1, t_funThread1of1ForFork0_#t~nondet2#1, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_#t~nondet5#1] {3159#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} is VALID [2022-02-21 03:12:30,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {3159#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} [421] L713-3-->L715: Formula: (let ((.cse0 (select |v_#pthreadsMutex_360| |v_~#B~0.base_79|))) (and (= |v_#pthreadsMutex_359| (store |v_#pthreadsMutex_360| |v_~#B~0.base_79| (store .cse0 |v_~#B~0.offset_79| 1))) (= (select .cse0 |v_~#B~0.offset_79|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_360|, ~#B~0.base=|v_~#B~0.base_79|, ~#B~0.offset=|v_~#B~0.offset_79|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_359|, ~#B~0.base=|v_~#B~0.base_79|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_30|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_7|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_13|, ~#B~0.offset=|v_~#B~0.offset_79|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~pre8#1] {3159#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} is VALID [2022-02-21 03:12:30,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {3159#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} [393] L715-->L716: Formula: (let ((.cse0 (select |v_#pthreadsMutex_198| |v_~#A~0.base_53|))) (and (= (store |v_#pthreadsMutex_198| |v_~#A~0.base_53| (store .cse0 |v_~#A~0.offset_53| 1)) |v_#pthreadsMutex_197|) (= (select .cse0 |v_~#A~0.offset_53|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_198|, ~#A~0.offset=|v_~#A~0.offset_53|, ~#A~0.base=|v_~#A~0.base_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_197|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_14|, ~#A~0.offset=|v_~#A~0.offset_53|, ~#A~0.base=|v_~#A~0.base_53|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet11#1] {3159#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} is VALID [2022-02-21 03:12:30,335 INFO L290 TraceCheckUtils]: 4: Hoare triple {3159#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} [474] t_funENTRY-->L694: Formula: (let ((.cse0 (select |v_#pthreadsMutex_917| |v_~#C~0.base_185|))) (and (<= 0 (+ 2147483648 |v_t_funThread1of1ForFork0_#t~nondet1#1_32|)) (= |v_t_funThread1of1ForFork0_~arg#1.offset_7| |v_t_funThread1of1ForFork0_#in~arg#1.offset_7|) (< |v_t_funThread1of1ForFork0_~x~0#1_199| 1000) (<= 0 (+ 2147483648 |v_t_funThread1of1ForFork0_#t~nondet3#1_32|)) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_7| |v_t_funThread1of1ForFork0_~arg#1.base_7|) (= (select .cse0 |v_~#C~0.offset_185|) 0) (<= |v_t_funThread1of1ForFork0_#t~nondet2#1_30| 2147483647) (= |v_t_funThread1of1ForFork0_~x~0#1_199| |v_t_funThread1of1ForFork0_#t~nondet1#1_32|) (= |v_t_funThread1of1ForFork0_~y~0#1_85| |v_t_funThread1of1ForFork0_#t~nondet2#1_30|) (<= 0 (+ 2147483648 |v_t_funThread1of1ForFork0_#t~nondet2#1_30|)) (<= |v_t_funThread1of1ForFork0_#t~nondet3#1_32| 2147483647) (= |v_t_funThread1of1ForFork0_~z~0#1_47| |v_t_funThread1of1ForFork0_#t~nondet3#1_32|) (= |v_#pthreadsMutex_916| (store |v_#pthreadsMutex_917| |v_~#C~0.base_185| (store .cse0 |v_~#C~0.offset_185| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_917|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_32|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_7|, ~#C~0.base=|v_~#C~0.base_185|, ~#C~0.offset=|v_~#C~0.offset_185|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_32|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_7|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_30|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_916|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_199|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_31|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_7|, ~#C~0.base=|v_~#C~0.base_185|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_7|, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_85|, t_funThread1of1ForFork0_~z~0#1=|v_t_funThread1of1ForFork0_~z~0#1_47|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_29|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_69|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_7|, ~#C~0.offset=|v_~#C~0.offset_185|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_31|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_~z~0#1, t_funThread1of1ForFork0_#t~nondet2#1, t_funThread1of1ForFork0_#t~nondet4#1] {3159#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} is VALID [2022-02-21 03:12:30,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {3159#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} [374] L694-->L695: Formula: (let ((.cse0 (select |v_#pthreadsMutex_106| |v_~#A~0.base_37|))) (and (= (store |v_#pthreadsMutex_106| |v_~#A~0.base_37| (store .cse0 |v_~#A~0.offset_37| 1)) |v_#pthreadsMutex_105|) (= (select .cse0 |v_~#A~0.offset_37|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_106|, ~#A~0.offset=|v_~#A~0.offset_37|, ~#A~0.base=|v_~#A~0.base_37|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#A~0.offset=|v_~#A~0.offset_37|, ~#A~0.base=|v_~#A~0.base_37|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_11|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet5#1] {3159#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} is VALID [2022-02-21 03:12:30,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {3159#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} [204] L716-->L717: Formula: (= 11 v_~i~0_2) InVars {} OutVars{~i~0=v_~i~0_2} AuxVars[] AssignedVars[~i~0] {3159#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} is VALID [2022-02-21 03:12:30,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {3159#(<= 0 (+ 999 |ULTIMATE.start_main_~x~1#1|))} [356] L717-->L718-1: Formula: (and (<= |v_ULTIMATE.start_main_~x~1#1_22| 2147483664) (= |v_ULTIMATE.start_main_~x~1#1_22| v_~g~0_10)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_22|} OutVars{~g~0=v_~g~0_10, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_22|} AuxVars[] AssignedVars[~g~0] {3160#(<= 0 (+ 999 ~g~0))} is VALID [2022-02-21 03:12:30,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {3160#(<= 0 (+ 999 ~g~0))} [309] L695-->L696: Formula: (= |v_t_funThread1of1ForFork0_~x~0#1_7| v_~g~0_3) InVars {~g~0=v_~g~0_3} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_7|, ~g~0=v_~g~0_3} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1] {3161#(<= 0 (+ 999 |t_funThread1of1ForFork0_~x~0#1|))} is VALID [2022-02-21 03:12:30,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {3161#(<= 0 (+ 999 |t_funThread1of1ForFork0_~x~0#1|))} [440] L696-->L19-1: Formula: (and (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43| |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_69|) (= (ite (<= |v_t_funThread1of1ForFork0_~y~0#1_43| |v_t_funThread1of1ForFork0_~x~0#1_91|) 1 0) |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= v_~h~0_41 |v_t_funThread1of1ForFork0_~y~0#1_43|)) InVars {t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_91|, ~h~0=v_~h~0_41} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_91|, ~h~0=v_~h~0_41, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_43|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_69|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {3161#(<= 0 (+ 999 |t_funThread1of1ForFork0_~x~0#1|))} is VALID [2022-02-21 03:12:30,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {3161#(<= 0 (+ 999 |t_funThread1of1ForFork0_~x~0#1|))} [462] L19-1-->L700: Formula: (let ((.cse0 (select |v_#pthreadsMutex_780| |v_~#B~0.base_159|))) (and (= |v_#pthreadsMutex_779| (store |v_#pthreadsMutex_780| |v_~#B~0.base_159| (store .cse0 |v_~#B~0.offset_159| 1))) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_120| 0)) (= (select .cse0 |v_~#B~0.offset_159|) 0) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_119| 0)) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_119| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_69|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_69| (ite (= |v_t_funThread1of1ForFork0_~y~0#1_63| |v_t_funThread1of1ForFork0_~x~0#1_161|) 1 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_780|, ~#B~0.base=|v_~#B~0.base_159|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_161|, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_63|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_120|, ~#B~0.offset=|v_~#B~0.offset_159|} OutVars{t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_97|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_69|, #pthreadsMutex=|v_#pthreadsMutex_779|, ~#B~0.base=|v_~#B~0.base_159|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_161|, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_63|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_119|, ~#B~0.offset=|v_~#B~0.offset_159|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, #pthreadsMutex, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {3161#(<= 0 (+ 999 |t_funThread1of1ForFork0_~x~0#1|))} is VALID [2022-02-21 03:12:30,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {3161#(<= 0 (+ 999 |t_funThread1of1ForFork0_~x~0#1|))} [433] L700-->t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (not (<= 0 (+ 2147483679 |v_t_funThread1of1ForFork0_~x~0#1_81|))) (= (store |v_#pthreadsMutex_426| |v_~#B~0.base_97| (store (select |v_#pthreadsMutex_426| |v_~#B~0.base_97|) |v_~#B~0.offset_97| 0)) |v_#pthreadsMutex_425|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_426|, ~#B~0.base=|v_~#B~0.base_97|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_81|, ~#B~0.offset=|v_~#B~0.offset_97|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_425|, ~#B~0.base=|v_~#B~0.base_97|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_81|, ~#B~0.offset=|v_~#B~0.offset_97|} AuxVars[] AssignedVars[#pthreadsMutex] {3158#false} is VALID [2022-02-21 03:12:30,339 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-21 03:12:30,339 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:12:30,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229350449] [2022-02-21 03:12:30,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229350449] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:12:30,340 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:12:30,340 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:12:30,340 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808122543] [2022-02-21 03:12:30,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:12:30,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2022-02-21 03:12:30,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:12:30,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-21 03:12:30,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:12:30,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:12:30,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:12:30,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:12:30,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:12:30,354 INFO L87 Difference]: Start difference. First operand 94 states and 164 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-21 03:12:30,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:30,456 INFO L93 Difference]: Finished difference Result 84 states and 145 transitions. [2022-02-21 03:12:30,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:12:30,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2022-02-21 03:12:30,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:12:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-21 03:12:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-02-21 03:12:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-21 03:12:30,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-02-21 03:12:30,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-02-21 03:12:30,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:12:30,488 INFO L225 Difference]: With dead ends: 84 [2022-02-21 03:12:30,488 INFO L226 Difference]: Without dead ends: 84 [2022-02-21 03:12:30,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:12:30,489 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 42 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:12:30,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 14 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:12:30,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-02-21 03:12:30,491 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,492 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,492 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,492 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,492 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,492 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,493 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,493 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,493 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,493 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,493 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,493 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,494 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,494 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,494 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,494 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,494 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,494 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,495 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,495 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,495 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,495 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,495 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,495 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,496 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,496 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,496 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,496 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,496 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,496 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,497 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,497 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,497 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,497 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,497 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,497 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,498 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,498 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,498 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,498 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,498 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,498 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,499 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,499 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,499 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,499 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,499 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,499 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,500 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,500 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,500 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,500 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,500 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,500 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,501 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,501 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,501 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,501 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,501 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,502 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,502 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,502 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,502 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,502 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,502 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,503 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,503 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,503 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,503 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,503 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,504 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,504 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,504 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,504 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,504 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,504 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,505 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,505 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,505 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,505 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,505 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,505 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,506 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,506 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-02-21 03:12:30,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:12:30,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 83 states have (on average 1.7469879518072289) internal successors, (145), 83 states have internal predecessors, (145), 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-21 03:12:30,507 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 83 states have (on average 1.7469879518072289) internal successors, (145), 83 states have internal predecessors, (145), 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-21 03:12:30,507 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 83 states have (on average 1.7469879518072289) internal successors, (145), 83 states have internal predecessors, (145), 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-21 03:12:30,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:30,510 INFO L93 Difference]: Finished difference Result 84 states and 145 transitions. [2022-02-21 03:12:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 145 transitions. [2022-02-21 03:12:30,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:12:30,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:12:30,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 83 states have (on average 1.7469879518072289) internal successors, (145), 83 states have internal predecessors, (145), 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) Second operand 84 states. [2022-02-21 03:12:30,511 INFO L87 Difference]: Start difference. First operand has 84 states, 83 states have (on average 1.7469879518072289) internal successors, (145), 83 states have internal predecessors, (145), 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) Second operand 84 states. [2022-02-21 03:12:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:30,513 INFO L93 Difference]: Finished difference Result 84 states and 145 transitions. [2022-02-21 03:12:30,513 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 145 transitions. [2022-02-21 03:12:30,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:12:30,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:12:30,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:12:30,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:12:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.7469879518072289) internal successors, (145), 83 states have internal predecessors, (145), 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-21 03:12:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 145 transitions. [2022-02-21 03:12:30,516 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 145 transitions. Word has length 12 [2022-02-21 03:12:30,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:12:30,517 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 145 transitions. [2022-02-21 03:12:30,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-21 03:12:30,517 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 145 transitions. [2022-02-21 03:12:30,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-21 03:12:30,517 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:12:30,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:12:30,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:12:30,518 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-21 03:12:30,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:12:30,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1824519399, now seen corresponding path program 1 times [2022-02-21 03:12:30,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:12:30,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646843454] [2022-02-21 03:12:30,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:12:30,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:12:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:12:30,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {3588#true} [483] ULTIMATE.startENTRY-->L713-2: Formula: (let ((.cse1 (select |v_#memory_int_87| 1)) (.cse0 (select |v_#memory_int_87| |v_~#B~0.base_221|)) (.cse3 (select |v_#memory_int_87| |v_~#A~0.base_253|)) (.cse2 (select |v_#memory_int_87| |v_~#C~0.base_215|))) (and (= 4 |v_~#B~0.base_221|) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#id~0#1.base_120|) (= (select .cse0 |v_~#B~0.offset_221|) 0) (= (select .cse1 1) 0) (= (select |v_#valid_166| 1) 1) (= (select |v_#valid_166| 3) 1) (= |v_#NULL.base_12| 0) (= (select .cse0 (+ |v_~#B~0.offset_221| 16)) 0) (= 48 (select .cse1 0)) (= (select |v_#valid_166| 2) 1) (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select .cse0 (+ |v_~#B~0.offset_221| 12))) (= (select |v_#length_63| 3) 24) (< 0 (+ |v_ULTIMATE.start_main_~x~1#1_98| 1000)) (= (select .cse2 (+ 4 |v_~#C~0.offset_215|)) 0) (= |v_~#B~0.offset_221| 0) (= (select .cse3 (+ |v_~#A~0.offset_253| 16)) 0) (= 55 (select |v_#length_63| 2)) (= v_~h~0_70 0) (= |v_#memory_int_86| (store |v_#memory_int_87| |v_ULTIMATE.start_main_~#id~0#1.base_120| (store (select |v_#memory_int_87| |v_ULTIMATE.start_main_~#id~0#1.base_120|) |v_ULTIMATE.start_main_~#id~0#1.offset_72| |v_ULTIMATE.start_main_#t~pre8#1_55|))) (= (+ |v_#pthreadsForks_25| 1) |v_#pthreadsForks_24|) (= (select .cse2 (+ 8 |v_~#C~0.offset_215|)) 0) (= (select .cse2 |v_~#C~0.offset_215|) 0) (= |v_#valid_165| (store |v_#valid_166| |v_ULTIMATE.start_main_~#id~0#1.base_120| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_72| 0) (= (select |v_#valid_166| |v_ULTIMATE.start_main_~#id~0#1.base_120|) 0) (= |v_~#C~0.offset_215| 0) (= (select .cse2 (+ 12 |v_~#C~0.offset_215|)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) (<= |v_ULTIMATE.start_main_~x~1#1_98| 2147483647) (< 0 |v_#StackHeapBarrier_23|) (= (select |v_#length_63| 1) 2) (= (select .cse0 (+ |v_~#B~0.offset_221| 4)) 0) (= |v_~#A~0.offset_253| 0) (= (select |v_#length_63| 4) 24) (= (select |v_#valid_166| 4) 1) (= (select .cse0 (+ |v_~#B~0.offset_221| 8)) 0) (= (store |v_#length_63| |v_ULTIMATE.start_main_~#id~0#1.base_120| 4) |v_#length_62|) (= 5 |v_~#C~0.base_215|) (= |v_ULTIMATE.start_main_#t~pre8#1_55| |v_#pthreadsForks_25|) (= v_~g~0_40 0) (= (select .cse3 |v_~#A~0.offset_253|) 0) (= (select .cse3 (+ |v_~#A~0.offset_253| 8)) 0) (= v_~i~0_65 0) (= |v_#NULL.offset_12| 0) (= 3 |v_~#A~0.base_253|) (= (select .cse3 (+ |v_~#A~0.offset_253| 4)) 0) (= (select |v_#valid_166| 5) 1) (= (select |v_#length_63| 5) 24) (= (select .cse3 (+ |v_~#A~0.offset_253| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) (= (select |v_#valid_166| 0) 0) (= (select .cse2 (+ 16 |v_~#C~0.offset_215|)) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #pthreadsForks=|v_#pthreadsForks_25|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_87|, #length=|v_#length_63|} OutVars{~#B~0.base=|v_~#B~0.base_221|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_120|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_43|, ~h~0=v_~h~0_70, ~#C~0.base=|v_~#C~0.base_215|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_55|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_98|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_64|, #pthreadsForks=|v_#pthreadsForks_24|, ~#C~0.offset=|v_~#C~0.offset_215|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_54|, #length=|v_#length_62|, ~#A~0.base=|v_~#A~0.base_253|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_68|, ~i~0=v_~i~0_65, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_70|, ~g~0=v_~g~0_40, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_72|, ~#B~0.offset=|v_~#B~0.offset_221|, #NULL.base=|v_#NULL.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_68|, ~#A~0.offset=|v_~#A~0.offset_253|, #valid=|v_#valid_165|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_49|, #memory_int=|v_#memory_int_86|} AuxVars[] AssignedVars[~#B~0.base, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet9#1, ~h~0, ~#C~0.base, ULTIMATE.start_main_#t~pre8#1, #NULL.offset, ULTIMATE.start_main_~x~1#1, ULTIMATE.start_main_#t~nondet12#1, #pthreadsForks, ~#C~0.offset, ULTIMATE.start_main_#t~nondet13#1, #length, ~#A~0.base, ULTIMATE.start_main_#t~nondet10#1, ~i~0, ULTIMATE.start_main_#res#1, ~g~0, ULTIMATE.start_main_~#id~0#1.offset, ~#B~0.offset, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ~#A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int] {3590#(not (= |~#C~0.base| |~#A~0.base|))} is VALID [2022-02-21 03:12:30,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {3590#(not (= |~#C~0.base| |~#A~0.base|))} [350] L713-2-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_6|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_8|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_26|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_10|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, t_funThread1of1ForFork0_~z~0#1=|v_t_funThread1of1ForFork0_~z~0#1_8|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_8|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_6|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_14|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_8|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_26|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_~z~0#1, t_funThread1of1ForFork0_#t~nondet2#1, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_#t~nondet5#1] {3590#(not (= |~#C~0.base| |~#A~0.base|))} is VALID [2022-02-21 03:12:30,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {3590#(not (= |~#C~0.base| |~#A~0.base|))} [421] L713-3-->L715: Formula: (let ((.cse0 (select |v_#pthreadsMutex_360| |v_~#B~0.base_79|))) (and (= |v_#pthreadsMutex_359| (store |v_#pthreadsMutex_360| |v_~#B~0.base_79| (store .cse0 |v_~#B~0.offset_79| 1))) (= (select .cse0 |v_~#B~0.offset_79|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_360|, ~#B~0.base=|v_~#B~0.base_79|, ~#B~0.offset=|v_~#B~0.offset_79|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_359|, ~#B~0.base=|v_~#B~0.base_79|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_30|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_7|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_13|, ~#B~0.offset=|v_~#B~0.offset_79|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~pre8#1] {3590#(not (= |~#C~0.base| |~#A~0.base|))} is VALID [2022-02-21 03:12:30,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {3590#(not (= |~#C~0.base| |~#A~0.base|))} [393] L715-->L716: Formula: (let ((.cse0 (select |v_#pthreadsMutex_198| |v_~#A~0.base_53|))) (and (= (store |v_#pthreadsMutex_198| |v_~#A~0.base_53| (store .cse0 |v_~#A~0.offset_53| 1)) |v_#pthreadsMutex_197|) (= (select .cse0 |v_~#A~0.offset_53|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_198|, ~#A~0.offset=|v_~#A~0.offset_53|, ~#A~0.base=|v_~#A~0.base_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_197|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_14|, ~#A~0.offset=|v_~#A~0.offset_53|, ~#A~0.base=|v_~#A~0.base_53|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet11#1] {3591#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#C~0.base| |~#A~0.base|)))} is VALID [2022-02-21 03:12:30,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {3591#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#C~0.base| |~#A~0.base|)))} [474] t_funENTRY-->L694: Formula: (let ((.cse0 (select |v_#pthreadsMutex_917| |v_~#C~0.base_185|))) (and (<= 0 (+ 2147483648 |v_t_funThread1of1ForFork0_#t~nondet1#1_32|)) (= |v_t_funThread1of1ForFork0_~arg#1.offset_7| |v_t_funThread1of1ForFork0_#in~arg#1.offset_7|) (< |v_t_funThread1of1ForFork0_~x~0#1_199| 1000) (<= 0 (+ 2147483648 |v_t_funThread1of1ForFork0_#t~nondet3#1_32|)) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_7| |v_t_funThread1of1ForFork0_~arg#1.base_7|) (= (select .cse0 |v_~#C~0.offset_185|) 0) (<= |v_t_funThread1of1ForFork0_#t~nondet2#1_30| 2147483647) (= |v_t_funThread1of1ForFork0_~x~0#1_199| |v_t_funThread1of1ForFork0_#t~nondet1#1_32|) (= |v_t_funThread1of1ForFork0_~y~0#1_85| |v_t_funThread1of1ForFork0_#t~nondet2#1_30|) (<= 0 (+ 2147483648 |v_t_funThread1of1ForFork0_#t~nondet2#1_30|)) (<= |v_t_funThread1of1ForFork0_#t~nondet3#1_32| 2147483647) (= |v_t_funThread1of1ForFork0_~z~0#1_47| |v_t_funThread1of1ForFork0_#t~nondet3#1_32|) (= |v_#pthreadsMutex_916| (store |v_#pthreadsMutex_917| |v_~#C~0.base_185| (store .cse0 |v_~#C~0.offset_185| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_917|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_32|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_7|, ~#C~0.base=|v_~#C~0.base_185|, ~#C~0.offset=|v_~#C~0.offset_185|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_32|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_7|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_30|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_916|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_199|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_31|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_7|, ~#C~0.base=|v_~#C~0.base_185|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_7|, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_85|, t_funThread1of1ForFork0_~z~0#1=|v_t_funThread1of1ForFork0_~z~0#1_47|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_29|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_69|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_7|, ~#C~0.offset=|v_~#C~0.offset_185|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_31|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_~z~0#1, t_funThread1of1ForFork0_#t~nondet2#1, t_funThread1of1ForFork0_#t~nondet4#1] {3592#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-21 03:12:30,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {3592#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [374] L694-->L695: Formula: (let ((.cse0 (select |v_#pthreadsMutex_106| |v_~#A~0.base_37|))) (and (= (store |v_#pthreadsMutex_106| |v_~#A~0.base_37| (store .cse0 |v_~#A~0.offset_37| 1)) |v_#pthreadsMutex_105|) (= (select .cse0 |v_~#A~0.offset_37|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_106|, ~#A~0.offset=|v_~#A~0.offset_37|, ~#A~0.base=|v_~#A~0.base_37|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#A~0.offset=|v_~#A~0.offset_37|, ~#A~0.base=|v_~#A~0.base_37|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_11|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet5#1] {3589#false} is VALID [2022-02-21 03:12:30,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {3589#false} [204] L716-->L717: Formula: (= 11 v_~i~0_2) InVars {} OutVars{~i~0=v_~i~0_2} AuxVars[] AssignedVars[~i~0] {3589#false} is VALID [2022-02-21 03:12:30,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {3589#false} [356] L717-->L718-1: Formula: (and (<= |v_ULTIMATE.start_main_~x~1#1_22| 2147483664) (= |v_ULTIMATE.start_main_~x~1#1_22| v_~g~0_10)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_22|} OutVars{~g~0=v_~g~0_10, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_22|} AuxVars[] AssignedVars[~g~0] {3589#false} is VALID [2022-02-21 03:12:30,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {3589#false} [309] L695-->L696: Formula: (= |v_t_funThread1of1ForFork0_~x~0#1_7| v_~g~0_3) InVars {~g~0=v_~g~0_3} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_7|, ~g~0=v_~g~0_3} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1] {3589#false} is VALID [2022-02-21 03:12:30,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {3589#false} [440] L696-->L19-1: Formula: (and (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43| |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_69|) (= (ite (<= |v_t_funThread1of1ForFork0_~y~0#1_43| |v_t_funThread1of1ForFork0_~x~0#1_91|) 1 0) |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= v_~h~0_41 |v_t_funThread1of1ForFork0_~y~0#1_43|)) InVars {t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_91|, ~h~0=v_~h~0_41} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_91|, ~h~0=v_~h~0_41, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_43|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_69|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {3589#false} is VALID [2022-02-21 03:12:30,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {3589#false} [462] L19-1-->L700: Formula: (let ((.cse0 (select |v_#pthreadsMutex_780| |v_~#B~0.base_159|))) (and (= |v_#pthreadsMutex_779| (store |v_#pthreadsMutex_780| |v_~#B~0.base_159| (store .cse0 |v_~#B~0.offset_159| 1))) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_120| 0)) (= (select .cse0 |v_~#B~0.offset_159|) 0) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_119| 0)) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_119| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_69|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_69| (ite (= |v_t_funThread1of1ForFork0_~y~0#1_63| |v_t_funThread1of1ForFork0_~x~0#1_161|) 1 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_780|, ~#B~0.base=|v_~#B~0.base_159|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_161|, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_63|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_120|, ~#B~0.offset=|v_~#B~0.offset_159|} OutVars{t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_97|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_69|, #pthreadsMutex=|v_#pthreadsMutex_779|, ~#B~0.base=|v_~#B~0.base_159|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_161|, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_63|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_119|, ~#B~0.offset=|v_~#B~0.offset_159|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, #pthreadsMutex, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {3589#false} is VALID [2022-02-21 03:12:30,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {3589#false} [382] L700-->t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (not (<= |v_t_funThread1of1ForFork0_~x~0#1_45| 2147483616)) (= (store |v_#pthreadsMutex_132| |v_~#B~0.base_33| (store (select |v_#pthreadsMutex_132| |v_~#B~0.base_33|) |v_~#B~0.offset_33| 0)) |v_#pthreadsMutex_131|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_132|, ~#B~0.base=|v_~#B~0.base_33|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_45|, ~#B~0.offset=|v_~#B~0.offset_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_131|, ~#B~0.base=|v_~#B~0.base_33|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_45|, ~#B~0.offset=|v_~#B~0.offset_33|} AuxVars[] AssignedVars[#pthreadsMutex] {3589#false} is VALID [2022-02-21 03:12:30,641 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-21 03:12:30,642 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:12:30,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646843454] [2022-02-21 03:12:30,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646843454] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:12:30,642 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:12:30,642 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:12:30,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345242945] [2022-02-21 03:12:30,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:12:30,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2022-02-21 03:12:30,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:12:30,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-21 03:12:30,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:12:30,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:12:30,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:12:30,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:12:30,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:12:30,654 INFO L87 Difference]: Start difference. First operand 84 states and 145 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-21 03:12:30,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:30,786 INFO L93 Difference]: Finished difference Result 80 states and 126 transitions. [2022-02-21 03:12:30,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:12:30,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2022-02-21 03:12:30,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:12:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-21 03:12:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-02-21 03:12:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-21 03:12:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-02-21 03:12:30,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-02-21 03:12:30,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:12:30,818 INFO L225 Difference]: With dead ends: 80 [2022-02-21 03:12:30,818 INFO L226 Difference]: Without dead ends: 78 [2022-02-21 03:12:30,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:12:30,819 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:12:30,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 6 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:12:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-21 03:12:30,821 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,821 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,821 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,821 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,821 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,821 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,821 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,822 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,822 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,822 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,822 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,822 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,822 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,822 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,822 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,822 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,823 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,823 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,823 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,823 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,823 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,823 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,823 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,823 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,823 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,823 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,824 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,824 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,824 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,824 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,824 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,824 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,824 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,824 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,824 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,825 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,825 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,825 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,825 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,825 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,825 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,825 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,825 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,825 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,826 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,826 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,826 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,826 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,826 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,826 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,826 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,826 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,827 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,827 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,827 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,827 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,827 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,827 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,827 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,828 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,828 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,828 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:30,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 62. [2022-02-21 03:12:30,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:12:30,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 62 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 61 states have internal predecessors, (95), 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-21 03:12:30,829 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 62 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 61 states have internal predecessors, (95), 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-21 03:12:30,829 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 62 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 61 states have internal predecessors, (95), 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-21 03:12:30,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:30,831 INFO L93 Difference]: Finished difference Result 78 states and 123 transitions. [2022-02-21 03:12:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 123 transitions. [2022-02-21 03:12:30,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:12:30,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:12:30,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 61 states have internal predecessors, (95), 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) Second operand 78 states. [2022-02-21 03:12:30,832 INFO L87 Difference]: Start difference. First operand has 62 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 61 states have internal predecessors, (95), 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) Second operand 78 states. [2022-02-21 03:12:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:30,833 INFO L93 Difference]: Finished difference Result 78 states and 123 transitions. [2022-02-21 03:12:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 123 transitions. [2022-02-21 03:12:30,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:12:30,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:12:30,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:12:30,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:12:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 61 states have internal predecessors, (95), 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-21 03:12:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2022-02-21 03:12:30,836 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 12 [2022-02-21 03:12:30,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:12:30,836 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2022-02-21 03:12:30,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-21 03:12:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2022-02-21 03:12:30,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-21 03:12:30,836 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:12:30,836 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:12:30,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:12:30,837 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-21 03:12:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:12:30,837 INFO L85 PathProgramCache]: Analyzing trace with hash -85343621, now seen corresponding path program 1 times [2022-02-21 03:12:30,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:12:30,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504478822] [2022-02-21 03:12:30,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:12:30,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:12:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:12:30,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {3955#true} [483] ULTIMATE.startENTRY-->L713-2: Formula: (let ((.cse1 (select |v_#memory_int_87| 1)) (.cse0 (select |v_#memory_int_87| |v_~#B~0.base_221|)) (.cse3 (select |v_#memory_int_87| |v_~#A~0.base_253|)) (.cse2 (select |v_#memory_int_87| |v_~#C~0.base_215|))) (and (= 4 |v_~#B~0.base_221|) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#id~0#1.base_120|) (= (select .cse0 |v_~#B~0.offset_221|) 0) (= (select .cse1 1) 0) (= (select |v_#valid_166| 1) 1) (= (select |v_#valid_166| 3) 1) (= |v_#NULL.base_12| 0) (= (select .cse0 (+ |v_~#B~0.offset_221| 16)) 0) (= 48 (select .cse1 0)) (= (select |v_#valid_166| 2) 1) (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select .cse0 (+ |v_~#B~0.offset_221| 12))) (= (select |v_#length_63| 3) 24) (< 0 (+ |v_ULTIMATE.start_main_~x~1#1_98| 1000)) (= (select .cse2 (+ 4 |v_~#C~0.offset_215|)) 0) (= |v_~#B~0.offset_221| 0) (= (select .cse3 (+ |v_~#A~0.offset_253| 16)) 0) (= 55 (select |v_#length_63| 2)) (= v_~h~0_70 0) (= |v_#memory_int_86| (store |v_#memory_int_87| |v_ULTIMATE.start_main_~#id~0#1.base_120| (store (select |v_#memory_int_87| |v_ULTIMATE.start_main_~#id~0#1.base_120|) |v_ULTIMATE.start_main_~#id~0#1.offset_72| |v_ULTIMATE.start_main_#t~pre8#1_55|))) (= (+ |v_#pthreadsForks_25| 1) |v_#pthreadsForks_24|) (= (select .cse2 (+ 8 |v_~#C~0.offset_215|)) 0) (= (select .cse2 |v_~#C~0.offset_215|) 0) (= |v_#valid_165| (store |v_#valid_166| |v_ULTIMATE.start_main_~#id~0#1.base_120| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_72| 0) (= (select |v_#valid_166| |v_ULTIMATE.start_main_~#id~0#1.base_120|) 0) (= |v_~#C~0.offset_215| 0) (= (select .cse2 (+ 12 |v_~#C~0.offset_215|)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) (<= |v_ULTIMATE.start_main_~x~1#1_98| 2147483647) (< 0 |v_#StackHeapBarrier_23|) (= (select |v_#length_63| 1) 2) (= (select .cse0 (+ |v_~#B~0.offset_221| 4)) 0) (= |v_~#A~0.offset_253| 0) (= (select |v_#length_63| 4) 24) (= (select |v_#valid_166| 4) 1) (= (select .cse0 (+ |v_~#B~0.offset_221| 8)) 0) (= (store |v_#length_63| |v_ULTIMATE.start_main_~#id~0#1.base_120| 4) |v_#length_62|) (= 5 |v_~#C~0.base_215|) (= |v_ULTIMATE.start_main_#t~pre8#1_55| |v_#pthreadsForks_25|) (= v_~g~0_40 0) (= (select .cse3 |v_~#A~0.offset_253|) 0) (= (select .cse3 (+ |v_~#A~0.offset_253| 8)) 0) (= v_~i~0_65 0) (= |v_#NULL.offset_12| 0) (= 3 |v_~#A~0.base_253|) (= (select .cse3 (+ |v_~#A~0.offset_253| 4)) 0) (= (select |v_#valid_166| 5) 1) (= (select |v_#length_63| 5) 24) (= (select .cse3 (+ |v_~#A~0.offset_253| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) (= (select |v_#valid_166| 0) 0) (= (select .cse2 (+ 16 |v_~#C~0.offset_215|)) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #pthreadsForks=|v_#pthreadsForks_25|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_87|, #length=|v_#length_63|} OutVars{~#B~0.base=|v_~#B~0.base_221|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_120|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_43|, ~h~0=v_~h~0_70, ~#C~0.base=|v_~#C~0.base_215|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_55|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_98|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_64|, #pthreadsForks=|v_#pthreadsForks_24|, ~#C~0.offset=|v_~#C~0.offset_215|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_54|, #length=|v_#length_62|, ~#A~0.base=|v_~#A~0.base_253|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_68|, ~i~0=v_~i~0_65, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_70|, ~g~0=v_~g~0_40, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_72|, ~#B~0.offset=|v_~#B~0.offset_221|, #NULL.base=|v_#NULL.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_68|, ~#A~0.offset=|v_~#A~0.offset_253|, #valid=|v_#valid_165|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_49|, #memory_int=|v_#memory_int_86|} AuxVars[] AssignedVars[~#B~0.base, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet9#1, ~h~0, ~#C~0.base, ULTIMATE.start_main_#t~pre8#1, #NULL.offset, ULTIMATE.start_main_~x~1#1, ULTIMATE.start_main_#t~nondet12#1, #pthreadsForks, ~#C~0.offset, ULTIMATE.start_main_#t~nondet13#1, #length, ~#A~0.base, ULTIMATE.start_main_#t~nondet10#1, ~i~0, ULTIMATE.start_main_#res#1, ~g~0, ULTIMATE.start_main_~#id~0#1.offset, ~#B~0.offset, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ~#A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int] {3957#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-21 03:12:30,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {3957#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [350] L713-2-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_6|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_8|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_26|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_10|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, t_funThread1of1ForFork0_~z~0#1=|v_t_funThread1of1ForFork0_~z~0#1_8|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_8|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_6|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_14|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_8|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_26|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_~z~0#1, t_funThread1of1ForFork0_#t~nondet2#1, t_funThread1of1ForFork0_#t~nondet4#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_#t~nondet5#1] {3957#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-21 03:12:30,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {3957#(and (not (= |~#B~0.base| |~#C~0.base|)) (not (= |~#B~0.base| |~#A~0.base|)))} [421] L713-3-->L715: Formula: (let ((.cse0 (select |v_#pthreadsMutex_360| |v_~#B~0.base_79|))) (and (= |v_#pthreadsMutex_359| (store |v_#pthreadsMutex_360| |v_~#B~0.base_79| (store .cse0 |v_~#B~0.offset_79| 1))) (= (select .cse0 |v_~#B~0.offset_79|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_360|, ~#B~0.base=|v_~#B~0.base_79|, ~#B~0.offset=|v_~#B~0.offset_79|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_359|, ~#B~0.base=|v_~#B~0.base_79|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_30|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_7|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_13|, ~#B~0.offset=|v_~#B~0.offset_79|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~pre8#1] {3958#(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-21 03:12:30,938 INFO L290 TraceCheckUtils]: 3: Hoare triple {3958#(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|)))} [393] L715-->L716: Formula: (let ((.cse0 (select |v_#pthreadsMutex_198| |v_~#A~0.base_53|))) (and (= (store |v_#pthreadsMutex_198| |v_~#A~0.base_53| (store .cse0 |v_~#A~0.offset_53| 1)) |v_#pthreadsMutex_197|) (= (select .cse0 |v_~#A~0.offset_53|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_198|, ~#A~0.offset=|v_~#A~0.offset_53|, ~#A~0.base=|v_~#A~0.base_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_197|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_14|, ~#A~0.offset=|v_~#A~0.offset_53|, ~#A~0.base=|v_~#A~0.base_53|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet11#1] {3958#(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-21 03:12:30,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {3958#(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|)))} [474] t_funENTRY-->L694: Formula: (let ((.cse0 (select |v_#pthreadsMutex_917| |v_~#C~0.base_185|))) (and (<= 0 (+ 2147483648 |v_t_funThread1of1ForFork0_#t~nondet1#1_32|)) (= |v_t_funThread1of1ForFork0_~arg#1.offset_7| |v_t_funThread1of1ForFork0_#in~arg#1.offset_7|) (< |v_t_funThread1of1ForFork0_~x~0#1_199| 1000) (<= 0 (+ 2147483648 |v_t_funThread1of1ForFork0_#t~nondet3#1_32|)) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_7| |v_t_funThread1of1ForFork0_~arg#1.base_7|) (= (select .cse0 |v_~#C~0.offset_185|) 0) (<= |v_t_funThread1of1ForFork0_#t~nondet2#1_30| 2147483647) (= |v_t_funThread1of1ForFork0_~x~0#1_199| |v_t_funThread1of1ForFork0_#t~nondet1#1_32|) (= |v_t_funThread1of1ForFork0_~y~0#1_85| |v_t_funThread1of1ForFork0_#t~nondet2#1_30|) (<= 0 (+ 2147483648 |v_t_funThread1of1ForFork0_#t~nondet2#1_30|)) (<= |v_t_funThread1of1ForFork0_#t~nondet3#1_32| 2147483647) (= |v_t_funThread1of1ForFork0_~z~0#1_47| |v_t_funThread1of1ForFork0_#t~nondet3#1_32|) (= |v_#pthreadsMutex_916| (store |v_#pthreadsMutex_917| |v_~#C~0.base_185| (store .cse0 |v_~#C~0.offset_185| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_917|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_32|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_7|, ~#C~0.base=|v_~#C~0.base_185|, ~#C~0.offset=|v_~#C~0.offset_185|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_32|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_7|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_30|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_916|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_199|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_31|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_7|, ~#C~0.base=|v_~#C~0.base_185|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_7|, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_85|, t_funThread1of1ForFork0_~z~0#1=|v_t_funThread1of1ForFork0_~z~0#1_47|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_29|, t_funThread1of1ForFork0_#t~nondet4#1=|v_t_funThread1of1ForFork0_#t~nondet4#1_69|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_7|, ~#C~0.offset=|v_~#C~0.offset_185|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_31|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_~z~0#1, t_funThread1of1ForFork0_#t~nondet2#1, t_funThread1of1ForFork0_#t~nondet4#1] {3959#(and (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-21 03:12:30,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {3959#(and (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [204] L716-->L717: Formula: (= 11 v_~i~0_2) InVars {} OutVars{~i~0=v_~i~0_2} AuxVars[] AssignedVars[~i~0] {3959#(and (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-21 03:12:30,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {3959#(and (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [356] L717-->L718-1: Formula: (and (<= |v_ULTIMATE.start_main_~x~1#1_22| 2147483664) (= |v_ULTIMATE.start_main_~x~1#1_22| v_~g~0_10)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_22|} OutVars{~g~0=v_~g~0_10, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_22|} AuxVars[] AssignedVars[~g~0] {3959#(and (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-21 03:12:30,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {3959#(and (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [395] L718-1-->L719: Formula: (and (= v_~h~0_15 (+ |v_ULTIMATE.start_main_~x~1#1_32| (- 17))) (<= 0 (+ |v_ULTIMATE.start_main_~x~1#1_32| 2147483631))) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_32|} OutVars{~h~0=v_~h~0_15, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_32|} AuxVars[] AssignedVars[~h~0] {3959#(and (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-21 03:12:30,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {3959#(and (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [231] L719-->L720: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#A~0.base_8| (store (select |v_#pthreadsMutex_6| |v_~#A~0.base_8|) |v_~#A~0.offset_8| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#A~0.offset=|v_~#A~0.offset_8|, ~#A~0.base=|v_~#A~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#A~0.offset=|v_~#A~0.offset_8|, ~#A~0.base=|v_~#A~0.base_8|} AuxVars[] AssignedVars[#pthreadsMutex] {3959#(and (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-21 03:12:30,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {3959#(and (= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [374] L694-->L695: Formula: (let ((.cse0 (select |v_#pthreadsMutex_106| |v_~#A~0.base_37|))) (and (= (store |v_#pthreadsMutex_106| |v_~#A~0.base_37| (store .cse0 |v_~#A~0.offset_37| 1)) |v_#pthreadsMutex_105|) (= (select .cse0 |v_~#A~0.offset_37|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_106|, ~#A~0.offset=|v_~#A~0.offset_37|, ~#A~0.base=|v_~#A~0.base_37|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#A~0.offset=|v_~#A~0.offset_37|, ~#A~0.base=|v_~#A~0.base_37|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_11|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet5#1] {3960#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} is VALID [2022-02-21 03:12:30,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {3960#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} [309] L695-->L696: Formula: (= |v_t_funThread1of1ForFork0_~x~0#1_7| v_~g~0_3) InVars {~g~0=v_~g~0_3} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_7|, ~g~0=v_~g~0_3} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1] {3960#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} is VALID [2022-02-21 03:12:30,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {3960#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} [440] L696-->L19-1: Formula: (and (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43| |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_69|) (= (ite (<= |v_t_funThread1of1ForFork0_~y~0#1_43| |v_t_funThread1of1ForFork0_~x~0#1_91|) 1 0) |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|) (= v_~h~0_41 |v_t_funThread1of1ForFork0_~y~0#1_43|)) InVars {t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_91|, ~h~0=v_~h~0_41} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_91|, ~h~0=v_~h~0_41, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_43|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_69|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {3960#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} is VALID [2022-02-21 03:12:30,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {3960#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} [462] L19-1-->L700: Formula: (let ((.cse0 (select |v_#pthreadsMutex_780| |v_~#B~0.base_159|))) (and (= |v_#pthreadsMutex_779| (store |v_#pthreadsMutex_780| |v_~#B~0.base_159| (store .cse0 |v_~#B~0.offset_159| 1))) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_120| 0)) (= (select .cse0 |v_~#B~0.offset_159|) 0) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_119| 0)) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_119| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_69|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_69| (ite (= |v_t_funThread1of1ForFork0_~y~0#1_63| |v_t_funThread1of1ForFork0_~x~0#1_161|) 1 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_780|, ~#B~0.base=|v_~#B~0.base_159|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_161|, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_63|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_120|, ~#B~0.offset=|v_~#B~0.offset_159|} OutVars{t_funThread1of1ForFork0_#t~nondet6#1=|v_t_funThread1of1ForFork0_#t~nondet6#1_97|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_69|, #pthreadsMutex=|v_#pthreadsMutex_779|, ~#B~0.base=|v_~#B~0.base_159|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_161|, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_63|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_119|, ~#B~0.offset=|v_~#B~0.offset_159|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet6#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, #pthreadsMutex, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {3956#false} is VALID [2022-02-21 03:12:30,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {3956#false} [382] L700-->t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (not (<= |v_t_funThread1of1ForFork0_~x~0#1_45| 2147483616)) (= (store |v_#pthreadsMutex_132| |v_~#B~0.base_33| (store (select |v_#pthreadsMutex_132| |v_~#B~0.base_33|) |v_~#B~0.offset_33| 0)) |v_#pthreadsMutex_131|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_132|, ~#B~0.base=|v_~#B~0.base_33|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_45|, ~#B~0.offset=|v_~#B~0.offset_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_131|, ~#B~0.base=|v_~#B~0.base_33|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_45|, ~#B~0.offset=|v_~#B~0.offset_33|} AuxVars[] AssignedVars[#pthreadsMutex] {3956#false} is VALID [2022-02-21 03:12:30,945 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-21 03:12:30,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:12:30,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504478822] [2022-02-21 03:12:30,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504478822] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:12:30,945 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:12:30,946 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:12:30,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678558501] [2022-02-21 03:12:30,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:12:30,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2022-02-21 03:12:30,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:12:30,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-21 03:12:30,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:12:30,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:12:30,960 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:12:30,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:12:30,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:12:30,961 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-21 03:12:31,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:31,082 INFO L93 Difference]: Finished difference Result 56 states and 86 transitions. [2022-02-21 03:12:31,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:12:31,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2022-02-21 03:12:31,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:12:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-21 03:12:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-02-21 03:12:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-21 03:12:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-02-21 03:12:31,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-02-21 03:12:31,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:12:31,110 INFO L225 Difference]: With dead ends: 56 [2022-02-21 03:12:31,110 INFO L226 Difference]: Without dead ends: 53 [2022-02-21 03:12:31,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:12:31,111 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:12:31,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 5 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:12:31,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-21 03:12:31,112 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,113 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,113 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,113 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,113 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,113 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,113 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,113 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,113 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,113 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,113 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,113 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,114 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,114 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,114 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,114 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,114 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,114 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,114 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,114 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,114 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,114 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,115 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,115 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,115 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,116 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,116 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,116 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,117 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,117 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,117 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,117 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,117 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,117 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,118 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,118 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,118 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,118 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,118 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,118 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,119 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,119 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,119 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,119 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,119 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,119 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,120 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,120 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,120 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,120 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,120 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,120 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,121 WARN L146 ateFactoryRefinement]: Check not implemented [2022-02-21 03:12:31,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-02-21 03:12:31,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:12:31,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 52 states have internal predecessors, (83), 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-21 03:12:31,122 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 52 states have internal predecessors, (83), 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-21 03:12:31,122 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 52 states have internal predecessors, (83), 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-21 03:12:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:31,123 INFO L93 Difference]: Finished difference Result 53 states and 83 transitions. [2022-02-21 03:12:31,123 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 83 transitions. [2022-02-21 03:12:31,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:12:31,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:12:31,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 52 states have internal predecessors, (83), 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) Second operand 53 states. [2022-02-21 03:12:31,124 INFO L87 Difference]: Start difference. First operand has 53 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 52 states have internal predecessors, (83), 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) Second operand 53 states. [2022-02-21 03:12:31,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:12:31,125 INFO L93 Difference]: Finished difference Result 53 states and 83 transitions. [2022-02-21 03:12:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 83 transitions. [2022-02-21 03:12:31,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:12:31,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:12:31,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:12:31,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:12:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 52 states have internal predecessors, (83), 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-21 03:12:31,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2022-02-21 03:12:31,128 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 83 transitions. Word has length 14 [2022-02-21 03:12:31,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:12:31,128 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 83 transitions. [2022-02-21 03:12:31,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-21 03:12:31,128 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 83 transitions. [2022-02-21 03:12:31,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 03:12:31,129 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:12:31,129 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:12:31,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 03:12:31,129 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-21 03:12:31,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:12:31,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1725003184, now seen corresponding path program 1 times [2022-02-21 03:12:31,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:12:31,130 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343236766] [2022-02-21 03:12:31,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:12:31,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:12:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:12:31,160 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:12:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:12:31,206 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:12:31,207 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 03:12:31,207 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2022-02-21 03:12:31,209 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2022-02-21 03:12:31,209 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 7 remaining) [2022-02-21 03:12:31,209 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 7 remaining) [2022-02-21 03:12:31,209 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2022-02-21 03:12:31,210 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2022-02-21 03:12:31,210 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2022-02-21 03:12:31,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-21 03:12:31,211 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:12:31,216 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-21 03:12:31,216 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:12:31,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:12:31 BasicIcfg [2022-02-21 03:12:31,279 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:12:31,280 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:12:31,280 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:12:31,280 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:12:31,280 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:12:23" (3/4) ... [2022-02-21 03:12:31,281 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-21 03:12:31,339 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:12:31,339 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:12:31,340 INFO L158 Benchmark]: Toolchain (without parser) took 9305.36ms. Allocated memory was 92.3MB in the beginning and 153.1MB in the end (delta: 60.8MB). Free memory was 53.9MB in the beginning and 48.3MB in the end (delta: 5.6MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. [2022-02-21 03:12:31,341 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:12:31,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.15ms. Allocated memory is still 92.3MB. Free memory was 53.7MB in the beginning and 52.5MB in the end (delta: 1.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:12:31,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.92ms. Allocated memory is still 92.3MB. Free memory was 52.3MB in the beginning and 49.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:12:31,341 INFO L158 Benchmark]: Boogie Preprocessor took 22.55ms. Allocated memory is still 92.3MB. Free memory was 49.9MB in the beginning and 48.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:12:31,342 INFO L158 Benchmark]: RCFGBuilder took 497.63ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 48.1MB in the beginning and 83.4MB in the end (delta: -35.2MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2022-02-21 03:12:31,342 INFO L158 Benchmark]: TraceAbstraction took 8165.97ms. Allocated memory was 115.3MB in the beginning and 153.1MB in the end (delta: 37.7MB). Free memory was 82.8MB in the beginning and 54.5MB in the end (delta: 28.2MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2022-02-21 03:12:31,342 INFO L158 Benchmark]: Witness Printer took 59.91ms. Allocated memory is still 153.1MB. Free memory was 54.5MB in the beginning and 48.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:12:31,344 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 92.3MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 479.15ms. Allocated memory is still 92.3MB. Free memory was 53.7MB in the beginning and 52.5MB in the end (delta: 1.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.92ms. Allocated memory is still 92.3MB. Free memory was 52.3MB in the beginning and 49.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.55ms. Allocated memory is still 92.3MB. Free memory was 49.9MB in the beginning and 48.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 497.63ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 48.1MB in the beginning and 83.4MB in the end (delta: -35.2MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8165.97ms. Allocated memory was 115.3MB in the beginning and 153.1MB in the end (delta: 37.7MB). Free memory was 82.8MB in the beginning and 54.5MB in the end (delta: 28.2MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. * Witness Printer took 59.91ms. Allocated memory is still 153.1MB. Free memory was 54.5MB in the beginning and 48.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 133 PlacesBefore, 34 PlacesAfterwards, 134 TransitionsBefore, 34 TransitionsAfterwards, 3364 CoEnabledTransitionPairs, 8 FixpointIterations, 47 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 22 ConcurrentYvCompositions, 1 ChoiceCompositions, 135 TotalNumberOfCompositions, 9929 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4784, positive: 4418, positive conditional: 0, positive unconditional: 4418, negative: 366, negative conditional: 0, negative unconditional: 366, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2671, positive: 2571, positive conditional: 0, positive unconditional: 2571, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2671, positive: 2456, positive conditional: 0, positive unconditional: 2456, negative: 215, negative conditional: 0, negative unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 215, positive: 115, positive conditional: 0, positive unconditional: 115, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 588, positive: 241, positive conditional: 0, positive unconditional: 241, negative: 348, negative conditional: 0, negative unconditional: 348, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4784, positive: 1847, positive conditional: 0, positive unconditional: 1847, negative: 266, negative conditional: 0, negative unconditional: 266, unknown: 2671, unknown conditional: 0, unknown unconditional: 2671] , Statistics on independence cache: Total cache size (in pairs): 254, Positive cache size: 216, Positive conditional cache size: 0, Positive unconditional cache size: 216, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38 - 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 - CounterExampleResult [Line: 701]: integer overflow possible integer overflow possible We found a FailurePath: [L682] 0 int g = 0; [L683] 0 int h = 0; [L684] 0 int i = 0; [L685] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L686] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L687] 0 pthread_mutex_t C = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L710] 0 int x = __VERIFIER_nondet_int(); [L711] COND TRUE 0 x > -1000 [L712] 0 pthread_t id; [L713] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [A={3:0}, B={4:0}, C={5:0}, g=0, h=0, i=0, id={6:0}, pthread_create(&id, ((void *)0), t_fun, ((void *)0))=-1, x=2147483617] [L689] 1 int x = __VERIFIER_nondet_int(); [L690] 1 int y = __VERIFIER_nondet_int(); [L691] 1 int z = __VERIFIER_nondet_int(); [L692] COND TRUE 1 x < 1000 [L716] 0 i = 11 VAL [A={3:0}, B={4:0}, C={5:0}, g=0, h=0, i=11, id={6:0}, x=2147483617] [L717] 0 g = x [L718] EXPR 0 x - 17 [L718] 0 h = x - 17 VAL [A={3:0}, B={4:0}, C={5:0}, g=2147483617, h=2147483600, i=11, id={6:0}, x=2147483617] [L721] 0 h = x VAL [A={3:0}, B={4:0}, C={5:0}, g=2147483617, h=2147483617, i=11, id={6:0}, x=2147483617] [L695] 1 x = g VAL [A={3:0}, arg={0:0}, arg={0:0}, B={4:0}, C={5:0}, g=2147483617, h=2147483617, i=11, x=2147483617, y=0, z=-2] [L696] 1 y = h [L697] CALL 1 __VERIFIER_assert(y <= x) [L19] COND FALSE 1 !(!(cond)) [L697] RET 1 __VERIFIER_assert(y <= x) [L699] CALL 1 __VERIFIER_assert(x == y) [L19] COND FALSE 1 !(!(cond)) [L699] RET 1 __VERIFIER_assert(x == y) [L701] 1 x + 31 VAL [A={3:0}, arg={0:0}, arg={0:0}, B={4:0}, C={5:0}, g=2147483617, h=2147483617, i=11, x=2147483617, y=2147483617, z=-2] - UnprovableResult [Line: 718]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 186 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 154 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 170 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 247 IncrementalHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 50 mSDtfsCounter, 247 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=0, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 RESULT: Ultimate proved your program to be incorrect! [2022-02-21 03:12:31,377 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)