/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 --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix009.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:32:00,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:32:00,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:32:01,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:32:01,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:32:01,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:32:01,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:32:01,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:32:01,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:32:01,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:32:01,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:32:01,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:32:01,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:32:01,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:32:01,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:32:01,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:32:01,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:32:01,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:32:01,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:32:01,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:32:01,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:32:01,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:32:01,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:32:01,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:32:01,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:32:01,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:32:01,058 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:32:01,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:32:01,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:32:01,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:32:01,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:32:01,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:32:01,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:32:01,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:32:01,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:32:01,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:32:01,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:32:01,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:32:01,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:32:01,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:32:01,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:32:01,066 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 18:32:01,092 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:32:01,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:32:01,093 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:32:01,093 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:32:01,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:32:01,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:32:01,095 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:32:01,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:32:01,095 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:32:01,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:32:01,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:32:01,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:32:01,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:32:01,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:32:01,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:32:01,096 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:32:01,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:32:01,096 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:32:01,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:32:01,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:32:01,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:32:01,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:32:01,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:32:01,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:32:01,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:32:01,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:32:01,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:32:01,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:32:01,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:32:01,097 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:32:01,097 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-12 18:32:01,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:32:01,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:32:01,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:32:01,390 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:32:01,403 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:32:01,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009.oepc.i [2022-12-12 18:32:02,520 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:32:02,811 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:32:02,811 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.oepc.i [2022-12-12 18:32:02,827 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/910bd05cc/8ac3cfa45ca94037a5aa3ef014c4dc36/FLAG77d24631c [2022-12-12 18:32:02,844 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/910bd05cc/8ac3cfa45ca94037a5aa3ef014c4dc36 [2022-12-12 18:32:02,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:32:02,847 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:32:02,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:32:02,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:32:02,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:32:02,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:32:02" (1/1) ... [2022-12-12 18:32:02,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2450c4c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:32:02, skipping insertion in model container [2022-12-12 18:32:02,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:32:02" (1/1) ... [2022-12-12 18:32:02,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:32:02,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:32:02,996 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/mix009.oepc.i[945,958] [2022-12-12 18:32:03,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:32:03,125 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:32:03,135 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/mix009.oepc.i[945,958] [2022-12-12 18:32:03,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:32:03,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:32:03,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:32:03,220 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:32:03,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:32:03 WrapperNode [2022-12-12 18:32:03,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:32:03,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:32:03,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:32:03,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:32:03,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:32:03" (1/1) ... [2022-12-12 18:32:03,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:32:03" (1/1) ... [2022-12-12 18:32:03,268 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 122 [2022-12-12 18:32:03,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:32:03,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:32:03,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:32:03,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:32:03,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:32:03" (1/1) ... [2022-12-12 18:32:03,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:32:03" (1/1) ... [2022-12-12 18:32:03,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:32:03" (1/1) ... [2022-12-12 18:32:03,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:32:03" (1/1) ... [2022-12-12 18:32:03,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:32:03" (1/1) ... [2022-12-12 18:32:03,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:32:03" (1/1) ... [2022-12-12 18:32:03,295 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:32:03" (1/1) ... [2022-12-12 18:32:03,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:32:03" (1/1) ... [2022-12-12 18:32:03,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:32:03,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:32:03,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:32:03,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:32:03,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:32:03" (1/1) ... [2022-12-12 18:32:03,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:32:03,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:32:03,334 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 18:32:03,383 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 18:32:03,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:32:03,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 18:32:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:32:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:32:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:32:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 18:32:03,395 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 18:32:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 18:32:03,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 18:32:03,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:32:03,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 18:32:03,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:32:03,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:32:03,397 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 18:32:03,513 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:32:03,515 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:32:03,767 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:32:03,923 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:32:03,924 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 18:32:03,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:32:03 BoogieIcfgContainer [2022-12-12 18:32:03,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:32:03,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:32:03,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:32:03,938 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:32:03,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 06:32:02" (1/3) ... [2022-12-12 18:32:03,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569e8b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:32:03, skipping insertion in model container [2022-12-12 18:32:03,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:32:03" (2/3) ... [2022-12-12 18:32:03,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569e8b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:32:03, skipping insertion in model container [2022-12-12 18:32:03,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:32:03" (3/3) ... [2022-12-12 18:32:03,942 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.oepc.i [2022-12-12 18:32:03,957 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:32:03,958 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:32:03,958 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:32:04,006 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 18:32:04,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 94 transitions, 198 flow [2022-12-12 18:32:04,112 INFO L130 PetriNetUnfolder]: 2/92 cut-off events. [2022-12-12 18:32:04,113 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:32:04,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-12 18:32:04,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 94 transitions, 198 flow [2022-12-12 18:32:04,125 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 92 transitions, 190 flow [2022-12-12 18:32:04,127 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:32:04,146 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 92 transitions, 190 flow [2022-12-12 18:32:04,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 190 flow [2022-12-12 18:32:04,188 INFO L130 PetriNetUnfolder]: 2/92 cut-off events. [2022-12-12 18:32:04,188 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:32:04,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-12 18:32:04,191 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 92 transitions, 190 flow [2022-12-12 18:32:04,191 INFO L226 LiptonReduction]: Number of co-enabled transitions 1272 [2022-12-12 18:32:07,787 INFO L241 LiptonReduction]: Total number of compositions: 75 [2022-12-12 18:32:07,798 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:32:07,802 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;@22f5ff4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:32:07,802 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-12 18:32:07,805 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-12 18:32:07,805 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:32:07,805 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:07,805 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-12 18:32:07,806 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:32:07,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:07,809 INFO L85 PathProgramCache]: Analyzing trace with hash 438494, now seen corresponding path program 1 times [2022-12-12 18:32:07,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:07,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951052472] [2022-12-12 18:32:07,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:07,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:08,029 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 18:32:08,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:08,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951052472] [2022-12-12 18:32:08,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951052472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:08,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:08,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:32:08,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507605911] [2022-12-12 18:32:08,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:08,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:32:08,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:08,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:32:08,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:32:08,049 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 53 [2022-12-12 18:32:08,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 18:32:08,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:08,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 53 [2022-12-12 18:32:08,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:08,378 INFO L130 PetriNetUnfolder]: 1375/2703 cut-off events. [2022-12-12 18:32:08,378 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-12 18:32:08,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4961 conditions, 2703 events. 1375/2703 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 20703 event pairs, 110 based on Foata normal form. 0/1560 useless extension candidates. Maximal degree in co-relation 4951. Up to 1986 conditions per place. [2022-12-12 18:32:08,386 INFO L137 encePairwiseOnDemand]: 47/53 looper letters, 24 selfloop transitions, 3 changer transitions 47/83 dead transitions. [2022-12-12 18:32:08,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 83 transitions, 321 flow [2022-12-12 18:32:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:32:08,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:32:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2022-12-12 18:32:08,395 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6792452830188679 [2022-12-12 18:32:08,397 INFO L295 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2022-12-12 18:32:08,398 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 83 transitions, 321 flow [2022-12-12 18:32:08,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 36 transitions, 135 flow [2022-12-12 18:32:08,402 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 36 transitions, 135 flow [2022-12-12 18:32:08,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 18:32:08,403 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:08,403 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:08,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:32:08,403 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:32:08,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:08,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1238262179, now seen corresponding path program 1 times [2022-12-12 18:32:08,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:08,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626153424] [2022-12-12 18:32:08,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:08,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:08,548 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 18:32:08,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:08,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626153424] [2022-12-12 18:32:08,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626153424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:08,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:08,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:32:08,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097986971] [2022-12-12 18:32:08,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:08,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:32:08,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:08,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:32:08,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:32:08,551 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 53 [2022-12-12 18:32:08,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 36 transitions, 135 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 18:32:08,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:08,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 53 [2022-12-12 18:32:08,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:08,645 INFO L130 PetriNetUnfolder]: 432/768 cut-off events. [2022-12-12 18:32:08,645 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-12 18:32:08,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2072 conditions, 768 events. 432/768 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3432 event pairs, 152 based on Foata normal form. 6/662 useless extension candidates. Maximal degree in co-relation 2059. Up to 666 conditions per place. [2022-12-12 18:32:08,649 INFO L137 encePairwiseOnDemand]: 49/53 looper letters, 38 selfloop transitions, 3 changer transitions 2/48 dead transitions. [2022-12-12 18:32:08,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 266 flow [2022-12-12 18:32:08,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:32:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:32:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-12 18:32:08,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31446540880503143 [2022-12-12 18:32:08,651 INFO L295 CegarLoopForPetriNet]: 59 programPoint places, -22 predicate places. [2022-12-12 18:32:08,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 48 transitions, 266 flow [2022-12-12 18:32:08,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 46 transitions, 258 flow [2022-12-12 18:32:08,654 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 46 transitions, 258 flow [2022-12-12 18:32:08,654 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 18:32:08,655 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:08,655 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:08,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:32:08,655 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:32:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:08,655 INFO L85 PathProgramCache]: Analyzing trace with hash 264038769, now seen corresponding path program 1 times [2022-12-12 18:32:08,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:08,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843469653] [2022-12-12 18:32:08,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:08,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:08,750 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 18:32:08,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:08,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843469653] [2022-12-12 18:32:08,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843469653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:08,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:08,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:32:08,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669878153] [2022-12-12 18:32:08,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:08,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:32:08,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:08,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:32:08,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:32:08,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 53 [2022-12-12 18:32:08,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 46 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 18:32:08,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:08,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 53 [2022-12-12 18:32:08,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:08,858 INFO L130 PetriNetUnfolder]: 317/577 cut-off events. [2022-12-12 18:32:08,858 INFO L131 PetriNetUnfolder]: For 124/124 co-relation queries the response was YES. [2022-12-12 18:32:08,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2091 conditions, 577 events. 317/577 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2431 event pairs, 54 based on Foata normal form. 10/499 useless extension candidates. Maximal degree in co-relation 2075. Up to 498 conditions per place. [2022-12-12 18:32:08,862 INFO L137 encePairwiseOnDemand]: 50/53 looper letters, 40 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2022-12-12 18:32:08,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 51 transitions, 374 flow [2022-12-12 18:32:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:32:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:32:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-12 18:32:08,864 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31446540880503143 [2022-12-12 18:32:08,866 INFO L295 CegarLoopForPetriNet]: 59 programPoint places, -21 predicate places. [2022-12-12 18:32:08,866 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 51 transitions, 374 flow [2022-12-12 18:32:08,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 51 transitions, 374 flow [2022-12-12 18:32:08,870 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 51 transitions, 374 flow [2022-12-12 18:32:08,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 18:32:08,870 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:08,870 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:08,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 18:32:08,870 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:32:08,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:08,871 INFO L85 PathProgramCache]: Analyzing trace with hash 245421564, now seen corresponding path program 1 times [2022-12-12 18:32:08,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:08,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941670532] [2022-12-12 18:32:08,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:08,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:09,017 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 18:32:09,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:09,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941670532] [2022-12-12 18:32:09,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941670532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:09,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:09,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:32:09,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329041581] [2022-12-12 18:32:09,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:09,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:32:09,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:09,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:32:09,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:32:09,019 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 53 [2022-12-12 18:32:09,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 51 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 18:32:09,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:09,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 53 [2022-12-12 18:32:09,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:09,109 INFO L130 PetriNetUnfolder]: 290/535 cut-off events. [2022-12-12 18:32:09,110 INFO L131 PetriNetUnfolder]: For 249/249 co-relation queries the response was YES. [2022-12-12 18:32:09,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2382 conditions, 535 events. 290/535 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2235 event pairs, 42 based on Foata normal form. 15/470 useless extension candidates. Maximal degree in co-relation 2363. Up to 456 conditions per place. [2022-12-12 18:32:09,114 INFO L137 encePairwiseOnDemand]: 50/53 looper letters, 43 selfloop transitions, 3 changer transitions 2/56 dead transitions. [2022-12-12 18:32:09,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 510 flow [2022-12-12 18:32:09,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:32:09,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:32:09,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-12 18:32:09,118 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3270440251572327 [2022-12-12 18:32:09,119 INFO L295 CegarLoopForPetriNet]: 59 programPoint places, -19 predicate places. [2022-12-12 18:32:09,119 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 56 transitions, 510 flow [2022-12-12 18:32:09,122 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 54 transitions, 490 flow [2022-12-12 18:32:09,123 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 54 transitions, 490 flow [2022-12-12 18:32:09,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 18:32:09,124 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:09,124 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:09,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:32:09,124 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:32:09,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:09,125 INFO L85 PathProgramCache]: Analyzing trace with hash -370119314, now seen corresponding path program 1 times [2022-12-12 18:32:09,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:09,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087525913] [2022-12-12 18:32:09,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:09,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:09,318 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 18:32:09,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:09,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087525913] [2022-12-12 18:32:09,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087525913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:09,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:09,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:32:09,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414630424] [2022-12-12 18:32:09,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:09,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:32:09,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:09,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:32:09,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:32:09,321 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 53 [2022-12-12 18:32:09,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 54 transitions, 490 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 18:32:09,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:09,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 53 [2022-12-12 18:32:09,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:09,441 INFO L130 PetriNetUnfolder]: 244/495 cut-off events. [2022-12-12 18:32:09,441 INFO L131 PetriNetUnfolder]: For 859/863 co-relation queries the response was YES. [2022-12-12 18:32:09,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2555 conditions, 495 events. 244/495 cut-off events. For 859/863 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2228 event pairs, 38 based on Foata normal form. 65/508 useless extension candidates. Maximal degree in co-relation 2533. Up to 423 conditions per place. [2022-12-12 18:32:09,444 INFO L137 encePairwiseOnDemand]: 44/53 looper letters, 42 selfloop transitions, 13 changer transitions 44/105 dead transitions. [2022-12-12 18:32:09,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 105 transitions, 1149 flow [2022-12-12 18:32:09,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:32:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:32:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-12 18:32:09,446 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3622641509433962 [2022-12-12 18:32:09,448 INFO L295 CegarLoopForPetriNet]: 59 programPoint places, -16 predicate places. [2022-12-12 18:32:09,448 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 105 transitions, 1149 flow [2022-12-12 18:32:09,451 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 61 transitions, 673 flow [2022-12-12 18:32:09,451 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 61 transitions, 673 flow [2022-12-12 18:32:09,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 18:32:09,451 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:09,451 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:09,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:32:09,452 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:32:09,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:09,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2105271721, now seen corresponding path program 1 times [2022-12-12 18:32:09,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:09,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814100199] [2022-12-12 18:32:09,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:09,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:09,605 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 18:32:09,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:09,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814100199] [2022-12-12 18:32:09,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814100199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:09,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:09,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:32:09,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481438200] [2022-12-12 18:32:09,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:09,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:32:09,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:09,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:32:09,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:32:09,611 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 53 [2022-12-12 18:32:09,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 61 transitions, 673 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 18:32:09,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:09,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 53 [2022-12-12 18:32:09,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:09,767 INFO L130 PetriNetUnfolder]: 253/542 cut-off events. [2022-12-12 18:32:09,767 INFO L131 PetriNetUnfolder]: For 924/930 co-relation queries the response was YES. [2022-12-12 18:32:09,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3324 conditions, 542 events. 253/542 cut-off events. For 924/930 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2729 event pairs, 45 based on Foata normal form. 26/505 useless extension candidates. Maximal degree in co-relation 3299. Up to 469 conditions per place. [2022-12-12 18:32:09,770 INFO L137 encePairwiseOnDemand]: 47/53 looper letters, 58 selfloop transitions, 9 changer transitions 19/91 dead transitions. [2022-12-12 18:32:09,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 91 transitions, 1185 flow [2022-12-12 18:32:09,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:32:09,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:32:09,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-12 18:32:09,772 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25157232704402516 [2022-12-12 18:32:09,774 INFO L295 CegarLoopForPetriNet]: 59 programPoint places, -15 predicate places. [2022-12-12 18:32:09,774 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 91 transitions, 1185 flow [2022-12-12 18:32:09,777 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 72 transitions, 925 flow [2022-12-12 18:32:09,777 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 72 transitions, 925 flow [2022-12-12 18:32:09,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 18:32:09,777 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:09,777 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:09,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:32:09,778 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:32:09,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:09,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1441435887, now seen corresponding path program 2 times [2022-12-12 18:32:09,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:09,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257872447] [2022-12-12 18:32:09,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:09,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:09,957 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 18:32:09,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:09,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257872447] [2022-12-12 18:32:09,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257872447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:09,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:09,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:32:09,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437148631] [2022-12-12 18:32:09,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:09,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:32:09,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:09,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:32:09,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:32:09,963 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 53 [2022-12-12 18:32:09,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 72 transitions, 925 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 18:32:09,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:09,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 53 [2022-12-12 18:32:09,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:10,065 INFO L130 PetriNetUnfolder]: 84/264 cut-off events. [2022-12-12 18:32:10,065 INFO L131 PetriNetUnfolder]: For 649/659 co-relation queries the response was YES. [2022-12-12 18:32:10,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1840 conditions, 264 events. 84/264 cut-off events. For 649/659 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1317 event pairs, 0 based on Foata normal form. 46/280 useless extension candidates. Maximal degree in co-relation 1812. Up to 223 conditions per place. [2022-12-12 18:32:10,067 INFO L137 encePairwiseOnDemand]: 44/53 looper letters, 23 selfloop transitions, 17 changer transitions 39/83 dead transitions. [2022-12-12 18:32:10,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 83 transitions, 1209 flow [2022-12-12 18:32:10,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:32:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:32:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-12 18:32:10,068 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29245283018867924 [2022-12-12 18:32:10,069 INFO L295 CegarLoopForPetriNet]: 59 programPoint places, -10 predicate places. [2022-12-12 18:32:10,069 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 83 transitions, 1209 flow [2022-12-12 18:32:10,070 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 44 transitions, 639 flow [2022-12-12 18:32:10,071 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 639 flow [2022-12-12 18:32:10,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 18:32:10,071 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:10,071 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:10,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:32:10,071 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:32:10,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:10,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1401339438, now seen corresponding path program 1 times [2022-12-12 18:32:10,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:10,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638203212] [2022-12-12 18:32:10,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:10,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:10,516 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 18:32:10,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:10,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638203212] [2022-12-12 18:32:10,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638203212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:32:10,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:32:10,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:32:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422232992] [2022-12-12 18:32:10,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:32:10,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:32:10,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:10,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:32:10,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:32:10,520 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 53 [2022-12-12 18:32:10,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 639 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 18:32:10,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:10,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 53 [2022-12-12 18:32:10,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:32:10,643 INFO L130 PetriNetUnfolder]: 52/184 cut-off events. [2022-12-12 18:32:10,644 INFO L131 PetriNetUnfolder]: For 483/484 co-relation queries the response was YES. [2022-12-12 18:32:10,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 184 events. 52/184 cut-off events. For 483/484 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 820 event pairs, 1 based on Foata normal form. 10/169 useless extension candidates. Maximal degree in co-relation 1455. Up to 151 conditions per place. [2022-12-12 18:32:10,645 INFO L137 encePairwiseOnDemand]: 46/53 looper letters, 25 selfloop transitions, 4 changer transitions 32/66 dead transitions. [2022-12-12 18:32:10,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 66 transitions, 1108 flow [2022-12-12 18:32:10,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 18:32:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 18:32:10,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-12-12 18:32:10,646 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2099056603773585 [2022-12-12 18:32:10,647 INFO L295 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2022-12-12 18:32:10,648 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 66 transitions, 1108 flow [2022-12-12 18:32:10,649 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 34 transitions, 534 flow [2022-12-12 18:32:10,649 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 534 flow [2022-12-12 18:32:10,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 18:32:10,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:10,649 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:10,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:32:10,649 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 18:32:10,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:10,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1446423896, now seen corresponding path program 1 times [2022-12-12 18:32:10,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:10,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622015123] [2022-12-12 18:32:10,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:10,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:32:10,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 18:32:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:32:10,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 18:32:10,752 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 18:32:10,753 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-12 18:32:10,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-12 18:32:10,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-12 18:32:10,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-12 18:32:10,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-12 18:32:10,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 18:32:10,760 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:10,765 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:32:10,765 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:32:10,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:32:10 BasicIcfg [2022-12-12 18:32:10,828 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:32:10,829 INFO L158 Benchmark]: Toolchain (without parser) took 7981.89ms. Allocated memory was 185.6MB in the beginning and 333.4MB in the end (delta: 147.8MB). Free memory was 143.0MB in the beginning and 126.3MB in the end (delta: 16.8MB). Peak memory consumption was 165.1MB. Max. memory is 8.0GB. [2022-12-12 18:32:10,829 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory was 161.9MB in the beginning and 161.9MB in the end (delta: 79.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:32:10,829 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.40ms. Allocated memory is still 185.6MB. Free memory was 142.5MB in the beginning and 117.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-12 18:32:10,829 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.16ms. Allocated memory is still 185.6MB. Free memory was 117.3MB in the beginning and 114.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:32:10,829 INFO L158 Benchmark]: Boogie Preprocessor took 29.53ms. Allocated memory is still 185.6MB. Free memory was 114.7MB in the beginning and 113.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:32:10,829 INFO L158 Benchmark]: RCFGBuilder took 633.98ms. Allocated memory is still 185.6MB. Free memory was 113.2MB in the beginning and 81.7MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-12 18:32:10,830 INFO L158 Benchmark]: TraceAbstraction took 6893.23ms. Allocated memory was 185.6MB in the beginning and 333.4MB in the end (delta: 147.8MB). Free memory was 80.1MB in the beginning and 126.3MB in the end (delta: -46.1MB). Peak memory consumption was 103.3MB. Max. memory is 8.0GB. [2022-12-12 18:32:10,832 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.13ms. Allocated memory is still 185.6MB. Free memory was 161.9MB in the beginning and 161.9MB in the end (delta: 79.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 373.40ms. Allocated memory is still 185.6MB. Free memory was 142.5MB in the beginning and 117.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.16ms. Allocated memory is still 185.6MB. Free memory was 117.3MB in the beginning and 114.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.53ms. Allocated memory is still 185.6MB. Free memory was 114.7MB in the beginning and 113.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 633.98ms. Allocated memory is still 185.6MB. Free memory was 113.2MB in the beginning and 81.7MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6893.23ms. Allocated memory was 185.6MB in the beginning and 333.4MB in the end (delta: 147.8MB). Free memory was 80.1MB in the beginning and 126.3MB in the end (delta: -46.1MB). Peak memory consumption was 103.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 97 PlacesBefore, 59 PlacesAfterwards, 92 TransitionsBefore, 53 TransitionsAfterwards, 1272 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 33 ConcurrentYvCompositions, 3 ChoiceCompositions, 75 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2299, independent: 2196, independent conditional: 2196, independent unconditional: 0, dependent: 103, dependent conditional: 103, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2299, independent: 2196, independent conditional: 0, independent unconditional: 2196, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2299, independent: 2196, independent conditional: 0, independent unconditional: 2196, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2299, independent: 2196, independent conditional: 0, independent unconditional: 2196, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1191, independent: 1148, independent conditional: 0, independent unconditional: 1148, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1191, independent: 1138, independent conditional: 0, independent unconditional: 1138, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 169, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2299, independent: 1048, independent conditional: 0, independent unconditional: 1048, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 1191, unknown conditional: 0, unknown unconditional: 1191] , Statistics on independence cache: Total cache size (in pairs): 2287, Positive cache size: 2244, Positive conditional cache size: 0, Positive unconditional cache size: 2244, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$read_delayed; [L734] 0 int *z$read_delayed_var; [L735] 0 int z$w_buff0; [L736] 0 _Bool z$w_buff0_used; [L737] 0 int z$w_buff1; [L738] 0 _Bool z$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L822] 0 pthread_t t241; [L823] FCALL, FORK 0 pthread_create(&t241, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t241, ((void *)0), P0, ((void *)0))=-2, t241={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] 0 pthread_t t242; [L825] FCALL, FORK 0 pthread_create(&t242, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t242, ((void *)0), P1, ((void *)0))=-1, t241={5:0}, t242={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z$w_buff1 = z$w_buff0 [L745] 1 z$w_buff0 = 1 [L746] 1 z$w_buff1_used = z$w_buff0_used [L747] 1 z$w_buff0_used = (_Bool)1 [L748] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L748] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L749] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L750] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L751] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L752] 1 z$r_buff0_thd1 = (_Bool)1 [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L785] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L786] 2 z$flush_delayed = weak$$choice2 [L787] 2 z$mem_tmp = z [L788] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L789] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L790] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L791] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L792] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L794] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 __unbuffered_p1_EBX = z [L796] 2 z = z$flush_delayed ? z$mem_tmp : z [L797] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L801] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L802] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L803] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L804] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L807] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t241={5:0}, t242={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L840] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 825]: 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: 823]: 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, 115 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 151 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 151 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 524 IncrementalHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 12 mSDtfsCounter, 524 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=925occurred in iteration=6, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 2094 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 18:32:10,849 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...