/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 14:40:07,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 14:40:07,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 14:40:08,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 14:40:08,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 14:40:08,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 14:40:08,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 14:40:08,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 14:40:08,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 14:40:08,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 14:40:08,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 14:40:08,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 14:40:08,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 14:40:08,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 14:40:08,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 14:40:08,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 14:40:08,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 14:40:08,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 14:40:08,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 14:40:08,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 14:40:08,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 14:40:08,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 14:40:08,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 14:40:08,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 14:40:08,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 14:40:08,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 14:40:08,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 14:40:08,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 14:40:08,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 14:40:08,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 14:40:08,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 14:40:08,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 14:40:08,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 14:40:08,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 14:40:08,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 14:40:08,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 14:40:08,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 14:40:08,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 14:40:08,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 14:40:08,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 14:40:08,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 14:40:08,048 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-SemanticLbe.epf [2022-12-12 14:40:08,064 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 14:40:08,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 14:40:08,065 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 14:40:08,066 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 14:40:08,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 14:40:08,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 14:40:08,066 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 14:40:08,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 14:40:08,067 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 14:40:08,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 14:40:08,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 14:40:08,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 14:40:08,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 14:40:08,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 14:40:08,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 14:40:08,067 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 14:40:08,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 14:40:08,068 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 14:40:08,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 14:40:08,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 14:40:08,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 14:40:08,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 14:40:08,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 14:40:08,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:40:08,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 14:40:08,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 14:40:08,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 14:40:08,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 14:40:08,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 14:40:08,069 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 14:40:08,070 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-12 14:40:08,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 14:40:08,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 14:40:08,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 14:40:08,331 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 14:40:08,331 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 14:40:08,332 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2022-12-12 14:40:09,383 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 14:40:09,595 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 14:40:09,595 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2022-12-12 14:40:09,613 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bb4144ad/97c73ef884364fd2aa8ffd468390b044/FLAGcf649635d [2022-12-12 14:40:09,629 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bb4144ad/97c73ef884364fd2aa8ffd468390b044 [2022-12-12 14:40:09,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 14:40:09,632 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 14:40:09,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 14:40:09,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 14:40:09,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 14:40:09,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:40:09" (1/1) ... [2022-12-12 14:40:09,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36979c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:09, skipping insertion in model container [2022-12-12 14:40:09,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:40:09" (1/1) ... [2022-12-12 14:40:09,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 14:40:09,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 14:40:09,815 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-wmm/safe006_power.oepc-thin000_power.oepc.i[1014,1027] [2022-12-12 14:40:09,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:09,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:09,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:09,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:09,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:09,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:09,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:09,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:09,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:09,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:09,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:09,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:09,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:09,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:10,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:10,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:10,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:10,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:10,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:10,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:10,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:10,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:10,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:40:10,019 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 14:40:10,029 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-wmm/safe006_power.oepc-thin000_power.oepc.i[1014,1027] [2022-12-12 14:40:10,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:10,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:10,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:10,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:10,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:10,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:10,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:10,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:10,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:10,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:10,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:10,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:10,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:10,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:10,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:10,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:10,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:10,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:10,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:10,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:10,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:10,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:10,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:40:10,106 INFO L208 MainTranslator]: Completed translation [2022-12-12 14:40:10,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:10 WrapperNode [2022-12-12 14:40:10,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 14:40:10,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 14:40:10,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 14:40:10,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 14:40:10,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:10" (1/1) ... [2022-12-12 14:40:10,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:10" (1/1) ... [2022-12-12 14:40:10,173 INFO L138 Inliner]: procedures = 175, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 120 [2022-12-12 14:40:10,174 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 14:40:10,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 14:40:10,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 14:40:10,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 14:40:10,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:10" (1/1) ... [2022-12-12 14:40:10,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:10" (1/1) ... [2022-12-12 14:40:10,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:10" (1/1) ... [2022-12-12 14:40:10,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:10" (1/1) ... [2022-12-12 14:40:10,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:10" (1/1) ... [2022-12-12 14:40:10,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:10" (1/1) ... [2022-12-12 14:40:10,210 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:10" (1/1) ... [2022-12-12 14:40:10,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:10" (1/1) ... [2022-12-12 14:40:10,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 14:40:10,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 14:40:10,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 14:40:10,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 14:40:10,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:10" (1/1) ... [2022-12-12 14:40:10,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:40:10,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:40:10,243 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-12 14:40:10,259 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-12 14:40:10,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 14:40:10,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 14:40:10,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 14:40:10,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 14:40:10,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 14:40:10,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 14:40:10,284 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 14:40:10,284 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 14:40:10,284 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 14:40:10,284 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 14:40:10,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 14:40:10,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 14:40:10,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 14:40:10,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 14:40:10,285 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 14:40:10,390 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 14:40:10,392 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 14:40:10,795 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 14:40:11,012 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 14:40:11,013 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 14:40:11,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:40:11 BoogieIcfgContainer [2022-12-12 14:40:11,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 14:40:11,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 14:40:11,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 14:40:11,020 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 14:40:11,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 02:40:09" (1/3) ... [2022-12-12 14:40:11,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ba2281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:40:11, skipping insertion in model container [2022-12-12 14:40:11,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:10" (2/3) ... [2022-12-12 14:40:11,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ba2281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:40:11, skipping insertion in model container [2022-12-12 14:40:11,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:40:11" (3/3) ... [2022-12-12 14:40:11,022 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2022-12-12 14:40:11,035 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 14:40:11,035 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 14:40:11,035 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 14:40:11,079 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 14:40:11,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 103 transitions, 216 flow [2022-12-12 14:40:11,158 INFO L130 PetriNetUnfolder]: 2/101 cut-off events. [2022-12-12 14:40:11,158 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:40:11,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2022-12-12 14:40:11,163 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 103 transitions, 216 flow [2022-12-12 14:40:11,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 91 transitions, 188 flow [2022-12-12 14:40:11,167 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 14:40:11,183 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 91 transitions, 188 flow [2022-12-12 14:40:11,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 91 transitions, 188 flow [2022-12-12 14:40:11,228 INFO L130 PetriNetUnfolder]: 1/91 cut-off events. [2022-12-12 14:40:11,228 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:40:11,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 1/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2022-12-12 14:40:11,231 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 91 transitions, 188 flow [2022-12-12 14:40:11,232 INFO L226 LiptonReduction]: Number of co-enabled transitions 610 [2022-12-12 14:40:17,358 INFO L241 LiptonReduction]: Total number of compositions: 78 [2022-12-12 14:40:17,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 14:40:17,382 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@fb4f270, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 14:40:17,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-12 14:40:17,386 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2022-12-12 14:40:17,386 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:40:17,386 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:17,387 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 14:40:17,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 14:40:17,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:17,393 INFO L85 PathProgramCache]: Analyzing trace with hash 588280894, now seen corresponding path program 1 times [2022-12-12 14:40:17,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:17,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894738169] [2022-12-12 14:40:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:17,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:17,558 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-12 14:40:17,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:17,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894738169] [2022-12-12 14:40:17,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894738169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:17,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:17,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:40:17,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82802814] [2022-12-12 14:40:17,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:17,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-12 14:40:17,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:17,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-12 14:40:17,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-12 14:40:17,582 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 21 [2022-12-12 14:40:17,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-12 14:40:17,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:17,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 21 [2022-12-12 14:40:17,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:17,682 INFO L130 PetriNetUnfolder]: 111/215 cut-off events. [2022-12-12 14:40:17,683 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:40:17,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 215 events. 111/215 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 872 event pairs, 111 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 419. Up to 201 conditions per place. [2022-12-12 14:40:17,686 INFO L137 encePairwiseOnDemand]: 20/21 looper letters, 14 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2022-12-12 14:40:17,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 74 flow [2022-12-12 14:40:17,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-12 14:40:17,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-12 14:40:17,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 27 transitions. [2022-12-12 14:40:17,694 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-12 14:40:17,695 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 2 states and 27 transitions. [2022-12-12 14:40:17,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 74 flow [2022-12-12 14:40:17,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:40:17,698 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2022-12-12 14:40:17,700 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2022-12-12 14:40:17,704 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2022-12-12 14:40:17,704 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2022-12-12 14:40:17,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-12 14:40:17,704 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:17,705 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:17,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 14:40:17,705 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 14:40:17,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:17,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1597779763, now seen corresponding path program 1 times [2022-12-12 14:40:17,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:17,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034126916] [2022-12-12 14:40:17,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:17,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:18,002 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-12 14:40:18,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:18,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034126916] [2022-12-12 14:40:18,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034126916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:18,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:18,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:40:18,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470670575] [2022-12-12 14:40:18,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:18,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:40:18,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:18,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:40:18,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:40:18,005 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 21 [2022-12-12 14:40:18,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-12 14:40:18,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:18,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 21 [2022-12-12 14:40:18,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:18,069 INFO L130 PetriNetUnfolder]: 104/220 cut-off events. [2022-12-12 14:40:18,069 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:40:18,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 220 events. 104/220 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 975 event pairs, 24 based on Foata normal form. 4/186 useless extension candidates. Maximal degree in co-relation 419. Up to 157 conditions per place. [2022-12-12 14:40:18,072 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 17 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-12 14:40:18,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 25 transitions, 92 flow [2022-12-12 14:40:18,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:40:18,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:40:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-12 14:40:18,073 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2022-12-12 14:40:18,074 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 38 transitions. [2022-12-12 14:40:18,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 25 transitions, 92 flow [2022-12-12 14:40:18,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 92 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-12 14:40:18,075 INFO L231 Difference]: Finished difference. Result has 29 places, 20 transitions, 52 flow [2022-12-12 14:40:18,075 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=20} [2022-12-12 14:40:18,076 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2022-12-12 14:40:18,076 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 52 flow [2022-12-12 14:40:18,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-12 14:40:18,076 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:18,076 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:18,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 14:40:18,077 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 14:40:18,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:18,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2008434414, now seen corresponding path program 1 times [2022-12-12 14:40:18,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:18,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368758833] [2022-12-12 14:40:18,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:18,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:18,298 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-12 14:40:18,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:18,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368758833] [2022-12-12 14:40:18,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368758833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:18,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:18,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:40:18,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617077253] [2022-12-12 14:40:18,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:18,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:40:18,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:18,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:40:18,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:40:18,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 21 [2022-12-12 14:40:18,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-12 14:40:18,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:18,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 21 [2022-12-12 14:40:18,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:18,395 INFO L130 PetriNetUnfolder]: 97/209 cut-off events. [2022-12-12 14:40:18,395 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-12 14:40:18,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 209 events. 97/209 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 887 event pairs, 43 based on Foata normal form. 4/176 useless extension candidates. Maximal degree in co-relation 434. Up to 153 conditions per place. [2022-12-12 14:40:18,396 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 20 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2022-12-12 14:40:18,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 117 flow [2022-12-12 14:40:18,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:40:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:40:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-12 14:40:18,397 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2022-12-12 14:40:18,397 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 52 flow. Second operand 3 states and 41 transitions. [2022-12-12 14:40:18,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 117 flow [2022-12-12 14:40:18,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 111 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:40:18,398 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 56 flow [2022-12-12 14:40:18,398 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-12-12 14:40:18,398 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2022-12-12 14:40:18,399 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 56 flow [2022-12-12 14:40:18,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-12 14:40:18,399 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:18,399 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:18,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 14:40:18,399 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 14:40:18,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:18,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2131146508, now seen corresponding path program 1 times [2022-12-12 14:40:18,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:18,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744989758] [2022-12-12 14:40:18,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:18,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:18,597 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-12 14:40:18,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:18,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744989758] [2022-12-12 14:40:18,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744989758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:18,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:18,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:40:18,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456072927] [2022-12-12 14:40:18,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:18,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:40:18,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:18,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:40:18,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:40:18,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2022-12-12 14:40:18,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-12 14:40:18,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:18,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2022-12-12 14:40:18,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:18,693 INFO L130 PetriNetUnfolder]: 160/336 cut-off events. [2022-12-12 14:40:18,693 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2022-12-12 14:40:18,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 336 events. 160/336 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1613 event pairs, 41 based on Foata normal form. 16/290 useless extension candidates. Maximal degree in co-relation 716. Up to 114 conditions per place. [2022-12-12 14:40:18,697 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 20 selfloop transitions, 3 changer transitions 8/35 dead transitions. [2022-12-12 14:40:18,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 149 flow [2022-12-12 14:40:18,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:40:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:40:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-12 14:40:18,700 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-12 14:40:18,700 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 56 flow. Second operand 4 states and 52 transitions. [2022-12-12 14:40:18,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 149 flow [2022-12-12 14:40:18,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:40:18,703 INFO L231 Difference]: Finished difference. Result has 33 places, 19 transitions, 64 flow [2022-12-12 14:40:18,703 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2022-12-12 14:40:18,704 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2022-12-12 14:40:18,704 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 64 flow [2022-12-12 14:40:18,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-12 14:40:18,704 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:18,704 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:18,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 14:40:18,705 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 14:40:18,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:18,705 INFO L85 PathProgramCache]: Analyzing trace with hash -256018274, now seen corresponding path program 1 times [2022-12-12 14:40:18,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:18,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129172593] [2022-12-12 14:40:18,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:18,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:19,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-12 14:40:19,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:19,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129172593] [2022-12-12 14:40:19,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129172593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:19,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:19,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:40:19,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806920958] [2022-12-12 14:40:19,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:19,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:40:19,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:19,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:40:19,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:40:19,502 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2022-12-12 14:40:19,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 19 transitions, 64 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-12 14:40:19,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:19,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2022-12-12 14:40:19,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:19,623 INFO L130 PetriNetUnfolder]: 89/187 cut-off events. [2022-12-12 14:40:19,624 INFO L131 PetriNetUnfolder]: For 143/143 co-relation queries the response was YES. [2022-12-12 14:40:19,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 187 events. 89/187 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 633 event pairs, 15 based on Foata normal form. 3/154 useless extension candidates. Maximal degree in co-relation 455. Up to 114 conditions per place. [2022-12-12 14:40:19,625 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 20 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2022-12-12 14:40:19,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 128 flow [2022-12-12 14:40:19,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:40:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:40:19,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-12 14:40:19,626 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-12 14:40:19,626 INFO L175 Difference]: Start difference. First operand has 33 places, 19 transitions, 64 flow. Second operand 4 states and 44 transitions. [2022-12-12 14:40:19,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 128 flow [2022-12-12 14:40:19,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 112 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-12 14:40:19,627 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 58 flow [2022-12-12 14:40:19,627 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2022-12-12 14:40:19,627 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2022-12-12 14:40:19,628 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 58 flow [2022-12-12 14:40:19,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-12 14:40:19,628 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:19,628 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:19,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 14:40:19,628 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 14:40:19,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:19,628 INFO L85 PathProgramCache]: Analyzing trace with hash 99763760, now seen corresponding path program 1 times [2022-12-12 14:40:19,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:19,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901035510] [2022-12-12 14:40:19,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:19,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:19,741 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-12 14:40:19,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:19,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901035510] [2022-12-12 14:40:19,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901035510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:19,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:19,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:40:19,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118055251] [2022-12-12 14:40:19,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:19,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:40:19,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:19,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:40:19,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:40:19,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2022-12-12 14:40:19,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-12 14:40:19,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:19,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2022-12-12 14:40:19,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:19,813 INFO L130 PetriNetUnfolder]: 110/235 cut-off events. [2022-12-12 14:40:19,813 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-12-12 14:40:19,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 542 conditions, 235 events. 110/235 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1011 event pairs, 29 based on Foata normal form. 25/177 useless extension candidates. Maximal degree in co-relation 536. Up to 178 conditions per place. [2022-12-12 14:40:19,814 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 19 selfloop transitions, 7 changer transitions 18/47 dead transitions. [2022-12-12 14:40:19,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 213 flow [2022-12-12 14:40:19,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:40:19,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:40:19,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-12 14:40:19,815 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2022-12-12 14:40:19,815 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 58 flow. Second operand 5 states and 66 transitions. [2022-12-12 14:40:19,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 213 flow [2022-12-12 14:40:19,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 47 transitions, 205 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-12 14:40:19,816 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 115 flow [2022-12-12 14:40:19,816 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2022-12-12 14:40:19,817 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2022-12-12 14:40:19,817 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 115 flow [2022-12-12 14:40:19,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-12 14:40:19,817 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:19,817 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:19,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 14:40:19,817 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 14:40:19,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:19,818 INFO L85 PathProgramCache]: Analyzing trace with hash -985942565, now seen corresponding path program 1 times [2022-12-12 14:40:19,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:19,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479271025] [2022-12-12 14:40:19,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:19,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:19,950 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-12 14:40:19,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:19,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479271025] [2022-12-12 14:40:19,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479271025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:19,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:19,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:40:19,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544815274] [2022-12-12 14:40:19,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:19,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:40:19,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:19,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:40:19,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:40:19,952 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2022-12-12 14:40:19,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-12 14:40:19,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:19,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2022-12-12 14:40:19,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:20,026 INFO L130 PetriNetUnfolder]: 38/127 cut-off events. [2022-12-12 14:40:20,026 INFO L131 PetriNetUnfolder]: For 68/69 co-relation queries the response was YES. [2022-12-12 14:40:20,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 127 events. 38/127 cut-off events. For 68/69 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 517 event pairs, 2 based on Foata normal form. 21/109 useless extension candidates. Maximal degree in co-relation 437. Up to 76 conditions per place. [2022-12-12 14:40:20,027 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 13 selfloop transitions, 13 changer transitions 9/38 dead transitions. [2022-12-12 14:40:20,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 243 flow [2022-12-12 14:40:20,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:40:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:40:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-12 14:40:20,028 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2022-12-12 14:40:20,028 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 115 flow. Second operand 6 states and 61 transitions. [2022-12-12 14:40:20,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 243 flow [2022-12-12 14:40:20,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 200 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-12 14:40:20,030 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 130 flow [2022-12-12 14:40:20,030 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=130, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2022-12-12 14:40:20,030 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2022-12-12 14:40:20,030 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 130 flow [2022-12-12 14:40:20,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-12 14:40:20,030 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:20,030 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:20,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 14:40:20,031 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 14:40:20,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:20,031 INFO L85 PathProgramCache]: Analyzing trace with hash -990234033, now seen corresponding path program 1 times [2022-12-12 14:40:20,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:20,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559235034] [2022-12-12 14:40:20,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:20,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:40:20,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 14:40:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:40:20,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 14:40:20,118 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 14:40:20,119 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-12 14:40:20,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-12 14:40:20,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-12 14:40:20,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 14:40:20,120 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:20,123 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:40:20,123 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:40:20,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:40:20 BasicIcfg [2022-12-12 14:40:20,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:40:20,215 INFO L158 Benchmark]: Toolchain (without parser) took 10582.93ms. Allocated memory was 198.2MB in the beginning and 439.4MB in the end (delta: 241.2MB). Free memory was 173.4MB in the beginning and 408.3MB in the end (delta: -234.9MB). Peak memory consumption was 212.0MB. Max. memory is 8.0GB. [2022-12-12 14:40:20,215 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 198.2MB. Free memory is still 174.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:40:20,216 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.59ms. Allocated memory is still 198.2MB. Free memory was 173.4MB in the beginning and 148.0MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-12 14:40:20,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.41ms. Allocated memory is still 198.2MB. Free memory was 148.0MB in the beginning and 145.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 14:40:20,216 INFO L158 Benchmark]: Boogie Preprocessor took 38.58ms. Allocated memory is still 198.2MB. Free memory was 145.3MB in the beginning and 143.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 14:40:20,216 INFO L158 Benchmark]: RCFGBuilder took 802.08ms. Allocated memory was 198.2MB in the beginning and 285.2MB in the end (delta: 87.0MB). Free memory was 143.8MB in the beginning and 251.8MB in the end (delta: -108.1MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. [2022-12-12 14:40:20,217 INFO L158 Benchmark]: TraceAbstraction took 9196.38ms. Allocated memory was 285.2MB in the beginning and 439.4MB in the end (delta: 154.1MB). Free memory was 250.8MB in the beginning and 408.3MB in the end (delta: -157.6MB). Peak memory consumption was 202.1MB. Max. memory is 8.0GB. [2022-12-12 14:40:20,218 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.15ms. Allocated memory is still 198.2MB. Free memory is still 174.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 473.59ms. Allocated memory is still 198.2MB. Free memory was 173.4MB in the beginning and 148.0MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.41ms. Allocated memory is still 198.2MB. Free memory was 148.0MB in the beginning and 145.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.58ms. Allocated memory is still 198.2MB. Free memory was 145.3MB in the beginning and 143.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 802.08ms. Allocated memory was 198.2MB in the beginning and 285.2MB in the end (delta: 87.0MB). Free memory was 143.8MB in the beginning and 251.8MB in the end (delta: -108.1MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. * TraceAbstraction took 9196.38ms. Allocated memory was 285.2MB in the beginning and 439.4MB in the end (delta: 154.1MB). Free memory was 250.8MB in the beginning and 408.3MB in the end (delta: -157.6MB). Peak memory consumption was 202.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 97 PlacesBefore, 27 PlacesAfterwards, 91 TransitionsBefore, 21 TransitionsAfterwards, 610 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 52 TrivialYvCompositions, 24 ConcurrentYvCompositions, 0 ChoiceCompositions, 78 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 787, independent: 721, independent conditional: 721, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 787, independent: 721, independent conditional: 0, independent unconditional: 721, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 787, independent: 721, independent conditional: 0, independent unconditional: 721, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 787, independent: 721, independent conditional: 0, independent unconditional: 721, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 451, independent: 424, independent conditional: 0, independent unconditional: 424, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 451, independent: 412, independent conditional: 0, independent unconditional: 412, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 264, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 251, dependent conditional: 0, dependent unconditional: 251, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 787, independent: 297, independent conditional: 0, independent unconditional: 297, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 451, unknown conditional: 0, unknown unconditional: 451] , Statistics on independence cache: Total cache size (in pairs): 729, Positive cache size: 702, Positive conditional cache size: 0, Positive unconditional cache size: 702, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1921; [L814] FCALL, FORK 0 pthread_create(&t1921, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1921, ((void *)0), P0, ((void *)0))=-2, t1921={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t1922; [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] EXPR 1 \read(y) [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L764] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L768] EXPR 1 \read(y) [L768] 1 __unbuffered_p0_EAX = y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] EXPR 1 \read(y) [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] 1 y = y$flush_delayed ? y$mem_tmp : y [L770] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] FCALL, FORK 0 pthread_create(&t1922, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1922, ((void *)0), P1, ((void *)0))=-1, t1921={7:0}, t1922={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 \read(y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 \read(y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921={7:0}, t1922={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: 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 5 procedures, 119 locations, 3 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: 9.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 295 IncrementalHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 1 mSDtfsCounter, 295 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=7, InterpolantAutomatonStates: 27, 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.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 14:40:20,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...