/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:43:34,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:43:34,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:43:34,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:43:34,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:43:34,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:43:34,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:43:34,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:43:34,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:43:34,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:43:34,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:43:34,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:43:34,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:43:34,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:43:34,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:43:34,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:43:34,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:43:34,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:43:34,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:43:34,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:43:34,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:43:34,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:43:34,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:43:34,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:43:34,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:43:34,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:43:34,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:43:34,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:43:34,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:43:34,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:43:34,552 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:43:34,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:43:34,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:43:34,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:43:34,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:43:34,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:43:34,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:43:34,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:43:34,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:43:34,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:43:34,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:43:34,560 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-VariableLbe.epf [2023-01-28 00:43:34,578 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:43:34,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:43:34,578 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:43:34,578 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:43:34,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:43:34,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:43:34,579 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:43:34,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:43:34,579 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:43:34,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:43:34,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:43:34,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:43:34,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:43:34,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:43:34,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:43:34,580 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:43:34,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:43:34,580 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:43:34,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:43:34,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:43:34,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:43:34,581 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:43:34,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:43:34,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:43:34,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:43:34,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:43:34,581 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:43:34,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:43:34,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:43:34,582 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:43:34,582 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:43:34,582 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:43:34,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:43:34,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:43:34,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:43:34,735 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:43:34,735 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:43:34,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-01-28 00:43:35,639 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:43:35,874 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:43:35,874 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-01-28 00:43:35,895 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dad3dcf1/79761b588ce04e4d9af5a930ab730993/FLAG7149e4722 [2023-01-28 00:43:35,909 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dad3dcf1/79761b588ce04e4d9af5a930ab730993 [2023-01-28 00:43:35,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:43:35,913 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:43:35,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:43:35,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:43:35,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:43:35,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:43:35" (1/1) ... [2023-01-28 00:43:35,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226fb3cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:35, skipping insertion in model container [2023-01-28 00:43:35,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:43:35" (1/1) ... [2023-01-28 00:43:35,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:43:35,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:43:36,057 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2023-01-28 00:43:36,190 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:43:36,201 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:43:36,209 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2023-01-28 00:43:36,240 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:43:36,260 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:43:36,260 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:43:36,264 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:43:36,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:36 WrapperNode [2023-01-28 00:43:36,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:43:36,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:43:36,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:43:36,266 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:43:36,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:36" (1/1) ... [2023-01-28 00:43:36,278 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:36" (1/1) ... [2023-01-28 00:43:36,297 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 112 [2023-01-28 00:43:36,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:43:36,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:43:36,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:43:36,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:43:36,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:36" (1/1) ... [2023-01-28 00:43:36,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:36" (1/1) ... [2023-01-28 00:43:36,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:36" (1/1) ... [2023-01-28 00:43:36,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:36" (1/1) ... [2023-01-28 00:43:36,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:36" (1/1) ... [2023-01-28 00:43:36,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:36" (1/1) ... [2023-01-28 00:43:36,326 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:36" (1/1) ... [2023-01-28 00:43:36,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:36" (1/1) ... [2023-01-28 00:43:36,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:43:36,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:43:36,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:43:36,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:43:36,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:36" (1/1) ... [2023-01-28 00:43:36,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:43:36,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:43:36,353 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) [2023-01-28 00:43:36,373 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 [2023-01-28 00:43:36,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:43:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:43:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:43:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:43:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:43:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:43:36,389 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:43:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:43:36,389 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:43:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:43:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:43:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:43:36,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:43:36,390 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:43:36,528 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:43:36,529 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:43:36,808 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:43:36,904 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:43:36,905 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:43:36,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:43:36 BoogieIcfgContainer [2023-01-28 00:43:36,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:43:36,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:43:36,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:43:36,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:43:36,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:43:35" (1/3) ... [2023-01-28 00:43:36,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b671cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:43:36, skipping insertion in model container [2023-01-28 00:43:36,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:36" (2/3) ... [2023-01-28 00:43:36,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b671cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:43:36, skipping insertion in model container [2023-01-28 00:43:36,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:43:36" (3/3) ... [2023-01-28 00:43:36,911 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-01-28 00:43:36,935 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:43:36,935 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:43:36,935 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:43:36,974 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:43:36,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 184 flow [2023-01-28 00:43:37,033 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2023-01-28 00:43:37,033 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:43:37,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-01-28 00:43:37,037 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 87 transitions, 184 flow [2023-01-28 00:43:37,043 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 85 transitions, 176 flow [2023-01-28 00:43:37,046 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:43:37,061 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 176 flow [2023-01-28 00:43:37,067 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 176 flow [2023-01-28 00:43:37,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 176 flow [2023-01-28 00:43:37,081 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2023-01-28 00:43:37,081 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:43:37,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-01-28 00:43:37,082 INFO L119 LiptonReduction]: Number of co-enabled transitions 1034 [2023-01-28 00:43:39,496 INFO L134 LiptonReduction]: Checked pairs total: 2524 [2023-01-28 00:43:39,496 INFO L136 LiptonReduction]: Total number of compositions: 78 [2023-01-28 00:43:39,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:43:39,510 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;@13b0a863, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:43:39,510 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 00:43:39,512 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-01-28 00:43:39,512 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:43:39,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:39,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 00:43:39,513 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:43:39,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:39,516 INFO L85 PathProgramCache]: Analyzing trace with hash 396690, now seen corresponding path program 1 times [2023-01-28 00:43:39,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:39,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994571203] [2023-01-28 00:43:39,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:39,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:39,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:39,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994571203] [2023-01-28 00:43:39,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994571203] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:39,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:39,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:43:39,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090760102] [2023-01-28 00:43:39,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:39,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:43:39,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:39,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:43:39,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:43:39,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 165 [2023-01-28 00:43:39,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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) [2023-01-28 00:43:39,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:39,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 165 [2023-01-28 00:43:39,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:39,894 INFO L130 PetriNetUnfolder]: 142/278 cut-off events. [2023-01-28 00:43:39,894 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 00:43:39,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 278 events. 142/278 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1163 event pairs, 16 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 533. Up to 208 conditions per place. [2023-01-28 00:43:39,897 INFO L137 encePairwiseOnDemand]: 161/165 looper letters, 21 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2023-01-28 00:43:39,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 26 transitions, 111 flow [2023-01-28 00:43:39,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:43:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:43:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2023-01-28 00:43:39,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2023-01-28 00:43:39,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 253 transitions. [2023-01-28 00:43:39,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 253 transitions. [2023-01-28 00:43:39,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:39,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 253 transitions. [2023-01-28 00:43:39,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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) [2023-01-28 00:43:39,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 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) [2023-01-28 00:43:39,914 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 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) [2023-01-28 00:43:39,915 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 42 flow. Second operand 3 states and 253 transitions. [2023-01-28 00:43:39,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 26 transitions, 111 flow [2023-01-28 00:43:39,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:43:39,918 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2023-01-28 00:43:39,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-01-28 00:43:39,921 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-01-28 00:43:39,922 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2023-01-28 00:43:39,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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) [2023-01-28 00:43:39,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:39,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:39,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:43:39,922 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)] === [2023-01-28 00:43:39,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:39,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1322633842, now seen corresponding path program 1 times [2023-01-28 00:43:39,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:39,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693755416] [2023-01-28 00:43:39,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:39,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:40,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:40,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693755416] [2023-01-28 00:43:40,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693755416] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:40,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:40,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:43:40,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156430669] [2023-01-28 00:43:40,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:40,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:43:40,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:40,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:43:40,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:43:40,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 165 [2023-01-28 00:43:40,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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) [2023-01-28 00:43:40,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:40,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 165 [2023-01-28 00:43:40,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:40,287 INFO L130 PetriNetUnfolder]: 179/333 cut-off events. [2023-01-28 00:43:40,287 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-01-28 00:43:40,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 333 events. 179/333 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1317 event pairs, 55 based on Foata normal form. 17/350 useless extension candidates. Maximal degree in co-relation 693. Up to 196 conditions per place. [2023-01-28 00:43:40,292 INFO L137 encePairwiseOnDemand]: 160/165 looper letters, 20 selfloop transitions, 4 changer transitions 0/24 dead transitions. [2023-01-28 00:43:40,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 24 transitions, 106 flow [2023-01-28 00:43:40,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:43:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:43:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 238 transitions. [2023-01-28 00:43:40,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4808080808080808 [2023-01-28 00:43:40,296 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 238 transitions. [2023-01-28 00:43:40,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 238 transitions. [2023-01-28 00:43:40,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:40,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 238 transitions. [2023-01-28 00:43:40,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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) [2023-01-28 00:43:40,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 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) [2023-01-28 00:43:40,300 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 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) [2023-01-28 00:43:40,300 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 238 transitions. [2023-01-28 00:43:40,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 24 transitions, 106 flow [2023-01-28 00:43:40,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:43:40,301 INFO L231 Difference]: Finished difference. Result has 24 places, 17 transitions, 60 flow [2023-01-28 00:43:40,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=24, PETRI_TRANSITIONS=17} [2023-01-28 00:43:40,302 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 0 predicate places. [2023-01-28 00:43:40,302 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 60 flow [2023-01-28 00:43:40,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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) [2023-01-28 00:43:40,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:40,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:40,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:43:40,303 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)] === [2023-01-28 00:43:40,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:40,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1948025167, now seen corresponding path program 1 times [2023-01-28 00:43:40,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:40,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369774778] [2023-01-28 00:43:40,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:40,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:40,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:40,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369774778] [2023-01-28 00:43:40,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369774778] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:40,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:40,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:43:40,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243099942] [2023-01-28 00:43:40,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:40,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:43:40,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:40,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:43:40,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:43:40,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 165 [2023-01-28 00:43:40,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 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) [2023-01-28 00:43:40,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:40,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 165 [2023-01-28 00:43:40,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:40,608 INFO L130 PetriNetUnfolder]: 91/206 cut-off events. [2023-01-28 00:43:40,609 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2023-01-28 00:43:40,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 206 events. 91/206 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 849 event pairs, 16 based on Foata normal form. 32/235 useless extension candidates. Maximal degree in co-relation 480. Up to 97 conditions per place. [2023-01-28 00:43:40,612 INFO L137 encePairwiseOnDemand]: 160/165 looper letters, 22 selfloop transitions, 3 changer transitions 17/44 dead transitions. [2023-01-28 00:43:40,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 44 transitions, 230 flow [2023-01-28 00:43:40,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:43:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:43:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2023-01-28 00:43:40,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2023-01-28 00:43:40,614 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 390 transitions. [2023-01-28 00:43:40,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 390 transitions. [2023-01-28 00:43:40,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:40,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 390 transitions. [2023-01-28 00:43:40,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 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) [2023-01-28 00:43:40,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 165.0) internal successors, (990), 6 states have internal predecessors, (990), 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) [2023-01-28 00:43:40,617 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 165.0) internal successors, (990), 6 states have internal predecessors, (990), 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) [2023-01-28 00:43:40,617 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 60 flow. Second operand 5 states and 390 transitions. [2023-01-28 00:43:40,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 44 transitions, 230 flow [2023-01-28 00:43:40,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 44 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:43:40,619 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 79 flow [2023-01-28 00:43:40,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=79, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2023-01-28 00:43:40,620 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 5 predicate places. [2023-01-28 00:43:40,622 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 79 flow [2023-01-28 00:43:40,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 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) [2023-01-28 00:43:40,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:40,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:40,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:43:40,622 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)] === [2023-01-28 00:43:40,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:40,623 INFO L85 PathProgramCache]: Analyzing trace with hash 50165391, now seen corresponding path program 1 times [2023-01-28 00:43:40,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:40,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504568604] [2023-01-28 00:43:40,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:40,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:40,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:40,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:40,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504568604] [2023-01-28 00:43:40,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504568604] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:40,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:40,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:43:40,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828176969] [2023-01-28 00:43:40,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:40,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:43:40,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:40,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:43:40,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:43:40,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 165 [2023-01-28 00:43:40,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 79 flow. Second operand has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 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) [2023-01-28 00:43:40,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:40,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 165 [2023-01-28 00:43:40,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:40,882 INFO L130 PetriNetUnfolder]: 35/98 cut-off events. [2023-01-28 00:43:40,882 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2023-01-28 00:43:40,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 98 events. 35/98 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 306 event pairs, 11 based on Foata normal form. 14/110 useless extension candidates. Maximal degree in co-relation 279. Up to 38 conditions per place. [2023-01-28 00:43:40,883 INFO L137 encePairwiseOnDemand]: 160/165 looper letters, 19 selfloop transitions, 5 changer transitions 10/36 dead transitions. [2023-01-28 00:43:40,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 36 transitions, 205 flow [2023-01-28 00:43:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:43:40,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:43:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 453 transitions. [2023-01-28 00:43:40,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4575757575757576 [2023-01-28 00:43:40,885 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 453 transitions. [2023-01-28 00:43:40,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 453 transitions. [2023-01-28 00:43:40,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:40,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 453 transitions. [2023-01-28 00:43:40,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 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) [2023-01-28 00:43:40,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 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) [2023-01-28 00:43:40,887 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 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) [2023-01-28 00:43:40,887 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 79 flow. Second operand 6 states and 453 transitions. [2023-01-28 00:43:40,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 36 transitions, 205 flow [2023-01-28 00:43:40,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 36 transitions, 192 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-01-28 00:43:40,889 INFO L231 Difference]: Finished difference. Result has 33 places, 19 transitions, 90 flow [2023-01-28 00:43:40,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2023-01-28 00:43:40,890 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places. [2023-01-28 00:43:40,890 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 90 flow [2023-01-28 00:43:40,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 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) [2023-01-28 00:43:40,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:40,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:40,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:43:40,890 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)] === [2023-01-28 00:43:40,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:40,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1936441024, now seen corresponding path program 1 times [2023-01-28 00:43:40,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:40,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888777839] [2023-01-28 00:43:40,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:40,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:41,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:41,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888777839] [2023-01-28 00:43:41,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888777839] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:41,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:41,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:43:41,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836149688] [2023-01-28 00:43:41,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:41,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:43:41,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:41,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:43:41,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:43:41,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 165 [2023-01-28 00:43:41,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 19 transitions, 90 flow. Second operand has 6 states, 6 states have (on average 70.33333333333333) internal successors, (422), 6 states have internal predecessors, (422), 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) [2023-01-28 00:43:41,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:41,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 165 [2023-01-28 00:43:41,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:41,400 INFO L130 PetriNetUnfolder]: 26/87 cut-off events. [2023-01-28 00:43:41,400 INFO L131 PetriNetUnfolder]: For 88/88 co-relation queries the response was YES. [2023-01-28 00:43:41,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 87 events. 26/87 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 278 event pairs, 0 based on Foata normal form. 1/88 useless extension candidates. Maximal degree in co-relation 259. Up to 38 conditions per place. [2023-01-28 00:43:41,400 INFO L137 encePairwiseOnDemand]: 159/165 looper letters, 18 selfloop transitions, 4 changer transitions 15/39 dead transitions. [2023-01-28 00:43:41,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 258 flow [2023-01-28 00:43:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:43:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:43:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 508 transitions. [2023-01-28 00:43:41,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43982683982683984 [2023-01-28 00:43:41,402 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 508 transitions. [2023-01-28 00:43:41,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 508 transitions. [2023-01-28 00:43:41,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:41,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 508 transitions. [2023-01-28 00:43:41,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 72.57142857142857) internal successors, (508), 7 states have internal predecessors, (508), 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) [2023-01-28 00:43:41,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 165.0) internal successors, (1320), 8 states have internal predecessors, (1320), 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) [2023-01-28 00:43:41,405 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 165.0) internal successors, (1320), 8 states have internal predecessors, (1320), 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) [2023-01-28 00:43:41,405 INFO L175 Difference]: Start difference. First operand has 33 places, 19 transitions, 90 flow. Second operand 7 states and 508 transitions. [2023-01-28 00:43:41,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 258 flow [2023-01-28 00:43:41,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 226 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-01-28 00:43:41,407 INFO L231 Difference]: Finished difference. Result has 34 places, 19 transitions, 90 flow [2023-01-28 00:43:41,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=90, PETRI_PLACES=34, PETRI_TRANSITIONS=19} [2023-01-28 00:43:41,407 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 10 predicate places. [2023-01-28 00:43:41,407 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 19 transitions, 90 flow [2023-01-28 00:43:41,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.33333333333333) internal successors, (422), 6 states have internal predecessors, (422), 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) [2023-01-28 00:43:41,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:41,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:41,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:43:41,408 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)] === [2023-01-28 00:43:41,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:41,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1836208610, now seen corresponding path program 2 times [2023-01-28 00:43:41,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:41,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127895215] [2023-01-28 00:43:41,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:41,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:43:41,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:43:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:43:41,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:43:41,467 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:43:41,467 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 00:43:41,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 00:43:41,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 00:43:41,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 00:43:41,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 00:43:41,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:43:41,469 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2023-01-28 00:43:41,473 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:43:41,473 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:43:41,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:43:41 BasicIcfg [2023-01-28 00:43:41,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:43:41,499 INFO L158 Benchmark]: Toolchain (without parser) took 5586.06ms. Allocated memory was 385.9MB in the beginning and 463.5MB in the end (delta: 77.6MB). Free memory was 353.5MB in the beginning and 329.4MB in the end (delta: 24.0MB). Peak memory consumption was 101.8MB. Max. memory is 16.0GB. [2023-01-28 00:43:41,499 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:43:41,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.13ms. Allocated memory is still 385.9MB. Free memory was 353.1MB in the beginning and 330.8MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-01-28 00:43:41,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.19ms. Allocated memory is still 385.9MB. Free memory was 330.8MB in the beginning and 328.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:43:41,500 INFO L158 Benchmark]: Boogie Preprocessor took 31.08ms. Allocated memory is still 385.9MB. Free memory was 328.6MB in the beginning and 326.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:43:41,500 INFO L158 Benchmark]: RCFGBuilder took 575.72ms. Allocated memory is still 385.9MB. Free memory was 326.5MB in the beginning and 293.8MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-01-28 00:43:41,500 INFO L158 Benchmark]: TraceAbstraction took 4590.73ms. Allocated memory was 385.9MB in the beginning and 463.5MB in the end (delta: 77.6MB). Free memory was 293.4MB in the beginning and 329.4MB in the end (delta: -36.0MB). Peak memory consumption was 43.1MB. Max. memory is 16.0GB. [2023-01-28 00:43:41,502 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.12ms. Allocated memory is still 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 351.13ms. Allocated memory is still 385.9MB. Free memory was 353.1MB in the beginning and 330.8MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.19ms. Allocated memory is still 385.9MB. Free memory was 330.8MB in the beginning and 328.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.08ms. Allocated memory is still 385.9MB. Free memory was 328.6MB in the beginning and 326.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 575.72ms. Allocated memory is still 385.9MB. Free memory was 326.5MB in the beginning and 293.8MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 4590.73ms. Allocated memory was 385.9MB in the beginning and 463.5MB in the end (delta: 77.6MB). Free memory was 293.4MB in the beginning and 329.4MB in the end (delta: -36.0MB). Peak memory consumption was 43.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 90 PlacesBefore, 24 PlacesAfterwards, 85 TransitionsBefore, 18 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 2524 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1173, independent: 1055, independent conditional: 0, independent unconditional: 1055, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 582, independent: 557, independent conditional: 0, independent unconditional: 557, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1173, independent: 498, independent conditional: 0, independent unconditional: 498, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 582, unknown conditional: 0, unknown unconditional: 582] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 29, Positive conditional cache size: 0, Positive unconditional cache size: 29, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L805] 0 pthread_t t1441; [L806] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1441, ((void *)0), P0, ((void *)0))=-2, t1441={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L807] 0 pthread_t t1442; [L808] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1442, ((void *)0), P1, ((void *)0))=-1, t1441={5:0}, t1442={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 1 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L783] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L784] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L785] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L786] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L787] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 2 return 0; [L810] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L812] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L812] RET 0 assume_abort_if_not(main$tmp_guard0) [L814] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L815] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L816] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L817] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L818] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441={5:0}, t1442={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L821] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - 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: 808]: 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: 806]: 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, 105 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: 4.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 269 IncrementalHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 1 mSDtfsCounter, 269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 211 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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! [2023-01-28 00:43:41,518 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...