/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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/18_read_write_lock.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 06:06:07,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:06:07,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:06:07,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:06:07,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:06:07,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:06:07,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:06:07,519 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:06:07,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:06:07,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:06:07,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:06:07,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:06:07,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:06:07,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:06:07,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:06:07,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:06:07,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:06:07,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:06:07,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:06:07,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:06:07,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:06:07,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:06:07,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:06:07,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:06:07,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:06:07,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:06:07,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:06:07,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:06:07,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:06:07,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:06:07,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:06:07,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:06:07,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:06:07,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:06:07,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:06:07,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:06:07,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:06:07,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:06:07,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:06:07,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:06:07,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:06:07,576 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-RepeatedSemanticLbe.epf [2022-12-13 06:06:07,608 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:06:07,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:06:07,610 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:06:07,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:06:07,611 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:06:07,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:06:07,611 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:06:07,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:06:07,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:06:07,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:06:07,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:06:07,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:06:07,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:06:07,613 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:06:07,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:06:07,613 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:06:07,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:06:07,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:06:07,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:06:07,613 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:06:07,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:06:07,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:06:07,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:06:07,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:06:07,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:06:07,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:06:07,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:06:07,614 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 06:06:07,614 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.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 06:06:07,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:06:07,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:06:07,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:06:07,979 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:06:07,979 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:06:07,980 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/18_read_write_lock.i [2022-12-13 06:06:09,276 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:06:09,591 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:06:09,591 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/18_read_write_lock.i [2022-12-13 06:06:09,607 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a100a808/9a348b280bec4e4b83f7048ae6a168b5/FLAG3e7e1d65b [2022-12-13 06:06:09,617 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a100a808/9a348b280bec4e4b83f7048ae6a168b5 [2022-12-13 06:06:09,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:06:09,623 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 06:06:09,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:06:09,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:06:09,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:06:09,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:06:09" (1/1) ... [2022-12-13 06:06:09,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f05befc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:06:09, skipping insertion in model container [2022-12-13 06:06:09,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:06:09" (1/1) ... [2022-12-13 06:06:09,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:06:09,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:06:09,807 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 06:06:09,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:06:09,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:06:09,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:06:09,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:06:09,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:06:09,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:06:09,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:06:09,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:06:09,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:06:09,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:06:09,935 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/18_read_write_lock.i[31161,31174] [2022-12-13 06:06:09,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:06:09,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:06:09,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:06:09,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:06:09,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:06:09,952 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:06:09,971 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 06:06:09,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:06:09,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:06:09,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:06:09,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:06:09,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:06:09,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:06:09,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:06:09,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:06:09,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:06:09,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:06:09,991 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/18_read_write_lock.i[31161,31174] [2022-12-13 06:06:09,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:06:09,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:06:09,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:06:09,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:06:09,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:06:10,033 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:06:10,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:06:10 WrapperNode [2022-12-13 06:06:10,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:06:10,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:06:10,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:06:10,036 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:06:10,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:06:10" (1/1) ... [2022-12-13 06:06:10,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:06:10" (1/1) ... [2022-12-13 06:06:10,084 INFO L138 Inliner]: procedures = 174, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2022-12-13 06:06:10,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:06:10,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:06:10,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:06:10,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:06:10,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:06:10" (1/1) ... [2022-12-13 06:06:10,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:06:10" (1/1) ... [2022-12-13 06:06:10,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:06:10" (1/1) ... [2022-12-13 06:06:10,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:06:10" (1/1) ... [2022-12-13 06:06:10,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:06:10" (1/1) ... [2022-12-13 06:06:10,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:06:10" (1/1) ... [2022-12-13 06:06:10,112 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:06:10" (1/1) ... [2022-12-13 06:06:10,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:06:10" (1/1) ... [2022-12-13 06:06:10,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:06:10,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:06:10,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:06:10,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:06:10,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:06:10" (1/1) ... [2022-12-13 06:06:10,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:06:10,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 06:06:10,172 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 06:06:10,191 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 06:06:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-12-13 06:06:10,218 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-12-13 06:06:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:06:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 06:06:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:06:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:06:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:06:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:06:10,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 06:06:10,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:06:10,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:06:10,220 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 06:06:10,366 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 06:06:10,375 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:06:10,495 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 06:06:10,529 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:06:10,529 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 06:06:10,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:06:10 BoogieIcfgContainer [2022-12-13 06:06:10,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:06:10,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:06:10,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:06:10,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:06:10,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:06:09" (1/3) ... [2022-12-13 06:06:10,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30396532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:06:10, skipping insertion in model container [2022-12-13 06:06:10,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:06:10" (2/3) ... [2022-12-13 06:06:10,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30396532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:06:10, skipping insertion in model container [2022-12-13 06:06:10,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:06:10" (3/3) ... [2022-12-13 06:06:10,550 INFO L112 eAbstractionObserver]: Analyzing ICFG 18_read_write_lock.i [2022-12-13 06:06:10,567 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:06:10,567 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 06:06:10,567 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:06:10,594 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 06:06:10,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 51 transitions, 107 flow [2022-12-13 06:06:10,654 INFO L130 PetriNetUnfolder]: 1/50 cut-off events. [2022-12-13 06:06:10,654 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:06:10,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 50 events. 1/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2022-12-13 06:06:10,659 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 51 transitions, 107 flow [2022-12-13 06:06:10,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 37 transitions, 77 flow [2022-12-13 06:06:10,663 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:06:10,675 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 37 transitions, 77 flow [2022-12-13 06:06:10,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 37 transitions, 77 flow [2022-12-13 06:06:10,692 INFO L130 PetriNetUnfolder]: 0/37 cut-off events. [2022-12-13 06:06:10,692 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:06:10,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 11 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 06:06:10,694 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 37 transitions, 77 flow [2022-12-13 06:06:10,694 INFO L226 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-13 06:06:12,432 INFO L241 LiptonReduction]: Total number of compositions: 31 [2022-12-13 06:06:12,443 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 06:06:12,448 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;@2ce1eb1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:06:12,448 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 06:06:12,450 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2022-12-13 06:06:12,450 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:06:12,451 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:06:12,451 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 06:06:12,451 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 06:06:12,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:06:12,455 INFO L85 PathProgramCache]: Analyzing trace with hash 225038601, now seen corresponding path program 1 times [2022-12-13 06:06:12,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:06:12,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84434538] [2022-12-13 06:06:12,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:06:12,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:06:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:06:12,627 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 06:06:12,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:06:12,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84434538] [2022-12-13 06:06:12,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84434538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:06:12,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:06:12,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:06:12,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090324807] [2022-12-13 06:06:12,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:06:12,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:06:12,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:06:12,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:06:12,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:06:12,655 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 11 [2022-12-13 06:06:12,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 11 transitions, 25 flow. Second operand has 3 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-12-13 06:06:12,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:06:12,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 11 [2022-12-13 06:06:12,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:06:12,693 INFO L130 PetriNetUnfolder]: 6/34 cut-off events. [2022-12-13 06:06:12,693 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:06:12,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 34 events. 6/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 108 event pairs, 5 based on Foata normal form. 6/28 useless extension candidates. Maximal degree in co-relation 63. Up to 27 conditions per place. [2022-12-13 06:06:12,695 INFO L137 encePairwiseOnDemand]: 5/11 looper letters, 4 selfloop transitions, 5 changer transitions 7/16 dead transitions. [2022-12-13 06:06:12,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 16 transitions, 65 flow [2022-12-13 06:06:12,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:06:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:06:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-12-13 06:06:12,703 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2022-12-13 06:06:12,706 INFO L295 CegarLoopForPetriNet]: 15 programPoint places, 2 predicate places. [2022-12-13 06:06:12,706 INFO L82 GeneralOperation]: Start removeDead. Operand has 17 places, 16 transitions, 65 flow [2022-12-13 06:06:12,707 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 15 places, 9 transitions, 39 flow [2022-12-13 06:06:12,707 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:06:12,708 INFO L89 Accepts]: Start accepts. Operand has 15 places, 9 transitions, 39 flow [2022-12-13 06:06:12,710 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:06:12,710 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:06:12,710 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 15 places, 9 transitions, 39 flow [2022-12-13 06:06:12,713 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 15 places, 9 transitions, 39 flow [2022-12-13 06:06:12,713 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:06:12,755 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [189] L725-1-->L734: Formula: (and (= v_~y~0_12 |v_ULTIMATE.start_thr2_~ly~0#1_13|) (= v_~x~0_23 |v_ULTIMATE.start_thr2_~l~0#1_16|) (= v_~y~0_12 |v_ULTIMATE.start_thr2_~l~0#1_16|)) InVars {~x~0=v_~x~0_23} OutVars{ULTIMATE.start_thr2_~l~0#1=|v_ULTIMATE.start_thr2_~l~0#1_16|, ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_13|, ~y~0=v_~y~0_12, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~l~0#1, ULTIMATE.start_thr2_~ly~0#1, ~y~0] and [202] $Ultimate##0-->thr1FINAL: Formula: (and (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (= |v_thr1Thread1of1ForFork0_~arg#1.base_7| |v_thr1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_thr1Thread1of1ForFork0_~arg#1.offset_7| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~w~0_79 0) (= |v_thr1Thread1of1ForFork0_#res#1.base_15| 0) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (= (ite (= v_~r~0_67 0) 1 0) |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (= |v_thr1Thread1of1ForFork0_#res#1.offset_15| 0) (= v_~x~0_52 3) (not (= (ite (= v_~w~0_80 0) 1 0) 0))) InVars {~w~0=v_~w~0_80, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_7|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_7|, ~r~0=v_~r~0_67} OutVars{~w~0=v_~w~0_79, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_7|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_15|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_7|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_7|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_7|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_15|, ~x~0=v_~x~0_52, ~r~0=v_~r~0_67} AuxVars[] AssignedVars[~w~0, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_~arg#1.base, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread1of1ForFork0_#res#1.base, ~x~0] [2022-12-13 06:06:12,854 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [189] L725-1-->L734: Formula: (and (= v_~y~0_12 |v_ULTIMATE.start_thr2_~ly~0#1_13|) (= v_~x~0_23 |v_ULTIMATE.start_thr2_~l~0#1_16|) (= v_~y~0_12 |v_ULTIMATE.start_thr2_~l~0#1_16|)) InVars {~x~0=v_~x~0_23} OutVars{ULTIMATE.start_thr2_~l~0#1=|v_ULTIMATE.start_thr2_~l~0#1_16|, ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_13|, ~y~0=v_~y~0_12, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~l~0#1, ULTIMATE.start_thr2_~ly~0#1, ~y~0] and [203] $Ultimate##0-->thr1EXIT: Formula: (and (= |v_thr1Thread1of1ForFork0_~arg#1.base_9| |v_thr1Thread1of1ForFork0_#in~arg#1.base_9|) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thr1Thread1of1ForFork0_#res#1.offset_17| 0) (= |v_thr1Thread1of1ForFork0_#res#1.base_17| 0) (= v_~x~0_54 3) (not (= (ite (= v_~w~0_84 0) 1 0) 0)) (= v_~w~0_83 0) (= |v_thr1Thread1of1ForFork0_~arg#1.offset_9| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_9|) (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= (ite (= v_~r~0_69 0) 1 0) |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|)) InVars {~w~0=v_~w~0_84, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_9|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_9|, ~r~0=v_~r~0_69} OutVars{~w~0=v_~w~0_83, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_9|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_17|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_9|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_9|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_9|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_17|, ~x~0=v_~x~0_54, ~r~0=v_~r~0_69} AuxVars[] AssignedVars[~w~0, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_~arg#1.base, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread1of1ForFork0_#res#1.base, ~x~0] [2022-12-13 06:06:12,936 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [189] L725-1-->L734: Formula: (and (= v_~y~0_12 |v_ULTIMATE.start_thr2_~ly~0#1_13|) (= v_~x~0_23 |v_ULTIMATE.start_thr2_~l~0#1_16|) (= v_~y~0_12 |v_ULTIMATE.start_thr2_~l~0#1_16|)) InVars {~x~0=v_~x~0_23} OutVars{ULTIMATE.start_thr2_~l~0#1=|v_ULTIMATE.start_thr2_~l~0#1_16|, ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_13|, ~y~0=v_~y~0_12, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~l~0#1, ULTIMATE.start_thr2_~ly~0#1, ~y~0] and [204] $Ultimate##0-->L714: Formula: (and (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|) (= |v_thr1Thread1of1ForFork0_~arg#1.base_11| |v_thr1Thread1of1ForFork0_#in~arg#1.base_11|) (= v_~x~0_56 3) (not (= (ite (= v_~w~0_88 0) 1 0) 0)) (= (ite (= v_~r~0_71 0) 1 0) |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|) (= v_~w~0_87 1) (= |v_thr1Thread1of1ForFork0_~arg#1.offset_11| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_11|) (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| 0))) InVars {~w~0=v_~w~0_88, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_11|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_11|, ~r~0=v_~r~0_71} OutVars{~w~0=v_~w~0_87, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_11|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_11|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_11|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_11|, ~x~0=v_~x~0_56, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[~w~0, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_~arg#1.base, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~x~0] [2022-12-13 06:06:12,997 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [189] L725-1-->L734: Formula: (and (= v_~y~0_12 |v_ULTIMATE.start_thr2_~ly~0#1_13|) (= v_~x~0_23 |v_ULTIMATE.start_thr2_~l~0#1_16|) (= v_~y~0_12 |v_ULTIMATE.start_thr2_~l~0#1_16|)) InVars {~x~0=v_~x~0_23} OutVars{ULTIMATE.start_thr2_~l~0#1=|v_ULTIMATE.start_thr2_~l~0#1_16|, ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_13|, ~y~0=v_~y~0_12, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~l~0#1, ULTIMATE.start_thr2_~ly~0#1, ~y~0] and [205] $Ultimate##0-->L716: Formula: (and (= |v_thr1Thread1of1ForFork0_~arg#1.offset_13| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_13|) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0)) (= v_~w~0_91 0) (= |v_thr1Thread1of1ForFork0_~arg#1.base_13| |v_thr1Thread1of1ForFork0_#in~arg#1.base_13|) (not (= (ite (= v_~w~0_92 0) 1 0) 0)) (= v_~x~0_58 3) (= (ite (= v_~r~0_73 0) 1 0) |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|)) InVars {~w~0=v_~w~0_92, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_13|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_13|, ~r~0=v_~r~0_73} OutVars{~w~0=v_~w~0_91, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_13|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_13|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_13|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_13|, ~x~0=v_~x~0_58, ~r~0=v_~r~0_73} AuxVars[] AssignedVars[~w~0, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_~arg#1.base, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~x~0] [2022-12-13 06:06:13,064 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [209] L725-1-->thr1FINAL: Formula: (and (= |v_thr1Thread1of1ForFork0_~arg#1.base_23| |v_thr1Thread1of1ForFork0_#in~arg#1.base_23|) (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= v_~y~0_28 |v_ULTIMATE.start_thr2_~ly~0#1_31|) (= v_~w~0_117 0) (= v_~y~0_28 |v_ULTIMATE.start_thr2_~l~0#1_30|) (= (ite (= v_~r~0_93 0) 1 0) |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= v_~x~0_74 |v_ULTIMATE.start_thr2_~l~0#1_30|) (= |v_thr1Thread1of1ForFork0_#res#1.offset_25| 0) (not (= (ite (= v_~w~0_118 0) 1 0) 0)) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thr1Thread1of1ForFork0_#res#1.base_25| 0) (= v_~x~0_73 3) (= |v_thr1Thread1of1ForFork0_~arg#1.offset_23| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_23|)) InVars {~w~0=v_~w~0_118, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_23|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_23|, ~x~0=v_~x~0_74, ~r~0=v_~r~0_93} OutVars{thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ULTIMATE.start_thr2_~l~0#1=|v_ULTIMATE.start_thr2_~l~0#1_30|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_23|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_23|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_25|, ~w~0=v_~w~0_117, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_23|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_25|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_23|, ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_31|, ~y~0=v_~y~0_28, ~x~0=v_~x~0_73, ~r~0=v_~r~0_93} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_thr2_~l~0#1, ~w~0, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_~arg#1.base, ULTIMATE.start_thr2_~ly~0#1, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread1of1ForFork0_#res#1.base, ~y~0, ~x~0] and [177] L734-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_ULTIMATE.start_thr2_~lx~0#1_9| |v_ULTIMATE.start_thr2_~ly~0#1_7|)) (= v_~x~0_13 |v_ULTIMATE.start_thr2_~lx~0#1_9|)) InVars {ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_7|, ~x~0=v_~x~0_13} OutVars{ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_7|, ~x~0=v_~x~0_13, ULTIMATE.start_thr2_~lx~0#1=|v_ULTIMATE.start_thr2_~lx~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~lx~0#1] [2022-12-13 06:06:13,150 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [210] L725-1-->thr1EXIT: Formula: (and (= v_~x~0_78 |v_ULTIMATE.start_thr2_~l~0#1_32|) (= |v_thr1Thread1of1ForFork0_#res#1.offset_27| 0) (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (= (ite (= v_~r~0_95 0) 1 0) |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (not (= (ite (= v_~w~0_122 0) 1 0) 0)) (= |v_thr1Thread1of1ForFork0_#res#1.base_27| 0) (= v_~x~0_77 3) (= v_~y~0_30 |v_ULTIMATE.start_thr2_~ly~0#1_33|) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (= |v_thr1Thread1of1ForFork0_~arg#1.offset_25| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_25|) (= |v_thr1Thread1of1ForFork0_~arg#1.base_25| |v_thr1Thread1of1ForFork0_#in~arg#1.base_25|) (= v_~w~0_121 0) (= v_~y~0_30 |v_ULTIMATE.start_thr2_~l~0#1_32|)) InVars {~w~0=v_~w~0_122, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_25|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_25|, ~x~0=v_~x~0_78, ~r~0=v_~r~0_95} OutVars{thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ULTIMATE.start_thr2_~l~0#1=|v_ULTIMATE.start_thr2_~l~0#1_32|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_25|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_25|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_27|, ~w~0=v_~w~0_121, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_25|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_27|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_25|, ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_33|, ~y~0=v_~y~0_30, ~x~0=v_~x~0_77, ~r~0=v_~r~0_95} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_thr2_~l~0#1, ~w~0, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_~arg#1.base, ULTIMATE.start_thr2_~ly~0#1, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread1of1ForFork0_#res#1.base, ~y~0, ~x~0] and [177] L734-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_ULTIMATE.start_thr2_~lx~0#1_9| |v_ULTIMATE.start_thr2_~ly~0#1_7|)) (= v_~x~0_13 |v_ULTIMATE.start_thr2_~lx~0#1_9|)) InVars {ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_7|, ~x~0=v_~x~0_13} OutVars{ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_7|, ~x~0=v_~x~0_13, ULTIMATE.start_thr2_~lx~0#1=|v_ULTIMATE.start_thr2_~lx~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~lx~0#1] [2022-12-13 06:06:13,237 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [211] L725-1-->L714: Formula: (and (not (= (ite (= v_~w~0_126 0) 1 0) 0)) (= v_~x~0_82 |v_ULTIMATE.start_thr2_~l~0#1_34|) (= v_~y~0_32 |v_ULTIMATE.start_thr2_~ly~0#1_35|) (= v_~x~0_81 3) (= |v_thr1Thread1of1ForFork0_~arg#1.base_27| |v_thr1Thread1of1ForFork0_#in~arg#1.base_27|) (= (ite (= v_~r~0_97 0) 1 0) |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_39|) (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_39| 0)) (= v_~y~0_32 |v_ULTIMATE.start_thr2_~l~0#1_34|) (= |v_thr1Thread1of1ForFork0_~arg#1.offset_27| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_27|) (= v_~w~0_125 1) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_39| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_39|)) InVars {~w~0=v_~w~0_126, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_27|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_27|, ~x~0=v_~x~0_82, ~r~0=v_~r~0_97} OutVars{~w~0=v_~w~0_125, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_39|, ULTIMATE.start_thr2_~l~0#1=|v_ULTIMATE.start_thr2_~l~0#1_34|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_27|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_27|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_27|, ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_35|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_39|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_27|, ~y~0=v_~y~0_32, ~x~0=v_~x~0_81, ~r~0=v_~r~0_97} AuxVars[] AssignedVars[~w~0, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_thr2_~l~0#1, thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_~arg#1.base, ULTIMATE.start_thr2_~ly~0#1, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~y~0, ~x~0] and [177] L734-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_ULTIMATE.start_thr2_~lx~0#1_9| |v_ULTIMATE.start_thr2_~ly~0#1_7|)) (= v_~x~0_13 |v_ULTIMATE.start_thr2_~lx~0#1_9|)) InVars {ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_7|, ~x~0=v_~x~0_13} OutVars{ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_7|, ~x~0=v_~x~0_13, ULTIMATE.start_thr2_~lx~0#1=|v_ULTIMATE.start_thr2_~lx~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~lx~0#1] [2022-12-13 06:06:13,308 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [212] L725-1-->L716: Formula: (and (= v_~y~0_34 |v_ULTIMATE.start_thr2_~l~0#1_36|) (not (= (ite (= v_~w~0_130 0) 1 0) 0)) (= |v_thr1Thread1of1ForFork0_~arg#1.base_29| |v_thr1Thread1of1ForFork0_#in~arg#1.base_29|) (= v_~y~0_34 |v_ULTIMATE.start_thr2_~ly~0#1_37|) (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| 0)) (= v_~x~0_85 3) (= |v_thr1Thread1of1ForFork0_~arg#1.offset_29| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_29|) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= v_~x~0_86 |v_ULTIMATE.start_thr2_~l~0#1_36|) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41| (ite (= v_~r~0_99 0) 1 0)) (= v_~w~0_129 0)) InVars {~w~0=v_~w~0_130, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_29|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_29|, ~x~0=v_~x~0_86, ~r~0=v_~r~0_99} OutVars{~w~0=v_~w~0_129, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_41|, ULTIMATE.start_thr2_~l~0#1=|v_ULTIMATE.start_thr2_~l~0#1_36|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_29|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_29|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_29|, ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_37|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_29|, ~y~0=v_~y~0_34, ~x~0=v_~x~0_85, ~r~0=v_~r~0_99} AuxVars[] AssignedVars[~w~0, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_thr2_~l~0#1, thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_~arg#1.base, ULTIMATE.start_thr2_~ly~0#1, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~y~0, ~x~0] and [177] L734-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_ULTIMATE.start_thr2_~lx~0#1_9| |v_ULTIMATE.start_thr2_~ly~0#1_7|)) (= v_~x~0_13 |v_ULTIMATE.start_thr2_~lx~0#1_9|)) InVars {ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_7|, ~x~0=v_~x~0_13} OutVars{ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_7|, ~x~0=v_~x~0_13, ULTIMATE.start_thr2_~lx~0#1=|v_ULTIMATE.start_thr2_~lx~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~lx~0#1] [2022-12-13 06:06:13,381 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 06:06:13,383 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 675 [2022-12-13 06:06:13,383 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 9 transitions, 47 flow [2022-12-13 06:06:13,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-12-13 06:06:13,383 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:06:13,383 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 06:06:13,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:06:13,383 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 06:06:13,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:06:13,384 INFO L85 PathProgramCache]: Analyzing trace with hash 7259328, now seen corresponding path program 1 times [2022-12-13 06:06:13,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:06:13,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920667314] [2022-12-13 06:06:13,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:06:13,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:06:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:06:13,499 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 06:06:13,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:06:13,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920667314] [2022-12-13 06:06:13,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920667314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:06:13,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:06:13,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:06:13,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220562418] [2022-12-13 06:06:13,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:06:13,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:06:13,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:06:13,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:06:13,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:06:13,501 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 9 [2022-12-13 06:06:13,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 9 transitions, 47 flow. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-12-13 06:06:13,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:06:13,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 9 [2022-12-13 06:06:13,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:06:13,512 INFO L130 PetriNetUnfolder]: 0/4 cut-off events. [2022-12-13 06:06:13,512 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:06:13,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18 conditions, 4 events. 0/4 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 1/5 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-13 06:06:13,512 INFO L137 encePairwiseOnDemand]: 3/9 looper letters, 0 selfloop transitions, 0 changer transitions 4/4 dead transitions. [2022-12-13 06:06:13,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 13 places, 4 transitions, 27 flow [2022-12-13 06:06:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:06:13,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:06:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-12-13 06:06:13,514 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2222222222222222 [2022-12-13 06:06:13,515 INFO L295 CegarLoopForPetriNet]: 15 programPoint places, -2 predicate places. [2022-12-13 06:06:13,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 13 places, 4 transitions, 27 flow [2022-12-13 06:06:13,515 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 06:06:13,515 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:06:13,515 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 06:06:13,516 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 06:06:13,516 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:06:13,516 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:06:13,517 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 06:06:13,517 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 06:06:13,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-12-13 06:06:13,520 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 06:06:13,520 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2022-12-13 06:06:13,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:06:13,521 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-12-13 06:06:13,524 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 06:06:13,524 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 06:06:13,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:06:13 BasicIcfg [2022-12-13 06:06:13,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 06:06:13,536 INFO L158 Benchmark]: Toolchain (without parser) took 3912.97ms. Allocated memory was 188.7MB in the beginning and 252.7MB in the end (delta: 64.0MB). Free memory was 163.9MB in the beginning and 161.1MB in the end (delta: 2.9MB). Peak memory consumption was 67.3MB. Max. memory is 8.0GB. [2022-12-13 06:06:13,536 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory is still 165.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:06:13,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.41ms. Allocated memory is still 188.7MB. Free memory was 163.5MB in the beginning and 142.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 06:06:13,539 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.77ms. Allocated memory is still 188.7MB. Free memory was 142.4MB in the beginning and 140.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:06:13,539 INFO L158 Benchmark]: Boogie Preprocessor took 29.80ms. Allocated memory is still 188.7MB. Free memory was 140.4MB in the beginning and 139.2MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 06:06:13,540 INFO L158 Benchmark]: RCFGBuilder took 427.29ms. Allocated memory is still 188.7MB. Free memory was 138.8MB in the beginning and 124.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-13 06:06:13,540 INFO L158 Benchmark]: TraceAbstraction took 2990.71ms. Allocated memory was 188.7MB in the beginning and 252.7MB in the end (delta: 64.0MB). Free memory was 123.0MB in the beginning and 161.1MB in the end (delta: -38.0MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. [2022-12-13 06:06:13,541 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 188.7MB. Free memory is still 165.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 411.41ms. Allocated memory is still 188.7MB. Free memory was 163.5MB in the beginning and 142.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.77ms. Allocated memory is still 188.7MB. Free memory was 142.4MB in the beginning and 140.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.80ms. Allocated memory is still 188.7MB. Free memory was 140.4MB in the beginning and 139.2MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 427.29ms. Allocated memory is still 188.7MB. Free memory was 138.8MB in the beginning and 124.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2990.71ms. Allocated memory was 188.7MB in the beginning and 252.7MB in the end (delta: 64.0MB). Free memory was 123.0MB in the beginning and 161.1MB in the end (delta: -38.0MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 41 PlacesBefore, 15 PlacesAfterwards, 37 TransitionsBefore, 11 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 16 TrivialYvCompositions, 15 ConcurrentYvCompositions, 0 ChoiceCompositions, 31 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, independent: 146, independent conditional: 146, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 160, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 160, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 160, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 119, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 119, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 119, unknown conditional: 0, unknown unconditional: 119] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 240, Positive conditional cache size: 0, Positive unconditional cache size: 240, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 15 PlacesBefore, 15 PlacesAfterwards, 9 TransitionsBefore, 9 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 738]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 59 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.9s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.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, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 0 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=1, InterpolantAutomatonStates: 7, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 06:06:13,564 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...