/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-1_2-join.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:38:34,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:38:34,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:38:34,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:38:34,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:38:34,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:38:34,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:38:34,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:38:34,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:38:34,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:38:34,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:38:34,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:38:34,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:38:34,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:38:34,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:38:34,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:38:34,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:38:34,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:38:34,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:38:34,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:38:34,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:38:34,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:38:34,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:38:34,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:38:34,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:38:34,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:38:34,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:38:34,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:38:34,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:38:34,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:38:34,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:38:34,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:38:34,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:38:34,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:38:34,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:38:34,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:38:34,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:38:34,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:38:34,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:38:34,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:38:34,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:38:34,430 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:38:34,468 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:38:34,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:38:34,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:38:34,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:38:34,471 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:38:34,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:38:34,472 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:38:34,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:38:34,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:38:34,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:38:34,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:38:34,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:38:34,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:38:34,474 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:38:34,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:38:34,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:38:34,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:38:34,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:38:34,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:38:34,475 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:38:34,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:38:34,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:38:34,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:38:34,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:38:34,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:38:34,476 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:38:34,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:38:34,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:38:34,476 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:38:34,476 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 [2022-12-13 09:38:34,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:38:34,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:38:34,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:38:34,762 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:38:34,763 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:38:34,764 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-1_2-join.i [2022-12-13 09:38:36,048 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:38:36,394 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:38:36,394 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_2-join.i [2022-12-13 09:38:36,414 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51238ff93/f1d26714de1d4e5d82ead382618c9da2/FLAGfadbff014 [2022-12-13 09:38:36,437 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51238ff93/f1d26714de1d4e5d82ead382618c9da2 [2022-12-13 09:38:36,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:38:36,440 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:38:36,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:38:36,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:38:36,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:38:36,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:38:36" (1/1) ... [2022-12-13 09:38:36,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20eb060a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:36, skipping insertion in model container [2022-12-13 09:38:36,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:38:36" (1/1) ... [2022-12-13 09:38:36,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:38:36,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:38:37,015 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_2-join.i[76153,76166] [2022-12-13 09:38:37,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:37,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:37,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:37,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:37,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:37,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:37,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:38:37,053 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:38:37,085 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_2-join.i[76153,76166] [2022-12-13 09:38:37,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:37,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:37,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:37,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:37,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:37,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:37,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:38:37,180 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:38:37,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:37 WrapperNode [2022-12-13 09:38:37,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:38:37,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:38:37,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:38:37,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:38:37,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:37" (1/1) ... [2022-12-13 09:38:37,213 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:37" (1/1) ... [2022-12-13 09:38:37,234 INFO L138 Inliner]: procedures = 482, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2022-12-13 09:38:37,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:38:37,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:38:37,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:38:37,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:38:37,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:37" (1/1) ... [2022-12-13 09:38:37,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:37" (1/1) ... [2022-12-13 09:38:37,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:37" (1/1) ... [2022-12-13 09:38:37,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:37" (1/1) ... [2022-12-13 09:38:37,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:37" (1/1) ... [2022-12-13 09:38:37,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:37" (1/1) ... [2022-12-13 09:38:37,287 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:37" (1/1) ... [2022-12-13 09:38:37,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:37" (1/1) ... [2022-12-13 09:38:37,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:38:37,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:38:37,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:38:37,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:38:37,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:37" (1/1) ... [2022-12-13 09:38:37,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:38:37,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:38:37,349 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-12-13 09:38:37,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:38:37,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:38:37,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:38:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:38:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 09:38:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 09:38:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:38:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 09:38:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:38:37,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:38:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:38:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 09:38:37,392 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 09:38:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:38:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:38:37,393 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:38:37,599 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:38:37,613 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:38:37,756 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:38:37,787 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:38:37,788 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:38:37,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:38:37 BoogieIcfgContainer [2022-12-13 09:38:37,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:38:37,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:38:37,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:38:37,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:38:37,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:38:36" (1/3) ... [2022-12-13 09:38:37,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7a1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:38:37, skipping insertion in model container [2022-12-13 09:38:37,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:37" (2/3) ... [2022-12-13 09:38:37,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7a1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:38:37, skipping insertion in model container [2022-12-13 09:38:37,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:38:37" (3/3) ... [2022-12-13 09:38:37,799 INFO L112 eAbstractionObserver]: Analyzing ICFG race-1_2-join.i [2022-12-13 09:38:37,811 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:38:37,811 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-12-13 09:38:37,812 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:38:37,894 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-13 09:38:37,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 94 transitions, 196 flow [2022-12-13 09:38:37,976 INFO L130 PetriNetUnfolder]: 4/105 cut-off events. [2022-12-13 09:38:37,976 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 09:38:37,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 105 events. 4/105 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 136 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 62. Up to 3 conditions per place. [2022-12-13 09:38:37,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 94 transitions, 196 flow [2022-12-13 09:38:37,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 77 transitions, 160 flow [2022-12-13 09:38:37,982 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:37,997 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 77 transitions, 160 flow [2022-12-13 09:38:38,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 77 transitions, 160 flow [2022-12-13 09:38:38,019 INFO L130 PetriNetUnfolder]: 1/77 cut-off events. [2022-12-13 09:38:38,019 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 09:38:38,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 77 events. 1/77 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-12-13 09:38:38,022 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 77 transitions, 160 flow [2022-12-13 09:38:38,022 INFO L226 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-13 09:38:40,734 INFO L241 LiptonReduction]: Total number of compositions: 68 [2022-12-13 09:38:40,758 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:38:40,763 INFO L357 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=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ad42c80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:38:40,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 09:38:40,765 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 09:38:40,765 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:38:40,768 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:40,769 INFO L214 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 09:38:40,773 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 09:38:40,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:40,778 INFO L85 PathProgramCache]: Analyzing trace with hash 359, now seen corresponding path program 1 times [2022-12-13 09:38:40,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:40,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038122952] [2022-12-13 09:38:40,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:40,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:40,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:38:40,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:40,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038122952] [2022-12-13 09:38:40,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038122952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:40,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:40,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 09:38:40,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152125775] [2022-12-13 09:38:40,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:40,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 09:38:40,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:41,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 09:38:41,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 09:38:41,011 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-13 09:38:41,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 38 flow. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-12-13 09:38:41,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:41,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-13 09:38:41,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:41,043 INFO L130 PetriNetUnfolder]: 18/49 cut-off events. [2022-12-13 09:38:41,043 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 09:38:41,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 49 events. 18/49 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 180 event pairs, 18 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 91. Up to 49 conditions per place. [2022-12-13 09:38:41,044 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 10 selfloop transitions, 0 changer transitions 2/13 dead transitions. [2022-12-13 09:38:41,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 13 transitions, 56 flow [2022-12-13 09:38:41,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:38:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 09:38:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 17 transitions. [2022-12-13 09:38:41,052 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.53125 [2022-12-13 09:38:41,053 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 38 flow. Second operand 2 states and 17 transitions. [2022-12-13 09:38:41,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 13 transitions, 56 flow [2022-12-13 09:38:41,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 13 transitions, 52 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:38:41,057 INFO L231 Difference]: Finished difference. Result has 16 places, 11 transitions, 23 flow [2022-12-13 09:38:41,058 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=28, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=23, PETRI_PLACES=16, PETRI_TRANSITIONS=11} [2022-12-13 09:38:41,060 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, -4 predicate places. [2022-12-13 09:38:41,061 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:41,061 INFO L89 Accepts]: Start accepts. Operand has 16 places, 11 transitions, 23 flow [2022-12-13 09:38:41,063 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:41,063 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:41,063 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 16 places, 11 transitions, 23 flow [2022-12-13 09:38:41,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 13 places, 11 transitions, 23 flow [2022-12-13 09:38:41,074 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-13 09:38:41,074 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:38:41,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13 conditions, 11 events. 0/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 29 event pairs, 0 based on Foata normal form. 0/5 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 09:38:41,076 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 13 places, 11 transitions, 23 flow [2022-12-13 09:38:41,077 INFO L226 LiptonReduction]: Number of co-enabled transitions 28 [2022-12-13 09:38:41,081 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:41,083 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 09:38:41,083 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 11 transitions, 23 flow [2022-12-13 09:38:41,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-12-13 09:38:41,083 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:41,083 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 09:38:41,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:38:41,084 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 09:38:41,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:41,089 INFO L85 PathProgramCache]: Analyzing trace with hash 11117313, now seen corresponding path program 1 times [2022-12-13 09:38:41,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:41,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088052874] [2022-12-13 09:38:41,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:41,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:38:41,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:41,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088052874] [2022-12-13 09:38:41,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088052874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:41,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:41,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:41,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009569389] [2022-12-13 09:38:41,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:41,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:38:41,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:41,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:38:41,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:38:41,252 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 11 [2022-12-13 09:38:41,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 13 places, 11 transitions, 23 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-12-13 09:38:41,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:41,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 11 [2022-12-13 09:38:41,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:41,275 INFO L130 PetriNetUnfolder]: 2/26 cut-off events. [2022-12-13 09:38:41,276 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:38:41,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 26 events. 2/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 99 event pairs, 0 based on Foata normal form. 7/23 useless extension candidates. Maximal degree in co-relation 13. Up to 17 conditions per place. [2022-12-13 09:38:41,276 INFO L137 encePairwiseOnDemand]: 5/11 looper letters, 3 selfloop transitions, 5 changer transitions 9/17 dead transitions. [2022-12-13 09:38:41,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 15 places, 17 transitions, 67 flow [2022-12-13 09:38:41,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:38:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:38:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-12-13 09:38:41,277 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2022-12-13 09:38:41,277 INFO L175 Difference]: Start difference. First operand has 13 places, 11 transitions, 23 flow. Second operand 3 states and 20 transitions. [2022-12-13 09:38:41,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 15 places, 17 transitions, 67 flow [2022-12-13 09:38:41,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 17 transitions, 67 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:38:41,278 INFO L231 Difference]: Finished difference. Result has 16 places, 8 transitions, 34 flow [2022-12-13 09:38:41,278 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=11, PETRI_DIFFERENCE_MINUEND_FLOW=23, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=34, PETRI_PLACES=16, PETRI_TRANSITIONS=8} [2022-12-13 09:38:41,279 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, -4 predicate places. [2022-12-13 09:38:41,279 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:41,279 INFO L89 Accepts]: Start accepts. Operand has 16 places, 8 transitions, 34 flow [2022-12-13 09:38:41,279 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:41,279 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:41,279 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 16 places, 8 transitions, 34 flow [2022-12-13 09:38:41,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 13 places, 8 transitions, 34 flow [2022-12-13 09:38:41,281 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-13 09:38:41,281 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 09:38:41,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 11 events. 0/11 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 18 event pairs, 0 based on Foata normal form. 0/8 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2022-12-13 09:38:41,282 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 13 places, 8 transitions, 34 flow [2022-12-13 09:38:41,282 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 09:38:41,299 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [257] L1712-4-->L1715: Formula: (= 2 v_~pdev~0_23) InVars {} OutVars{~pdev~0=v_~pdev~0_23, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_11|, ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_5|} AuxVars[] AssignedVars[~pdev~0, ULTIMATE.start_module_init_#t~pre33#1, ULTIMATE.start_module_init_#t~nondet34#1] and [292] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#pthreadsMutex_94| |v_~#mutex~0.base_54|))) (and (= |v_thread1Thread1of1ForFork0_#res.offset_23| 0) (= (select .cse0 |v_~#mutex~0.offset_54|) 0) (= |v_thread1Thread1of1ForFork0_#in~arg.offset_15| v_thread1Thread1of1ForFork0_~arg.offset_15) (= |v_thread1Thread1of1ForFork0_#in~arg.base_15| v_thread1Thread1of1ForFork0_~arg.base_15) (= |v_thread1Thread1of1ForFork0_#res.base_23| 0) (= 6 v_~pdev~0_67) (= |v_#pthreadsMutex_93| (store |v_#pthreadsMutex_94| |v_~#mutex~0.base_54| (store .cse0 |v_~#mutex~0.offset_54| 0))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_94|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_15|, ~#mutex~0.base=|v_~#mutex~0.base_54|, ~#mutex~0.offset=|v_~#mutex~0.offset_54|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_93|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_15|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_23|, ~#mutex~0.base=|v_~#mutex~0.base_54|, ~pdev~0=v_~pdev~0_67, thread1Thread1of1ForFork0_~arg.offset=v_thread1Thread1of1ForFork0_~arg.offset_15, thread1Thread1of1ForFork0_~arg.base=v_thread1Thread1of1ForFork0_~arg.base_15, ~#mutex~0.offset=|v_~#mutex~0.offset_54|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_23|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_15|, thread1Thread1of1ForFork0_#t~nondet31=|v_thread1Thread1of1ForFork0_#t~nondet31_47|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork0_#res.base, ~pdev~0, thread1Thread1of1ForFork0_~arg.offset, thread1Thread1of1ForFork0_~arg.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_#t~nondet31] [2022-12-13 09:38:41,339 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [257] L1712-4-->L1715: Formula: (= 2 v_~pdev~0_23) InVars {} OutVars{~pdev~0=v_~pdev~0_23, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_11|, ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_5|} AuxVars[] AssignedVars[~pdev~0, ULTIMATE.start_module_init_#t~pre33#1, ULTIMATE.start_module_init_#t~nondet34#1] and [289] $Ultimate##0-->L1703: Formula: (let ((.cse0 (select |v_#pthreadsMutex_82| |v_~#mutex~0.base_48|))) (and (= |v_#pthreadsMutex_81| (store |v_#pthreadsMutex_82| |v_~#mutex~0.base_48| (store .cse0 |v_~#mutex~0.offset_48| 1))) (= |v_thread1Thread1of1ForFork0_#in~arg.base_9| v_thread1Thread1of1ForFork0_~arg.base_9) (= (select .cse0 |v_~#mutex~0.offset_48|) 0) (= |v_thread1Thread1of1ForFork0_#in~arg.offset_9| v_thread1Thread1of1ForFork0_~arg.offset_9) (= 6 v_~pdev~0_61))) InVars {#pthreadsMutex=|v_#pthreadsMutex_82|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_9|, ~#mutex~0.base=|v_~#mutex~0.base_48|, ~#mutex~0.offset=|v_~#mutex~0.offset_48|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_81|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_9|, ~#mutex~0.base=|v_~#mutex~0.base_48|, ~pdev~0=v_~pdev~0_61, thread1Thread1of1ForFork0_~arg.offset=v_thread1Thread1of1ForFork0_~arg.offset_9, thread1Thread1of1ForFork0_~arg.base=v_thread1Thread1of1ForFork0_~arg.base_9, ~#mutex~0.offset=|v_~#mutex~0.offset_48|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_9|, thread1Thread1of1ForFork0_#t~nondet31=|v_thread1Thread1of1ForFork0_#t~nondet31_41|} AuxVars[] AssignedVars[#pthreadsMutex, ~pdev~0, thread1Thread1of1ForFork0_~arg.offset, thread1Thread1of1ForFork0_~arg.base, thread1Thread1of1ForFork0_#t~nondet31] [2022-12-13 09:38:41,370 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [257] L1712-4-->L1715: Formula: (= 2 v_~pdev~0_23) InVars {} OutVars{~pdev~0=v_~pdev~0_23, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_11|, ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_5|} AuxVars[] AssignedVars[~pdev~0, ULTIMATE.start_module_init_#t~pre33#1, ULTIMATE.start_module_init_#t~nondet34#1] and [290] $Ultimate##0-->thread1FINAL: Formula: (let ((.cse0 (select |v_#pthreadsMutex_86| |v_~#mutex~0.base_50|))) (and (= |v_thread1Thread1of1ForFork0_#res.base_21| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_21| 0) (= |v_thread1Thread1of1ForFork0_#in~arg.base_11| v_thread1Thread1of1ForFork0_~arg.base_11) (= 6 v_~pdev~0_63) (= (select .cse0 |v_~#mutex~0.offset_50|) 0) (= |v_#pthreadsMutex_85| (store |v_#pthreadsMutex_86| |v_~#mutex~0.base_50| (store .cse0 |v_~#mutex~0.offset_50| 0))) (= |v_thread1Thread1of1ForFork0_#in~arg.offset_11| v_thread1Thread1of1ForFork0_~arg.offset_11))) InVars {#pthreadsMutex=|v_#pthreadsMutex_86|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_11|, ~#mutex~0.base=|v_~#mutex~0.base_50|, ~#mutex~0.offset=|v_~#mutex~0.offset_50|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_85|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_11|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_21|, ~#mutex~0.base=|v_~#mutex~0.base_50|, ~pdev~0=v_~pdev~0_63, thread1Thread1of1ForFork0_~arg.offset=v_thread1Thread1of1ForFork0_~arg.offset_11, thread1Thread1of1ForFork0_~arg.base=v_thread1Thread1of1ForFork0_~arg.base_11, ~#mutex~0.offset=|v_~#mutex~0.offset_50|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_21|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_11|, thread1Thread1of1ForFork0_#t~nondet31=|v_thread1Thread1of1ForFork0_#t~nondet31_43|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork0_#res.base, ~pdev~0, thread1Thread1of1ForFork0_~arg.offset, thread1Thread1of1ForFork0_~arg.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_#t~nondet31] [2022-12-13 09:38:41,408 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [257] L1712-4-->L1715: Formula: (= 2 v_~pdev~0_23) InVars {} OutVars{~pdev~0=v_~pdev~0_23, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_11|, ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_5|} AuxVars[] AssignedVars[~pdev~0, ULTIMATE.start_module_init_#t~pre33#1, ULTIMATE.start_module_init_#t~nondet34#1] and [291] $Ultimate##0-->L1705: Formula: (let ((.cse0 (select |v_#pthreadsMutex_90| |v_~#mutex~0.base_52|))) (and (= 6 v_~pdev~0_65) (= (select .cse0 |v_~#mutex~0.offset_52|) 0) (= |v_thread1Thread1of1ForFork0_#in~arg.base_13| v_thread1Thread1of1ForFork0_~arg.base_13) (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#mutex~0.base_52| (store .cse0 |v_~#mutex~0.offset_52| 0))) (= |v_thread1Thread1of1ForFork0_#in~arg.offset_13| v_thread1Thread1of1ForFork0_~arg.offset_13))) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_13|, ~#mutex~0.base=|v_~#mutex~0.base_52|, ~#mutex~0.offset=|v_~#mutex~0.offset_52|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_13|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_13|, ~#mutex~0.base=|v_~#mutex~0.base_52|, ~pdev~0=v_~pdev~0_65, thread1Thread1of1ForFork0_~arg.offset=v_thread1Thread1of1ForFork0_~arg.offset_13, thread1Thread1of1ForFork0_~arg.base=v_thread1Thread1of1ForFork0_~arg.base_13, ~#mutex~0.offset=|v_~#mutex~0.offset_52|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_13|, thread1Thread1of1ForFork0_#t~nondet31=|v_thread1Thread1of1ForFork0_#t~nondet31_45|} AuxVars[] AssignedVars[#pthreadsMutex, ~pdev~0, thread1Thread1of1ForFork0_~arg.offset, thread1Thread1of1ForFork0_~arg.base, thread1Thread1of1ForFork0_#t~nondet31] [2022-12-13 09:38:41,440 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [336] L1712-4-->thread1EXIT: Formula: (let ((.cse0 (select |v_#pthreadsMutex_174| |v_~#mutex~0.base_110|))) (and (= (select .cse0 |v_~#mutex~0.offset_110|) 0) (= |v_thread1Thread1of1ForFork0_#res.offset_41| 0) (= 6 v_~pdev~0_156) (= |v_thread1Thread1of1ForFork0_#in~arg.offset_37| v_thread1Thread1of1ForFork0_~arg.offset_37) (= |v_thread1Thread1of1ForFork0_#res.base_41| 0) (= |v_#pthreadsMutex_173| (store |v_#pthreadsMutex_174| |v_~#mutex~0.base_110| (store .cse0 |v_~#mutex~0.offset_110| 0))) (= |v_thread1Thread1of1ForFork0_#in~arg.base_37| v_thread1Thread1of1ForFork0_~arg.base_37))) InVars {#pthreadsMutex=|v_#pthreadsMutex_174|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_37|, ~#mutex~0.base=|v_~#mutex~0.base_110|, ~#mutex~0.offset=|v_~#mutex~0.offset_110|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_37|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_173|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_37|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_41|, ~#mutex~0.base=|v_~#mutex~0.base_110|, thread1Thread1of1ForFork0_~arg.offset=v_thread1Thread1of1ForFork0_~arg.offset_37, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_51|, ~#mutex~0.offset=|v_~#mutex~0.offset_110|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_41|, ~pdev~0=v_~pdev~0_156, thread1Thread1of1ForFork0_~arg.base=v_thread1Thread1of1ForFork0_~arg.base_37, ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_37|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_37|, thread1Thread1of1ForFork0_#t~nondet31=|v_thread1Thread1of1ForFork0_#t~nondet31_69|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~arg.offset, ~pdev~0, ULTIMATE.start_module_init_#t~pre33#1, thread1Thread1of1ForFork0_~arg.base, ULTIMATE.start_module_init_#t~nondet34#1, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_#t~nondet31] and [186] L1715-->ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_13| (ite (= 2 v_~pdev~0_15) 1 0)) (= |v_ULTIMATE.start_ldv_assert_~expression#1_29| 0) (= |v_ULTIMATE.start_ldv_assert_~expression#1_29| |v_ULTIMATE.start_ldv_assert_#in~expression#1_13|)) InVars {~pdev~0=v_~pdev~0_15} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_29|, ~pdev~0=v_~pdev~0_15, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1, ULTIMATE.start_ldv_assert_#in~expression#1] [2022-12-13 09:38:41,506 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [337] L1712-4-->L1703: Formula: (let ((.cse0 (select |v_#pthreadsMutex_178| |v_~#mutex~0.base_112|))) (and (= (store |v_#pthreadsMutex_178| |v_~#mutex~0.base_112| (store .cse0 |v_~#mutex~0.offset_112| 1)) |v_#pthreadsMutex_177|) (= (select .cse0 |v_~#mutex~0.offset_112|) 0) (= 6 v_~pdev~0_160) (= |v_thread1Thread1of1ForFork0_#in~arg.offset_39| v_thread1Thread1of1ForFork0_~arg.offset_39) (= |v_thread1Thread1of1ForFork0_#in~arg.base_39| v_thread1Thread1of1ForFork0_~arg.base_39))) InVars {#pthreadsMutex=|v_#pthreadsMutex_178|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_39|, ~#mutex~0.base=|v_~#mutex~0.base_112|, ~#mutex~0.offset=|v_~#mutex~0.offset_112|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_39|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_177|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_39|, ~#mutex~0.base=|v_~#mutex~0.base_112|, ~pdev~0=v_~pdev~0_160, thread1Thread1of1ForFork0_~arg.offset=v_thread1Thread1of1ForFork0_~arg.offset_39, thread1Thread1of1ForFork0_~arg.base=v_thread1Thread1of1ForFork0_~arg.base_39, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_53|, ~#mutex~0.offset=|v_~#mutex~0.offset_112|, ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_39|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_39|, thread1Thread1of1ForFork0_#t~nondet31=|v_thread1Thread1of1ForFork0_#t~nondet31_71|} AuxVars[] AssignedVars[#pthreadsMutex, ~pdev~0, thread1Thread1of1ForFork0_~arg.offset, thread1Thread1of1ForFork0_~arg.base, ULTIMATE.start_module_init_#t~pre33#1, ULTIMATE.start_module_init_#t~nondet34#1, thread1Thread1of1ForFork0_#t~nondet31] and [186] L1715-->ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_13| (ite (= 2 v_~pdev~0_15) 1 0)) (= |v_ULTIMATE.start_ldv_assert_~expression#1_29| 0) (= |v_ULTIMATE.start_ldv_assert_~expression#1_29| |v_ULTIMATE.start_ldv_assert_#in~expression#1_13|)) InVars {~pdev~0=v_~pdev~0_15} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_29|, ~pdev~0=v_~pdev~0_15, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1, ULTIMATE.start_ldv_assert_#in~expression#1] [2022-12-13 09:38:41,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [338] L1712-4-->thread1FINAL: Formula: (let ((.cse0 (select |v_#pthreadsMutex_182| |v_~#mutex~0.base_114|))) (and (= |v_thread1Thread1of1ForFork0_#in~arg.base_41| v_thread1Thread1of1ForFork0_~arg.base_41) (= (select .cse0 |v_~#mutex~0.offset_114|) 0) (= |v_thread1Thread1of1ForFork0_#res.offset_43| 0) (= |v_thread1Thread1of1ForFork0_#res.base_43| 0) (= (store |v_#pthreadsMutex_182| |v_~#mutex~0.base_114| (store .cse0 |v_~#mutex~0.offset_114| 0)) |v_#pthreadsMutex_181|) (= 6 v_~pdev~0_164) (= |v_thread1Thread1of1ForFork0_#in~arg.offset_41| v_thread1Thread1of1ForFork0_~arg.offset_41))) InVars {#pthreadsMutex=|v_#pthreadsMutex_182|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_41|, ~#mutex~0.base=|v_~#mutex~0.base_114|, ~#mutex~0.offset=|v_~#mutex~0.offset_114|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_41|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_181|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_41|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_43|, ~#mutex~0.base=|v_~#mutex~0.base_114|, thread1Thread1of1ForFork0_~arg.offset=v_thread1Thread1of1ForFork0_~arg.offset_41, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_55|, ~#mutex~0.offset=|v_~#mutex~0.offset_114|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_43|, ~pdev~0=v_~pdev~0_164, thread1Thread1of1ForFork0_~arg.base=v_thread1Thread1of1ForFork0_~arg.base_41, ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_41|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_41|, thread1Thread1of1ForFork0_#t~nondet31=|v_thread1Thread1of1ForFork0_#t~nondet31_73|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~arg.offset, ~pdev~0, ULTIMATE.start_module_init_#t~pre33#1, thread1Thread1of1ForFork0_~arg.base, ULTIMATE.start_module_init_#t~nondet34#1, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_#t~nondet31] and [186] L1715-->ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_13| (ite (= 2 v_~pdev~0_15) 1 0)) (= |v_ULTIMATE.start_ldv_assert_~expression#1_29| 0) (= |v_ULTIMATE.start_ldv_assert_~expression#1_29| |v_ULTIMATE.start_ldv_assert_#in~expression#1_13|)) InVars {~pdev~0=v_~pdev~0_15} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_29|, ~pdev~0=v_~pdev~0_15, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1, ULTIMATE.start_ldv_assert_#in~expression#1] [2022-12-13 09:38:41,619 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [339] L1712-4-->L1705: Formula: (let ((.cse0 (select |v_#pthreadsMutex_186| |v_~#mutex~0.base_116|))) (and (= (store |v_#pthreadsMutex_186| |v_~#mutex~0.base_116| (store .cse0 |v_~#mutex~0.offset_116| 0)) |v_#pthreadsMutex_185|) (= |v_thread1Thread1of1ForFork0_#in~arg.offset_43| v_thread1Thread1of1ForFork0_~arg.offset_43) (= 6 v_~pdev~0_168) (= |v_thread1Thread1of1ForFork0_#in~arg.base_43| v_thread1Thread1of1ForFork0_~arg.base_43) (= (select .cse0 |v_~#mutex~0.offset_116|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_186|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_43|, ~#mutex~0.base=|v_~#mutex~0.base_116|, ~#mutex~0.offset=|v_~#mutex~0.offset_116|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_43|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_185|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_43|, ~#mutex~0.base=|v_~#mutex~0.base_116|, ~pdev~0=v_~pdev~0_168, thread1Thread1of1ForFork0_~arg.offset=v_thread1Thread1of1ForFork0_~arg.offset_43, thread1Thread1of1ForFork0_~arg.base=v_thread1Thread1of1ForFork0_~arg.base_43, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_57|, ~#mutex~0.offset=|v_~#mutex~0.offset_116|, ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_43|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_43|, thread1Thread1of1ForFork0_#t~nondet31=|v_thread1Thread1of1ForFork0_#t~nondet31_75|} AuxVars[] AssignedVars[#pthreadsMutex, ~pdev~0, thread1Thread1of1ForFork0_~arg.offset, thread1Thread1of1ForFork0_~arg.base, ULTIMATE.start_module_init_#t~pre33#1, ULTIMATE.start_module_init_#t~nondet34#1, thread1Thread1of1ForFork0_#t~nondet31] and [186] L1715-->ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_13| (ite (= 2 v_~pdev~0_15) 1 0)) (= |v_ULTIMATE.start_ldv_assert_~expression#1_29| 0) (= |v_ULTIMATE.start_ldv_assert_~expression#1_29| |v_ULTIMATE.start_ldv_assert_#in~expression#1_13|)) InVars {~pdev~0=v_~pdev~0_15} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_29|, ~pdev~0=v_~pdev~0_15, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1, ULTIMATE.start_ldv_assert_#in~expression#1] [2022-12-13 09:38:41,668 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:38:41,669 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 390 [2022-12-13 09:38:41,669 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 8 transitions, 46 flow [2022-12-13 09:38:41,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-12-13 09:38:41,670 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:41,670 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 09:38:41,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:38:41,670 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 09:38:41,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:41,670 INFO L85 PathProgramCache]: Analyzing trace with hash 358700, now seen corresponding path program 1 times [2022-12-13 09:38:41,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:41,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477922346] [2022-12-13 09:38:41,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:41,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:38:41,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:38:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:38:41,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:38:41,721 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:38:41,722 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 09:38:41,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 09:38:41,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-12-13 09:38:41,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-12-13 09:38:41,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 09:38:41,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:38:41,724 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-12-13 09:38:41,727 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:38:41,727 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:38:41,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:38:41 BasicIcfg [2022-12-13 09:38:41,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:38:41,740 INFO L158 Benchmark]: Toolchain (without parser) took 5300.74ms. Allocated memory was 172.0MB in the beginning and 256.9MB in the end (delta: 84.9MB). Free memory was 144.7MB in the beginning and 174.3MB in the end (delta: -29.6MB). Peak memory consumption was 56.7MB. Max. memory is 8.0GB. [2022-12-13 09:38:41,741 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 172.0MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:38:41,741 INFO L158 Benchmark]: CACSL2BoogieTranslator took 739.24ms. Allocated memory is still 172.0MB. Free memory was 144.7MB in the beginning and 88.4MB in the end (delta: 56.3MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. [2022-12-13 09:38:41,741 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.17ms. Allocated memory is still 172.0MB. Free memory was 88.4MB in the beginning and 85.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 09:38:41,741 INFO L158 Benchmark]: Boogie Preprocessor took 72.80ms. Allocated memory is still 172.0MB. Free memory was 85.2MB in the beginning and 82.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:38:41,742 INFO L158 Benchmark]: RCFGBuilder took 478.71ms. Allocated memory is still 172.0MB. Free memory was 82.6MB in the beginning and 61.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 09:38:41,742 INFO L158 Benchmark]: TraceAbstraction took 3948.92ms. Allocated memory was 172.0MB in the beginning and 256.9MB in the end (delta: 84.9MB). Free memory was 60.6MB in the beginning and 174.3MB in the end (delta: -113.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:38:41,743 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 172.0MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 739.24ms. Allocated memory is still 172.0MB. Free memory was 144.7MB in the beginning and 88.4MB in the end (delta: 56.3MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.17ms. Allocated memory is still 172.0MB. Free memory was 88.4MB in the beginning and 85.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 72.80ms. Allocated memory is still 172.0MB. Free memory was 85.2MB in the beginning and 82.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 478.71ms. Allocated memory is still 172.0MB. Free memory was 82.6MB in the beginning and 61.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3948.92ms. Allocated memory was 172.0MB in the beginning and 256.9MB in the end (delta: 84.9MB). Free memory was 60.6MB in the beginning and 174.3MB in the end (delta: -113.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 80 PlacesBefore, 20 PlacesAfterwards, 77 TransitionsBefore, 16 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 50 TrivialYvCompositions, 16 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 254, independent: 242, independent conditional: 242, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 153, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 153, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 153, independent: 143, independent conditional: 0, independent unconditional: 143, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 254, independent: 95, independent conditional: 95, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 153, unknown conditional: 153, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 147, Positive conditional cache size: 147, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 13 PlacesBefore, 13 PlacesAfterwards, 11 TransitionsBefore, 11 TransitionsAfterwards, 28 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4, Positive cache size: 2, Positive conditional cache size: 2, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 13 PlacesBefore, 13 PlacesAfterwards, 8 TransitionsBefore, 8 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4, Positive cache size: 2, Positive conditional cache size: 2, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 1695]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1696] 0 pthread_t t1; [L1697] 0 pthread_mutex_t mutex; [L1698] 0 int pdev; [L1734] CALL 0 module_init() [L1709] 0 pdev = 1 [L1710] CALL 0 ldv_assert(pdev==1) [L1695] COND FALSE 0 !(!expression) [L1710] RET 0 ldv_assert(pdev==1) [L1711] COND TRUE 0 __VERIFIER_nondet_int() [L1712] FCALL, FORK 0 pthread_create(&t1, ((void *)0), thread1, ((void *)0)) VAL [arg={0:0}, mutex={4:0}, pdev=1, pthread_create(&t1, ((void *)0), thread1, ((void *)0))=-1, t1={3:0}] [L1714] 0 pdev = 2 [L1702] 0 pdev = 6 [L1705] 0 return 0; [L1717] CALL 0 ldv_assert(pdev==2) [L1695] COND TRUE 0 !expression [L1695] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, arg={0:0}, arg={0:0}, expression=0, mutex={4:0}, pdev=6, t1={3:0}] - UnprovableResult [Line: 1695]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1695]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1695]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1712]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 99 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 5 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-12-13 09:38:41,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...