/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 AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:45:29,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:45:29,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:45:29,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:45:29,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:45:29,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:45:29,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:45:29,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:45:29,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:45:29,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:45:29,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:45:29,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:45:29,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:45:29,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:45:29,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:45:29,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:45:29,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:45:29,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:45:29,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:45:29,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:45:29,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:45:29,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:45:29,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:45:29,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:45:29,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:45:29,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:45:29,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:45:29,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:45:29,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:45:29,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:45:29,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:45:29,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:45:29,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:45:29,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:45:29,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:45:29,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:45:29,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:45:29,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:45:29,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:45:29,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:45:29,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:45:29,653 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 06:45:29,681 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:45:29,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:45:29,683 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:45:29,683 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:45:29,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:45:29,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:45:29,684 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:45:29,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:45:29,684 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:45:29,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:45:29,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:45:29,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:45:29,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:45:29,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:45:29,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:45:29,685 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:45:29,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:45:29,686 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:45:29,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:45:29,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:45:29,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:45:29,686 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:45:29,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:45:29,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:45:29,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:45:29,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:45:29,687 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:45:29,687 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:45:29,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:45:29,687 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:45:29,687 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:45:29,687 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 -> AFTER [2023-01-28 06:45:29,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:45:29,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:45:29,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:45:29,951 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:45:29,951 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:45:29,952 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2023-01-28 06:45:31,063 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:45:31,337 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:45:31,337 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2023-01-28 06:45:31,361 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2816da89/7fbe9bd046524f9a995095dac5e78416/FLAG298a7b117 [2023-01-28 06:45:31,375 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2816da89/7fbe9bd046524f9a995095dac5e78416 [2023-01-28 06:45:31,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:45:31,379 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:45:31,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:45:31,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:45:31,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:45:31,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:45:31" (1/1) ... [2023-01-28 06:45:31,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92cf2aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:45:31, skipping insertion in model container [2023-01-28 06:45:31,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:45:31" (1/1) ... [2023-01-28 06:45:31,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:45:31,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:45:31,602 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/mix000.opt.i[987,1000] [2023-01-28 06:45:31,786 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:45:31,803 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:45:31,812 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/mix000.opt.i[987,1000] [2023-01-28 06:45:31,881 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:45:31,917 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:45:31,917 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:45:31,923 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:45:31,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:45:31 WrapperNode [2023-01-28 06:45:31,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:45:31,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:45:31,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:45:31,925 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:45:31,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:45:31" (1/1) ... [2023-01-28 06:45:31,954 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:45:31" (1/1) ... [2023-01-28 06:45:31,977 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2023-01-28 06:45:31,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:45:31,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:45:31,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:45:31,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:45:31,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:45:31" (1/1) ... [2023-01-28 06:45:31,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:45:31" (1/1) ... [2023-01-28 06:45:31,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:45:31" (1/1) ... [2023-01-28 06:45:31,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:45:31" (1/1) ... [2023-01-28 06:45:32,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:45:31" (1/1) ... [2023-01-28 06:45:32,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:45:31" (1/1) ... [2023-01-28 06:45:32,011 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:45:31" (1/1) ... [2023-01-28 06:45:32,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:45:31" (1/1) ... [2023-01-28 06:45:32,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:45:32,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:45:32,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:45:32,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:45:32,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:45:31" (1/1) ... [2023-01-28 06:45:32,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:45:32,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:45:32,048 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 06:45:32,063 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 06:45:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:45:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:45:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:45:32,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:45:32,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:45:32,095 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:45:32,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:45:32,096 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:45:32,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:45:32,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:45:32,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:45:32,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:45:32,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:45:32,099 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 06:45:32,258 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:45:32,260 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:45:32,605 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:45:32,703 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:45:32,703 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:45:32,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:45:32 BoogieIcfgContainer [2023-01-28 06:45:32,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:45:32,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:45:32,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:45:32,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:45:32,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:45:31" (1/3) ... [2023-01-28 06:45:32,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d2c556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:45:32, skipping insertion in model container [2023-01-28 06:45:32,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:45:31" (2/3) ... [2023-01-28 06:45:32,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d2c556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:45:32, skipping insertion in model container [2023-01-28 06:45:32,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:45:32" (3/3) ... [2023-01-28 06:45:32,711 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.opt.i [2023-01-28 06:45:32,726 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:45:32,726 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:45:32,726 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:45:32,772 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:45:32,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2023-01-28 06:45:32,847 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2023-01-28 06:45:32,847 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:45:32,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-01-28 06:45:32,851 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2023-01-28 06:45:32,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2023-01-28 06:45:32,857 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:45:32,865 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2023-01-28 06:45:32,868 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2023-01-28 06:45:32,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2023-01-28 06:45:32,887 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2023-01-28 06:45:32,887 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:45:32,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-01-28 06:45:32,889 INFO L119 LiptonReduction]: Number of co-enabled transitions 1088 [2023-01-28 06:45:36,004 INFO L134 LiptonReduction]: Checked pairs total: 2899 [2023-01-28 06:45:36,004 INFO L136 LiptonReduction]: Total number of compositions: 85 [2023-01-28 06:45:36,016 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:45:36,024 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;@256f7072, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:45:36,024 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 06:45:36,027 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-01-28 06:45:36,028 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:45:36,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:45:36,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 06:45:36,029 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:45:36,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:45:36,033 INFO L85 PathProgramCache]: Analyzing trace with hash 421097674, now seen corresponding path program 1 times [2023-01-28 06:45:36,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:45:36,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212635873] [2023-01-28 06:45:36,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:45:36,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:45:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:45:36,360 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 06:45:36,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:45:36,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212635873] [2023-01-28 06:45:36,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212635873] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:45:36,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:45:36,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:45:36,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339165473] [2023-01-28 06:45:36,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:45:36,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:45:36,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:45:36,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:45:36,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:45:36,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 176 [2023-01-28 06:45:36,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 06:45:36,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:45:36,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 176 [2023-01-28 06:45:36,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:45:36,533 INFO L130 PetriNetUnfolder]: 142/273 cut-off events. [2023-01-28 06:45:36,533 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 06:45:36,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 273 events. 142/273 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1102 event pairs, 18 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 528. Up to 205 conditions per place. [2023-01-28 06:45:36,538 INFO L137 encePairwiseOnDemand]: 172/176 looper letters, 18 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2023-01-28 06:45:36,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 98 flow [2023-01-28 06:45:36,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:45:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:45:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2023-01-28 06:45:36,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4962121212121212 [2023-01-28 06:45:36,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2023-01-28 06:45:36,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2023-01-28 06:45:36,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:45:36,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2023-01-28 06:45:36,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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 06:45:36,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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 06:45:36,562 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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 06:45:36,564 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 44 flow. Second operand 3 states and 262 transitions. [2023-01-28 06:45:36,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 98 flow [2023-01-28 06:45:36,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:45:36,567 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2023-01-28 06:45:36,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-01-28 06:45:36,573 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-01-28 06:45:36,573 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2023-01-28 06:45:36,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 06:45:36,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:45:36,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:45:36,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:45:36,574 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:45:36,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:45:36,574 INFO L85 PathProgramCache]: Analyzing trace with hash 947983461, now seen corresponding path program 1 times [2023-01-28 06:45:36,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:45:36,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996911140] [2023-01-28 06:45:36,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:45:36,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:45:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:45:36,922 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 06:45:36,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:45:36,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996911140] [2023-01-28 06:45:36,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996911140] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:45:36,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:45:36,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:45:36,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60898513] [2023-01-28 06:45:36,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:45:36,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:45:36,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:45:36,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:45:36,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:45:36,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 176 [2023-01-28 06:45:36,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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 06:45:36,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:45:36,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 176 [2023-01-28 06:45:36,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:45:37,025 INFO L130 PetriNetUnfolder]: 167/294 cut-off events. [2023-01-28 06:45:37,026 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-01-28 06:45:37,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 294 events. 167/294 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 971 event pairs, 65 based on Foata normal form. 4/298 useless extension candidates. Maximal degree in co-relation 612. Up to 267 conditions per place. [2023-01-28 06:45:37,031 INFO L137 encePairwiseOnDemand]: 172/176 looper letters, 21 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-01-28 06:45:37,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 108 flow [2023-01-28 06:45:37,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:45:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:45:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2023-01-28 06:45:37,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2023-01-28 06:45:37,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 244 transitions. [2023-01-28 06:45:37,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 244 transitions. [2023-01-28 06:45:37,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:45:37,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 244 transitions. [2023-01-28 06:45:37,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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 06:45:37,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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 06:45:37,041 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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 06:45:37,041 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 3 states and 244 transitions. [2023-01-28 06:45:37,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 108 flow [2023-01-28 06:45:37,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:45:37,042 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 55 flow [2023-01-28 06:45:37,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-01-28 06:45:37,045 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-01-28 06:45:37,045 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 55 flow [2023-01-28 06:45:37,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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 06:45:37,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:45:37,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:45:37,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:45:37,047 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:45:37,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:45:37,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1297324500, now seen corresponding path program 1 times [2023-01-28 06:45:37,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:45:37,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871892484] [2023-01-28 06:45:37,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:45:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:45:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:45:37,263 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 06:45:37,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:45:37,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871892484] [2023-01-28 06:45:37,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871892484] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:45:37,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:45:37,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:45:37,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114739307] [2023-01-28 06:45:37,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:45:37,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:45:37,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:45:37,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:45:37,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:45:37,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 176 [2023-01-28 06:45:37,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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 06:45:37,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:45:37,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 176 [2023-01-28 06:45:37,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:45:37,337 INFO L130 PetriNetUnfolder]: 157/278 cut-off events. [2023-01-28 06:45:37,338 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2023-01-28 06:45:37,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 278 events. 157/278 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 880 event pairs, 53 based on Foata normal form. 6/284 useless extension candidates. Maximal degree in co-relation 635. Up to 200 conditions per place. [2023-01-28 06:45:37,342 INFO L137 encePairwiseOnDemand]: 173/176 looper letters, 20 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2023-01-28 06:45:37,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 23 transitions, 111 flow [2023-01-28 06:45:37,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:45:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:45:37,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2023-01-28 06:45:37,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-01-28 06:45:37,345 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 242 transitions. [2023-01-28 06:45:37,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 242 transitions. [2023-01-28 06:45:37,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:45:37,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 242 transitions. [2023-01-28 06:45:37,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 06:45:37,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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 06:45:37,348 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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 06:45:37,348 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 55 flow. Second operand 3 states and 242 transitions. [2023-01-28 06:45:37,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 23 transitions, 111 flow [2023-01-28 06:45:37,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:45:37,349 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 63 flow [2023-01-28 06:45:37,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-01-28 06:45:37,351 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2023-01-28 06:45:37,353 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 63 flow [2023-01-28 06:45:37,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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 06:45:37,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:45:37,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:45:37,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:45:37,354 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:45:37,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:45:37,356 INFO L85 PathProgramCache]: Analyzing trace with hash 448608949, now seen corresponding path program 1 times [2023-01-28 06:45:37,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:45:37,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028870981] [2023-01-28 06:45:37,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:45:37,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:45:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:45:37,596 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 06:45:37,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:45:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028870981] [2023-01-28 06:45:37,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028870981] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:45:37,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:45:37,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:45:37,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947400521] [2023-01-28 06:45:37,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:45:37,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:45:37,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:45:37,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:45:37,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:45:37,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 176 [2023-01-28 06:45:37,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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 06:45:37,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:45:37,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 176 [2023-01-28 06:45:37,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:45:37,682 INFO L130 PetriNetUnfolder]: 143/256 cut-off events. [2023-01-28 06:45:37,683 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2023-01-28 06:45:37,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 256 events. 143/256 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 797 event pairs, 80 based on Foata normal form. 8/264 useless extension candidates. Maximal degree in co-relation 607. Up to 177 conditions per place. [2023-01-28 06:45:37,684 INFO L137 encePairwiseOnDemand]: 173/176 looper letters, 23 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2023-01-28 06:45:37,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 26 transitions, 133 flow [2023-01-28 06:45:37,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:45:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:45:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2023-01-28 06:45:37,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4640151515151515 [2023-01-28 06:45:37,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 245 transitions. [2023-01-28 06:45:37,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 245 transitions. [2023-01-28 06:45:37,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:45:37,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 245 transitions. [2023-01-28 06:45:37,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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 06:45:37,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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 06:45:37,692 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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 06:45:37,693 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 63 flow. Second operand 3 states and 245 transitions. [2023-01-28 06:45:37,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 26 transitions, 133 flow [2023-01-28 06:45:37,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 26 transitions, 127 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:45:37,695 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 68 flow [2023-01-28 06:45:37,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-01-28 06:45:37,696 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2023-01-28 06:45:37,696 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 68 flow [2023-01-28 06:45:37,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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 06:45:37,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:45:37,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:45:37,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:45:37,697 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:45:37,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:45:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash 247100980, now seen corresponding path program 1 times [2023-01-28 06:45:37,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:45:37,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86792390] [2023-01-28 06:45:37,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:45:37,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:45:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:45:38,005 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 06:45:38,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:45:38,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86792390] [2023-01-28 06:45:38,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86792390] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:45:38,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:45:38,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:45:38,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527425478] [2023-01-28 06:45:38,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:45:38,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:45:38,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:45:38,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:45:38,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:45:38,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 176 [2023-01-28 06:45:38,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 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 06:45:38,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:45:38,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 176 [2023-01-28 06:45:38,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:45:38,100 INFO L130 PetriNetUnfolder]: 63/151 cut-off events. [2023-01-28 06:45:38,101 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2023-01-28 06:45:38,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 151 events. 63/151 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 543 event pairs, 29 based on Foata normal form. 23/173 useless extension candidates. Maximal degree in co-relation 345. Up to 64 conditions per place. [2023-01-28 06:45:38,103 INFO L137 encePairwiseOnDemand]: 171/176 looper letters, 28 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2023-01-28 06:45:38,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 35 transitions, 174 flow [2023-01-28 06:45:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:45:38,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:45:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 329 transitions. [2023-01-28 06:45:38,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46732954545454547 [2023-01-28 06:45:38,105 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 329 transitions. [2023-01-28 06:45:38,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 329 transitions. [2023-01-28 06:45:38,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:45:38,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 329 transitions. [2023-01-28 06:45:38,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 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 06:45:38,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 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 06:45:38,108 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 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 06:45:38,108 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 68 flow. Second operand 4 states and 329 transitions. [2023-01-28 06:45:38,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 35 transitions, 174 flow [2023-01-28 06:45:38,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 35 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:45:38,111 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 92 flow [2023-01-28 06:45:38,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-01-28 06:45:38,113 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2023-01-28 06:45:38,113 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 92 flow [2023-01-28 06:45:38,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 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 06:45:38,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:45:38,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:45:38,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:45:38,114 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:45:38,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:45:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash 817851324, now seen corresponding path program 1 times [2023-01-28 06:45:38,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:45:38,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342232975] [2023-01-28 06:45:38,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:45:38,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:45:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:45:38,467 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 06:45:38,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:45:38,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342232975] [2023-01-28 06:45:38,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342232975] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:45:38,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:45:38,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:45:38,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227728941] [2023-01-28 06:45:38,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:45:38,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:45:38,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:45:38,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:45:38,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:45:38,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 176 [2023-01-28 06:45:38,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 76.4) internal successors, (382), 5 states have internal predecessors, (382), 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 06:45:38,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:45:38,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 176 [2023-01-28 06:45:38,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:45:38,538 INFO L130 PetriNetUnfolder]: 51/128 cut-off events. [2023-01-28 06:45:38,538 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2023-01-28 06:45:38,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 128 events. 51/128 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 448 event pairs, 29 based on Foata normal form. 9/136 useless extension candidates. Maximal degree in co-relation 357. Up to 64 conditions per place. [2023-01-28 06:45:38,539 INFO L137 encePairwiseOnDemand]: 171/176 looper letters, 20 selfloop transitions, 6 changer transitions 0/29 dead transitions. [2023-01-28 06:45:38,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 168 flow [2023-01-28 06:45:38,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:45:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:45:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 397 transitions. [2023-01-28 06:45:38,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4511363636363636 [2023-01-28 06:45:38,541 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 397 transitions. [2023-01-28 06:45:38,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 397 transitions. [2023-01-28 06:45:38,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:45:38,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 397 transitions. [2023-01-28 06:45:38,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 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 06:45:38,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 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 06:45:38,545 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 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 06:45:38,545 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 92 flow. Second operand 5 states and 397 transitions. [2023-01-28 06:45:38,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 168 flow [2023-01-28 06:45:38,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 152 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-01-28 06:45:38,546 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 107 flow [2023-01-28 06:45:38,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-01-28 06:45:38,547 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2023-01-28 06:45:38,547 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 107 flow [2023-01-28 06:45:38,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.4) internal successors, (382), 5 states have internal predecessors, (382), 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 06:45:38,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:45:38,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:45:38,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:45:38,548 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:45:38,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:45:38,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1380798545, now seen corresponding path program 1 times [2023-01-28 06:45:38,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:45:38,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423543523] [2023-01-28 06:45:38,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:45:38,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:45:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:45:38,755 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 06:45:38,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:45:38,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423543523] [2023-01-28 06:45:38,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423543523] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:45:38,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:45:38,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:45:38,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418625010] [2023-01-28 06:45:38,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:45:38,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:45:38,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:45:38,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:45:38,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:45:38,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 176 [2023-01-28 06:45:38,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 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 06:45:38,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:45:38,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 176 [2023-01-28 06:45:38,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:45:38,840 INFO L130 PetriNetUnfolder]: 95/211 cut-off events. [2023-01-28 06:45:38,840 INFO L131 PetriNetUnfolder]: For 327/327 co-relation queries the response was YES. [2023-01-28 06:45:38,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 211 events. 95/211 cut-off events. For 327/327 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 805 event pairs, 11 based on Foata normal form. 1/212 useless extension candidates. Maximal degree in co-relation 655. Up to 130 conditions per place. [2023-01-28 06:45:38,841 INFO L137 encePairwiseOnDemand]: 173/176 looper letters, 19 selfloop transitions, 1 changer transitions 22/42 dead transitions. [2023-01-28 06:45:38,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 295 flow [2023-01-28 06:45:38,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:45:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:45:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 328 transitions. [2023-01-28 06:45:38,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2023-01-28 06:45:38,843 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 328 transitions. [2023-01-28 06:45:38,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 328 transitions. [2023-01-28 06:45:38,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:45:38,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 328 transitions. [2023-01-28 06:45:38,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 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 06:45:38,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 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 06:45:38,845 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 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 06:45:38,845 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 107 flow. Second operand 4 states and 328 transitions. [2023-01-28 06:45:38,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 295 flow [2023-01-28 06:45:38,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 278 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-01-28 06:45:38,848 INFO L231 Difference]: Finished difference. Result has 36 places, 18 transitions, 87 flow [2023-01-28 06:45:38,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=36, PETRI_TRANSITIONS=18} [2023-01-28 06:45:38,848 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2023-01-28 06:45:38,848 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 18 transitions, 87 flow [2023-01-28 06:45:38,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 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 06:45:38,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:45:38,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:45:38,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:45:38,849 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:45:38,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:45:38,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2093331019, now seen corresponding path program 2 times [2023-01-28 06:45:38,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:45:38,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74426439] [2023-01-28 06:45:38,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:45:38,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:45:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:45:40,218 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 06:45:40,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:45:40,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74426439] [2023-01-28 06:45:40,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74426439] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:45:40,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:45:40,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:45:40,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234965644] [2023-01-28 06:45:40,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:45:40,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:45:40,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:45:40,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:45:40,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:45:40,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 176 [2023-01-28 06:45:40,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 18 transitions, 87 flow. Second operand has 7 states, 7 states have (on average 71.0) internal successors, (497), 7 states have internal predecessors, (497), 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 06:45:40,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:45:40,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 176 [2023-01-28 06:45:40,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:45:40,393 INFO L130 PetriNetUnfolder]: 10/46 cut-off events. [2023-01-28 06:45:40,393 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2023-01-28 06:45:40,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 46 events. 10/46 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 2 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 152. Up to 13 conditions per place. [2023-01-28 06:45:40,394 INFO L137 encePairwiseOnDemand]: 169/176 looper letters, 12 selfloop transitions, 5 changer transitions 10/29 dead transitions. [2023-01-28 06:45:40,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 29 transitions, 210 flow [2023-01-28 06:45:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:45:40,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:45:40,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 576 transitions. [2023-01-28 06:45:40,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2023-01-28 06:45:40,399 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 576 transitions. [2023-01-28 06:45:40,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 576 transitions. [2023-01-28 06:45:40,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:45:40,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 576 transitions. [2023-01-28 06:45:40,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 72.0) internal successors, (576), 8 states have internal predecessors, (576), 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 06:45:40,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 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 06:45:40,403 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 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 06:45:40,403 INFO L175 Difference]: Start difference. First operand has 36 places, 18 transitions, 87 flow. Second operand 8 states and 576 transitions. [2023-01-28 06:45:40,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 29 transitions, 210 flow [2023-01-28 06:45:40,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 148 flow, removed 9 selfloop flow, removed 9 redundant places. [2023-01-28 06:45:40,406 INFO L231 Difference]: Finished difference. Result has 35 places, 18 transitions, 72 flow [2023-01-28 06:45:40,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=72, PETRI_PLACES=35, PETRI_TRANSITIONS=18} [2023-01-28 06:45:40,408 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2023-01-28 06:45:40,408 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 18 transitions, 72 flow [2023-01-28 06:45:40,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 71.0) internal successors, (497), 7 states have internal predecessors, (497), 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 06:45:40,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:45:40,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:45:40,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:45:40,409 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:45:40,413 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:45:40,413 INFO L85 PathProgramCache]: Analyzing trace with hash 466078297, now seen corresponding path program 3 times [2023-01-28 06:45:40,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:45:40,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112107802] [2023-01-28 06:45:40,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:45:40,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:45:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:45:40,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:45:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:45:40,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:45:40,566 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:45:40,566 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 06:45:40,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 06:45:40,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 06:45:40,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 06:45:40,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 06:45:40,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:45:40,569 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-01-28 06:45:40,573 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:45:40,573 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:45:40,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:45:40 BasicIcfg [2023-01-28 06:45:40,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:45:40,636 INFO L158 Benchmark]: Toolchain (without parser) took 9256.69ms. Allocated memory was 379.6MB in the beginning and 549.5MB in the end (delta: 169.9MB). Free memory was 337.2MB in the beginning and 474.0MB in the end (delta: -136.7MB). Peak memory consumption was 35.9MB. Max. memory is 16.0GB. [2023-01-28 06:45:40,636 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:45:40,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.14ms. Allocated memory is still 379.6MB. Free memory was 337.2MB in the beginning and 313.9MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 06:45:40,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.18ms. Allocated memory is still 379.6MB. Free memory was 313.9MB in the beginning and 311.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 06:45:40,640 INFO L158 Benchmark]: Boogie Preprocessor took 37.37ms. Allocated memory is still 379.6MB. Free memory was 311.0MB in the beginning and 309.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:45:40,640 INFO L158 Benchmark]: RCFGBuilder took 689.41ms. Allocated memory is still 379.6MB. Free memory was 309.3MB in the beginning and 334.1MB in the end (delta: -24.9MB). Peak memory consumption was 22.9MB. Max. memory is 16.0GB. [2023-01-28 06:45:40,640 INFO L158 Benchmark]: TraceAbstraction took 7928.54ms. Allocated memory was 379.6MB in the beginning and 549.5MB in the end (delta: 169.9MB). Free memory was 333.3MB in the beginning and 474.0MB in the end (delta: -140.6MB). Peak memory consumption was 29.7MB. Max. memory is 16.0GB. [2023-01-28 06:45:40,645 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.11ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 543.14ms. Allocated memory is still 379.6MB. Free memory was 337.2MB in the beginning and 313.9MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.18ms. Allocated memory is still 379.6MB. Free memory was 313.9MB in the beginning and 311.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.37ms. Allocated memory is still 379.6MB. Free memory was 311.0MB in the beginning and 309.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 689.41ms. Allocated memory is still 379.6MB. Free memory was 309.3MB in the beginning and 334.1MB in the end (delta: -24.9MB). Peak memory consumption was 22.9MB. Max. memory is 16.0GB. * TraceAbstraction took 7928.54ms. Allocated memory was 379.6MB in the beginning and 549.5MB in the end (delta: 169.9MB). Free memory was 333.3MB in the beginning and 474.0MB in the end (delta: -140.6MB). Peak memory consumption was 29.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 94 PlacesBefore, 25 PlacesAfterwards, 89 TransitionsBefore, 19 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 85 TotalNumberOfCompositions, 2899 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1287, independent: 1162, independent conditional: 0, independent unconditional: 1162, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 641, independent: 611, independent conditional: 0, independent unconditional: 611, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1287, independent: 551, independent conditional: 0, independent unconditional: 551, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 641, unknown conditional: 0, unknown unconditional: 641] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t0; [L827] FCALL, FORK 0 pthread_create(&t0, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0, ((void *)0), P0, ((void *)0))=-2, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L828] 0 pthread_t t1; [L829] FCALL, FORK 0 pthread_create(&t1, ((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(&t1, ((void *)0), P1, ((void *)0))=-1, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = (_Bool)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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 x$flush_delayed = weak$$choice2 [L788] 2 x$mem_tmp = x [L789] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L790] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L791] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L792] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L793] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L795] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = x [L797] 2 x = x$flush_delayed ? x$mem_tmp : x [L798] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L801] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __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$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L746] 1 __unbuffered_p0_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$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$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$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L805] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L806] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L807] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L808] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __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, t0={5:0}, t1={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __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, t0={5:0}, t1={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __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$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] - UnprovableResult [Line: 19]: 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: 829]: 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: 827]: 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, 110 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: 7.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 338 IncrementalHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 7 mSDtfsCounter, 338 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=6, InterpolantAutomatonStates: 33, 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.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 737 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! [2023-01-28 06:45:40,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...