/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/safe000_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:59:36,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:59:36,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:59:36,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:59:36,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:59:36,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:59:36,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:59:36,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:59:36,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:59:36,781 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:59:36,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:59:36,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:59:36,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:59:36,785 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:59:36,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:59:36,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:59:36,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:59:36,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:59:36,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:59:36,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:59:36,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:59:36,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:59:36,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:59:36,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:59:36,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:59:36,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:59:36,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:59:36,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:59:36,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:59:36,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:59:36,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:59:36,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:59:36,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:59:36,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:59:36,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:59:36,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:59:36,807 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:59:36,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:59:36,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:59:36,808 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:59:36,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:59:36,809 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:59:36,829 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:59:36,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:59:36,830 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:59:36,830 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:59:36,831 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:59:36,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:59:36,831 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:59:36,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:59:36,831 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:59:36,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:59:36,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:59:36,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:59:36,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:59:36,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:59:36,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:59:36,832 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:59:36,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:59:36,833 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:59:36,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:59:36,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:59:36,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:59:36,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:59:36,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:59:36,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:59:36,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:59:36,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:59:36,833 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:59:36,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:59:36,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:59:36,834 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:59:36,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:59:36,834 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:59:37,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:59:37,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:59:37,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:59:37,031 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:59:37,033 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:59:37,033 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_rmo.i [2023-01-28 06:59:37,971 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:59:38,238 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:59:38,239 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_rmo.i [2023-01-28 06:59:38,249 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/235e04ad1/84267217d13a48cc81e17632f43fb7b4/FLAG6340f640b [2023-01-28 06:59:38,582 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/235e04ad1/84267217d13a48cc81e17632f43fb7b4 [2023-01-28 06:59:38,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:59:38,585 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:59:38,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:59:38,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:59:38,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:59:38,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:59:38" (1/1) ... [2023-01-28 06:59:38,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74543659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:38, skipping insertion in model container [2023-01-28 06:59:38,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:59:38" (1/1) ... [2023-01-28 06:59:38,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:59:38,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:59:38,788 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/safe000_rmo.i[988,1001] [2023-01-28 06:59:38,978 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:59:38,989 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:59:38,998 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/safe000_rmo.i[988,1001] [2023-01-28 06:59:39,049 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:59:39,071 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:59:39,071 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:59:39,076 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:59:39,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:39 WrapperNode [2023-01-28 06:59:39,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:59:39,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:59:39,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:59:39,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:59:39,082 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:59:39" (1/1) ... [2023-01-28 06:59:39,108 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:59:39" (1/1) ... [2023-01-28 06:59:39,138 INFO L138 Inliner]: procedures = 176, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2023-01-28 06:59:39,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:59:39,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:59:39,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:59:39,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:59:39,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:39" (1/1) ... [2023-01-28 06:59:39,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:39" (1/1) ... [2023-01-28 06:59:39,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:39" (1/1) ... [2023-01-28 06:59:39,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:39" (1/1) ... [2023-01-28 06:59:39,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:39" (1/1) ... [2023-01-28 06:59:39,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:39" (1/1) ... [2023-01-28 06:59:39,172 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:39" (1/1) ... [2023-01-28 06:59:39,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:39" (1/1) ... [2023-01-28 06:59:39,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:59:39,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:59:39,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:59:39,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:59:39,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:39" (1/1) ... [2023-01-28 06:59:39,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:59:39,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:59:39,197 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:59:39,213 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:59:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 06:59:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:59:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:59:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:59:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:59:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:59:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:59:39,221 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:59:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:59:39,221 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:59:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:59:39,221 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:59:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:59:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:59:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:59:39,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:59:39,223 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:59:39,317 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:59:39,318 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:59:39,610 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:59:39,867 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:59:39,867 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:59:39,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:59:39 BoogieIcfgContainer [2023-01-28 06:59:39,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:59:39,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:59:39,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:59:39,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:59:39,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:59:38" (1/3) ... [2023-01-28 06:59:39,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8ad686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:59:39, skipping insertion in model container [2023-01-28 06:59:39,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:39" (2/3) ... [2023-01-28 06:59:39,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8ad686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:59:39, skipping insertion in model container [2023-01-28 06:59:39,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:59:39" (3/3) ... [2023-01-28 06:59:39,875 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_rmo.i [2023-01-28 06:59:39,889 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:59:39,889 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 06:59:39,889 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:59:39,948 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:59:39,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2023-01-28 06:59:40,032 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-01-28 06:59:40,032 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:59:40,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-01-28 06:59:40,037 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2023-01-28 06:59:40,048 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2023-01-28 06:59:40,051 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:59:40,065 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2023-01-28 06:59:40,067 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2023-01-28 06:59:40,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2023-01-28 06:59:40,086 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2023-01-28 06:59:40,086 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:59:40,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-01-28 06:59:40,088 INFO L119 LiptonReduction]: Number of co-enabled transitions 1212 [2023-01-28 06:59:45,931 INFO L134 LiptonReduction]: Checked pairs total: 3777 [2023-01-28 06:59:45,932 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-01-28 06:59:45,941 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:59:45,946 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;@4622c720, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:59:45,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 06:59:45,951 INFO L130 PetriNetUnfolder]: 1/20 cut-off events. [2023-01-28 06:59:45,951 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:59:45,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:45,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:45,952 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 06:59:45,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:45,955 INFO L85 PathProgramCache]: Analyzing trace with hash -378234055, now seen corresponding path program 1 times [2023-01-28 06:59:45,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:45,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477407591] [2023-01-28 06:59:45,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:45,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:46,113 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:59:46,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:46,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477407591] [2023-01-28 06:59:46,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477407591] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:46,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:46,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:59:46,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423271127] [2023-01-28 06:59:46,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:46,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-28 06:59:46,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:46,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-28 06:59:46,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-28 06:59:46,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 217 [2023-01-28 06:59:46,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 53 flow. Second operand has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 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:59:46,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:46,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 217 [2023-01-28 06:59:46,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:46,344 INFO L130 PetriNetUnfolder]: 511/808 cut-off events. [2023-01-28 06:59:46,344 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-01-28 06:59:46,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1627 conditions, 808 events. 511/808 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3533 event pairs, 511 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 1616. Up to 783 conditions per place. [2023-01-28 06:59:46,353 INFO L137 encePairwiseOnDemand]: 216/217 looper letters, 18 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2023-01-28 06:59:46,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 87 flow [2023-01-28 06:59:46,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-28 06:59:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-28 06:59:46,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 245 transitions. [2023-01-28 06:59:46,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5645161290322581 [2023-01-28 06:59:46,366 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 245 transitions. [2023-01-28 06:59:46,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 245 transitions. [2023-01-28 06:59:46,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:46,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 245 transitions. [2023-01-28 06:59:46,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 122.5) internal successors, (245), 2 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:59:46,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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:59:46,376 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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:59:46,377 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 53 flow. Second operand 2 states and 245 transitions. [2023-01-28 06:59:46,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 87 flow [2023-01-28 06:59:46,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 06:59:46,381 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 48 flow [2023-01-28 06:59:46,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=48, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-01-28 06:59:46,386 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-01-28 06:59:46,386 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 48 flow [2023-01-28 06:59:46,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 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:59:46,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:46,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:46,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:59:46,388 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 06:59:46,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:46,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1159102893, now seen corresponding path program 1 times [2023-01-28 06:59:46,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:46,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936610819] [2023-01-28 06:59:46,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:46,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:46,771 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:59:46,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:46,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936610819] [2023-01-28 06:59:46,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936610819] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:46,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:46,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:59:46,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755338315] [2023-01-28 06:59:46,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:46,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:59:46,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:46,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:59:46,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:59:46,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217 [2023-01-28 06:59:46,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 48 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 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:59:46,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:46,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217 [2023-01-28 06:59:46,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:46,995 INFO L130 PetriNetUnfolder]: 521/860 cut-off events. [2023-01-28 06:59:46,996 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:59:46,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 860 events. 521/860 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4021 event pairs, 168 based on Foata normal form. 48/904 useless extension candidates. Maximal degree in co-relation 1708. Up to 604 conditions per place. [2023-01-28 06:59:46,999 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 25 selfloop transitions, 2 changer transitions 14/44 dead transitions. [2023-01-28 06:59:46,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 178 flow [2023-01-28 06:59:47,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:59:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:59:47,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2023-01-28 06:59:47,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5419354838709678 [2023-01-28 06:59:47,002 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 588 transitions. [2023-01-28 06:59:47,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 588 transitions. [2023-01-28 06:59:47,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:47,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 588 transitions. [2023-01-28 06:59:47,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 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:59:47,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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:59:47,006 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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:59:47,006 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 48 flow. Second operand 5 states and 588 transitions. [2023-01-28 06:59:47,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 178 flow [2023-01-28 06:59:47,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 44 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:59:47,008 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 60 flow [2023-01-28 06:59:47,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2023-01-28 06:59:47,008 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2023-01-28 06:59:47,008 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 21 transitions, 60 flow [2023-01-28 06:59:47,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 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:59:47,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:47,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:47,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:59:47,009 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 06:59:47,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:47,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1572474054, now seen corresponding path program 1 times [2023-01-28 06:59:47,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:47,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801780961] [2023-01-28 06:59:47,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:47,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:47,198 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:59:47,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:47,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801780961] [2023-01-28 06:59:47,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801780961] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:47,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:47,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:59:47,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895321324] [2023-01-28 06:59:47,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:47,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:59:47,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:47,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:59:47,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:59:47,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 217 [2023-01-28 06:59:47,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 21 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 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:59:47,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:47,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 217 [2023-01-28 06:59:47,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:47,374 INFO L130 PetriNetUnfolder]: 459/777 cut-off events. [2023-01-28 06:59:47,374 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2023-01-28 06:59:47,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1715 conditions, 777 events. 459/777 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3633 event pairs, 114 based on Foata normal form. 36/809 useless extension candidates. Maximal degree in co-relation 1708. Up to 496 conditions per place. [2023-01-28 06:59:47,377 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 23 selfloop transitions, 2 changer transitions 12/40 dead transitions. [2023-01-28 06:59:47,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 177 flow [2023-01-28 06:59:47,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:59:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:59:47,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2023-01-28 06:59:47,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2023-01-28 06:59:47,380 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2023-01-28 06:59:47,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2023-01-28 06:59:47,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:47,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2023-01-28 06:59:47,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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:59:47,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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:59:47,383 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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:59:47,383 INFO L175 Difference]: Start difference. First operand has 36 places, 21 transitions, 60 flow. Second operand 5 states and 589 transitions. [2023-01-28 06:59:47,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 177 flow [2023-01-28 06:59:47,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 167 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 06:59:47,386 INFO L231 Difference]: Finished difference. Result has 37 places, 21 transitions, 64 flow [2023-01-28 06:59:47,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=21} [2023-01-28 06:59:47,387 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-01-28 06:59:47,387 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 21 transitions, 64 flow [2023-01-28 06:59:47,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 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:59:47,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:47,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:47,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:59:47,388 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 06:59:47,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash -82500333, now seen corresponding path program 1 times [2023-01-28 06:59:47,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:47,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008979545] [2023-01-28 06:59:47,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:47,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:47,579 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:59:47,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:47,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008979545] [2023-01-28 06:59:47,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008979545] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:47,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:47,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:59:47,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650860540] [2023-01-28 06:59:47,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:47,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:59:47,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:47,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:59:47,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:59:47,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 217 [2023-01-28 06:59:47,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 21 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 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:59:47,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:47,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 217 [2023-01-28 06:59:47,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:47,818 INFO L130 PetriNetUnfolder]: 692/1119 cut-off events. [2023-01-28 06:59:47,818 INFO L131 PetriNetUnfolder]: For 248/248 co-relation queries the response was YES. [2023-01-28 06:59:47,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2595 conditions, 1119 events. 692/1119 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5542 event pairs, 207 based on Foata normal form. 36/1147 useless extension candidates. Maximal degree in co-relation 2587. Up to 343 conditions per place. [2023-01-28 06:59:47,822 INFO L137 encePairwiseOnDemand]: 212/217 looper letters, 33 selfloop transitions, 3 changer transitions 18/56 dead transitions. [2023-01-28 06:59:47,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 263 flow [2023-01-28 06:59:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:59:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:59:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 698 transitions. [2023-01-28 06:59:47,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5360983102918587 [2023-01-28 06:59:47,824 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 698 transitions. [2023-01-28 06:59:47,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 698 transitions. [2023-01-28 06:59:47,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:47,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 698 transitions. [2023-01-28 06:59:47,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 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:59:47,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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:59:47,827 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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:59:47,827 INFO L175 Difference]: Start difference. First operand has 37 places, 21 transitions, 64 flow. Second operand 6 states and 698 transitions. [2023-01-28 06:59:47,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 56 transitions, 263 flow [2023-01-28 06:59:47,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 56 transitions, 251 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 06:59:47,830 INFO L231 Difference]: Finished difference. Result has 40 places, 21 transitions, 74 flow [2023-01-28 06:59:47,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=40, PETRI_TRANSITIONS=21} [2023-01-28 06:59:47,830 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2023-01-28 06:59:47,830 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 21 transitions, 74 flow [2023-01-28 06:59:47,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 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:59:47,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:47,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:47,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:59:47,831 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 06:59:47,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:47,831 INFO L85 PathProgramCache]: Analyzing trace with hash -545466893, now seen corresponding path program 1 times [2023-01-28 06:59:47,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:47,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102418457] [2023-01-28 06:59:47,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:47,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:48,988 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:59:48,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:48,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102418457] [2023-01-28 06:59:48,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102418457] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:48,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:48,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 06:59:48,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661295376] [2023-01-28 06:59:48,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:48,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 06:59:48,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:48,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 06:59:48,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-01-28 06:59:48,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 217 [2023-01-28 06:59:48,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 21 transitions, 74 flow. Second operand has 9 states, 9 states have (on average 86.44444444444444) internal successors, (778), 9 states have internal predecessors, (778), 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:59:48,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:48,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 217 [2023-01-28 06:59:48,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:49,162 INFO L130 PetriNetUnfolder]: 472/760 cut-off events. [2023-01-28 06:59:49,162 INFO L131 PetriNetUnfolder]: For 469/470 co-relation queries the response was YES. [2023-01-28 06:59:49,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 760 events. 472/760 cut-off events. For 469/470 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2871 event pairs, 174 based on Foata normal form. 32/791 useless extension candidates. Maximal degree in co-relation 1876. Up to 596 conditions per place. [2023-01-28 06:59:49,165 INFO L137 encePairwiseOnDemand]: 212/217 looper letters, 27 selfloop transitions, 3 changer transitions 11/42 dead transitions. [2023-01-28 06:59:49,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 213 flow [2023-01-28 06:59:49,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:59:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:59:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2023-01-28 06:59:49,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4313364055299539 [2023-01-28 06:59:49,166 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 468 transitions. [2023-01-28 06:59:49,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 468 transitions. [2023-01-28 06:59:49,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:49,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 468 transitions. [2023-01-28 06:59:49,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 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:59:49,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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:59:49,169 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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:59:49,169 INFO L175 Difference]: Start difference. First operand has 40 places, 21 transitions, 74 flow. Second operand 5 states and 468 transitions. [2023-01-28 06:59:49,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 213 flow [2023-01-28 06:59:49,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 191 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-01-28 06:59:49,171 INFO L231 Difference]: Finished difference. Result has 39 places, 23 transitions, 85 flow [2023-01-28 06:59:49,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2023-01-28 06:59:49,171 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2023-01-28 06:59:49,171 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 85 flow [2023-01-28 06:59:49,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.44444444444444) internal successors, (778), 9 states have internal predecessors, (778), 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:59:49,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:49,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:49,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:59:49,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 06:59:49,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:49,172 INFO L85 PathProgramCache]: Analyzing trace with hash -448149755, now seen corresponding path program 1 times [2023-01-28 06:59:49,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:49,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123596794] [2023-01-28 06:59:49,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:49,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:49,846 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:59:49,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:49,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123596794] [2023-01-28 06:59:49,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123596794] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:49,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:49,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:59:49,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474139923] [2023-01-28 06:59:49,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:49,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:59:49,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:49,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:59:49,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:59:49,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 217 [2023-01-28 06:59:49,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 23 transitions, 85 flow. Second operand has 8 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 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:59:49,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:49,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 217 [2023-01-28 06:59:49,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:50,082 INFO L130 PetriNetUnfolder]: 686/1094 cut-off events. [2023-01-28 06:59:50,082 INFO L131 PetriNetUnfolder]: For 576/577 co-relation queries the response was YES. [2023-01-28 06:59:50,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2847 conditions, 1094 events. 686/1094 cut-off events. For 576/577 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4608 event pairs, 147 based on Foata normal form. 30/1123 useless extension candidates. Maximal degree in co-relation 2838. Up to 431 conditions per place. [2023-01-28 06:59:50,086 INFO L137 encePairwiseOnDemand]: 209/217 looper letters, 34 selfloop transitions, 4 changer transitions 23/62 dead transitions. [2023-01-28 06:59:50,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 332 flow [2023-01-28 06:59:50,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:59:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:59:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 580 transitions. [2023-01-28 06:59:50,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445468509984639 [2023-01-28 06:59:50,088 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 580 transitions. [2023-01-28 06:59:50,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 580 transitions. [2023-01-28 06:59:50,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:50,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 580 transitions. [2023-01-28 06:59:50,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 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:59:50,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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:59:50,091 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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:59:50,091 INFO L175 Difference]: Start difference. First operand has 39 places, 23 transitions, 85 flow. Second operand 6 states and 580 transitions. [2023-01-28 06:59:50,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 62 transitions, 332 flow [2023-01-28 06:59:50,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 62 transitions, 323 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 06:59:50,093 INFO L231 Difference]: Finished difference. Result has 44 places, 25 transitions, 116 flow [2023-01-28 06:59:50,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=25} [2023-01-28 06:59:50,094 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2023-01-28 06:59:50,094 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 25 transitions, 116 flow [2023-01-28 06:59:50,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 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:59:50,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:50,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:50,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:59:50,095 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 06:59:50,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:50,095 INFO L85 PathProgramCache]: Analyzing trace with hash 845714217, now seen corresponding path program 2 times [2023-01-28 06:59:50,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:50,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249279620] [2023-01-28 06:59:50,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:50,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:50,853 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:59:50,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:50,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249279620] [2023-01-28 06:59:50,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249279620] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:50,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:50,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:59:50,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548653150] [2023-01-28 06:59:50,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:50,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:59:50,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:50,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:59:50,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:59:50,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 217 [2023-01-28 06:59:50,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 25 transitions, 116 flow. Second operand has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 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:59:50,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:50,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 217 [2023-01-28 06:59:50,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:51,068 INFO L130 PetriNetUnfolder]: 435/713 cut-off events. [2023-01-28 06:59:51,068 INFO L131 PetriNetUnfolder]: For 729/730 co-relation queries the response was YES. [2023-01-28 06:59:51,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2072 conditions, 713 events. 435/713 cut-off events. For 729/730 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2725 event pairs, 253 based on Foata normal form. 30/742 useless extension candidates. Maximal degree in co-relation 2060. Up to 563 conditions per place. [2023-01-28 06:59:51,071 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 28 selfloop transitions, 7 changer transitions 12/48 dead transitions. [2023-01-28 06:59:51,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 290 flow [2023-01-28 06:59:51,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:59:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:59:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 621 transitions. [2023-01-28 06:59:51,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4769585253456221 [2023-01-28 06:59:51,073 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 621 transitions. [2023-01-28 06:59:51,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 621 transitions. [2023-01-28 06:59:51,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:51,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 621 transitions. [2023-01-28 06:59:51,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 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:59:51,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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:59:51,076 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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:59:51,076 INFO L175 Difference]: Start difference. First operand has 44 places, 25 transitions, 116 flow. Second operand 6 states and 621 transitions. [2023-01-28 06:59:51,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 290 flow [2023-01-28 06:59:51,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 271 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-01-28 06:59:51,078 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 149 flow [2023-01-28 06:59:51,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2023-01-28 06:59:51,079 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2023-01-28 06:59:51,079 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 149 flow [2023-01-28 06:59:51,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 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:59:51,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:51,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:51,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:59:51,080 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 06:59:51,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:51,080 INFO L85 PathProgramCache]: Analyzing trace with hash 925839514, now seen corresponding path program 1 times [2023-01-28 06:59:51,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:51,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973399082] [2023-01-28 06:59:51,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:51,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:51,949 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:59:51,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:51,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973399082] [2023-01-28 06:59:51,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973399082] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:51,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:51,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 06:59:51,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035297090] [2023-01-28 06:59:51,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:51,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 06:59:51,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:51,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 06:59:51,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-01-28 06:59:51,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 217 [2023-01-28 06:59:51,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 28 transitions, 149 flow. Second operand has 9 states, 9 states have (on average 86.55555555555556) internal successors, (779), 9 states have internal predecessors, (779), 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:59:51,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:51,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 217 [2023-01-28 06:59:51,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:52,224 INFO L130 PetriNetUnfolder]: 462/765 cut-off events. [2023-01-28 06:59:52,224 INFO L131 PetriNetUnfolder]: For 1324/1325 co-relation queries the response was YES. [2023-01-28 06:59:52,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2518 conditions, 765 events. 462/765 cut-off events. For 1324/1325 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3056 event pairs, 69 based on Foata normal form. 40/804 useless extension candidates. Maximal degree in co-relation 2505. Up to 370 conditions per place. [2023-01-28 06:59:52,227 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 31 selfloop transitions, 4 changer transitions 28/64 dead transitions. [2023-01-28 06:59:52,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 435 flow [2023-01-28 06:59:52,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:59:52,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:59:52,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 653 transitions. [2023-01-28 06:59:52,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298880842659645 [2023-01-28 06:59:52,229 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 653 transitions. [2023-01-28 06:59:52,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 653 transitions. [2023-01-28 06:59:52,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:52,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 653 transitions. [2023-01-28 06:59:52,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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:59:52,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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:59:52,234 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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:59:52,234 INFO L175 Difference]: Start difference. First operand has 47 places, 28 transitions, 149 flow. Second operand 7 states and 653 transitions. [2023-01-28 06:59:52,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 435 flow [2023-01-28 06:59:52,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 399 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-01-28 06:59:52,238 INFO L231 Difference]: Finished difference. Result has 51 places, 26 transitions, 140 flow [2023-01-28 06:59:52,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=51, PETRI_TRANSITIONS=26} [2023-01-28 06:59:52,239 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2023-01-28 06:59:52,240 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 26 transitions, 140 flow [2023-01-28 06:59:52,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.55555555555556) internal successors, (779), 9 states have internal predecessors, (779), 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:59:52,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:52,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:52,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:59:52,241 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 06:59:52,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:52,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1068793665, now seen corresponding path program 3 times [2023-01-28 06:59:52,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:52,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523126093] [2023-01-28 06:59:52,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:52,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:53,432 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:59:53,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:53,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523126093] [2023-01-28 06:59:53,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523126093] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:53,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:53,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-28 06:59:53,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583904765] [2023-01-28 06:59:53,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:53,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 06:59:53,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:53,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 06:59:53,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-01-28 06:59:53,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 217 [2023-01-28 06:59:53,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 26 transitions, 140 flow. Second operand has 10 states, 10 states have (on average 83.4) internal successors, (834), 10 states have internal predecessors, (834), 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:59:53,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:53,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 217 [2023-01-28 06:59:53,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:53,738 INFO L130 PetriNetUnfolder]: 331/554 cut-off events. [2023-01-28 06:59:53,738 INFO L131 PetriNetUnfolder]: For 1282/1282 co-relation queries the response was YES. [2023-01-28 06:59:53,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 554 events. 331/554 cut-off events. For 1282/1282 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1920 event pairs, 41 based on Foata normal form. 24/578 useless extension candidates. Maximal degree in co-relation 1823. Up to 257 conditions per place. [2023-01-28 06:59:53,741 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 39 selfloop transitions, 9 changer transitions 7/56 dead transitions. [2023-01-28 06:59:53,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 380 flow [2023-01-28 06:59:53,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:59:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:59:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 627 transitions. [2023-01-28 06:59:53,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.412771560236998 [2023-01-28 06:59:53,750 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 627 transitions. [2023-01-28 06:59:53,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 627 transitions. [2023-01-28 06:59:53,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:53,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 627 transitions. [2023-01-28 06:59:53,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.57142857142857) internal successors, (627), 7 states have internal predecessors, (627), 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:59:53,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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:59:53,754 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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:59:53,754 INFO L175 Difference]: Start difference. First operand has 51 places, 26 transitions, 140 flow. Second operand 7 states and 627 transitions. [2023-01-28 06:59:53,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 380 flow [2023-01-28 06:59:53,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 332 flow, removed 14 selfloop flow, removed 10 redundant places. [2023-01-28 06:59:53,757 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 152 flow [2023-01-28 06:59:53,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2023-01-28 06:59:53,758 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2023-01-28 06:59:53,758 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 152 flow [2023-01-28 06:59:53,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 83.4) internal successors, (834), 10 states have internal predecessors, (834), 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:59:53,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:53,759 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:59:53,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:59:53,759 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 06:59:53,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:53,759 INFO L85 PathProgramCache]: Analyzing trace with hash 198822626, now seen corresponding path program 1 times [2023-01-28 06:59:53,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:53,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334081777] [2023-01-28 06:59:53,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:53,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:54,775 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:59:54,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:54,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334081777] [2023-01-28 06:59:54,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334081777] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:54,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:54,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:59:54,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31122131] [2023-01-28 06:59:54,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:54,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:59:54,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:54,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:59:54,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:59:54,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217 [2023-01-28 06:59:54,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 28 transitions, 152 flow. Second operand has 8 states, 8 states have (on average 96.875) internal successors, (775), 8 states have internal predecessors, (775), 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:59:54,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:54,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217 [2023-01-28 06:59:54,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:55,056 INFO L130 PetriNetUnfolder]: 373/614 cut-off events. [2023-01-28 06:59:55,056 INFO L131 PetriNetUnfolder]: For 912/912 co-relation queries the response was YES. [2023-01-28 06:59:55,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1988 conditions, 614 events. 373/614 cut-off events. For 912/912 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2212 event pairs, 92 based on Foata normal form. 16/630 useless extension candidates. Maximal degree in co-relation 1977. Up to 455 conditions per place. [2023-01-28 06:59:55,059 INFO L137 encePairwiseOnDemand]: 208/217 looper letters, 32 selfloop transitions, 11 changer transitions 8/52 dead transitions. [2023-01-28 06:59:55,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 352 flow [2023-01-28 06:59:55,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:59:55,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:59:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 713 transitions. [2023-01-28 06:59:55,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2023-01-28 06:59:55,061 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 713 transitions. [2023-01-28 06:59:55,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 713 transitions. [2023-01-28 06:59:55,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:55,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 713 transitions. [2023-01-28 06:59:55,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.85714285714286) internal successors, (713), 7 states have internal predecessors, (713), 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:59:55,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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:59:55,064 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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:59:55,064 INFO L175 Difference]: Start difference. First operand has 46 places, 28 transitions, 152 flow. Second operand 7 states and 713 transitions. [2023-01-28 06:59:55,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 352 flow [2023-01-28 06:59:55,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 334 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-01-28 06:59:55,067 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 220 flow [2023-01-28 06:59:55,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2023-01-28 06:59:55,068 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2023-01-28 06:59:55,068 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 220 flow [2023-01-28 06:59:55,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.875) internal successors, (775), 8 states have internal predecessors, (775), 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:59:55,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:55,069 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:59:55,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:59:55,069 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 06:59:55,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:55,069 INFO L85 PathProgramCache]: Analyzing trace with hash 947000612, now seen corresponding path program 1 times [2023-01-28 06:59:55,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:55,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914139887] [2023-01-28 06:59:55,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:55,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:55,256 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:59:55,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:55,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914139887] [2023-01-28 06:59:55,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914139887] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:55,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:55,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:59:55,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392595761] [2023-01-28 06:59:55,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:55,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:59:55,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:55,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:59:55,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:59:55,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 217 [2023-01-28 06:59:55,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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:59:55,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:55,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 217 [2023-01-28 06:59:55,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:55,367 INFO L130 PetriNetUnfolder]: 262/478 cut-off events. [2023-01-28 06:59:55,367 INFO L131 PetriNetUnfolder]: For 941/974 co-relation queries the response was YES. [2023-01-28 06:59:55,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 478 events. 262/478 cut-off events. For 941/974 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1977 event pairs, 64 based on Foata normal form. 69/543 useless extension candidates. Maximal degree in co-relation 1548. Up to 329 conditions per place. [2023-01-28 06:59:55,370 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 42 selfloop transitions, 7 changer transitions 11/68 dead transitions. [2023-01-28 06:59:55,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 500 flow [2023-01-28 06:59:55,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:59:55,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:59:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2023-01-28 06:59:55,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5317972350230414 [2023-01-28 06:59:55,371 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 577 transitions. [2023-01-28 06:59:55,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 577 transitions. [2023-01-28 06:59:55,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:55,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 577 transitions. [2023-01-28 06:59:55,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 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:59:55,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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:59:55,374 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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:59:55,374 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 220 flow. Second operand 5 states and 577 transitions. [2023-01-28 06:59:55,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 500 flow [2023-01-28 06:59:55,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 478 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-01-28 06:59:55,377 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 263 flow [2023-01-28 06:59:55,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-01-28 06:59:55,378 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2023-01-28 06:59:55,378 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 263 flow [2023-01-28 06:59:55,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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:59:55,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:55,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:55,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:59:55,379 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 06:59:55,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:55,379 INFO L85 PathProgramCache]: Analyzing trace with hash 657257936, now seen corresponding path program 1 times [2023-01-28 06:59:55,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:55,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415052064] [2023-01-28 06:59:55,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:55,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:55,597 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:59:55,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:55,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415052064] [2023-01-28 06:59:55,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415052064] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:55,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:55,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:59:55,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512071419] [2023-01-28 06:59:55,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:55,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:59:55,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:55,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:59:55,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:59:55,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 217 [2023-01-28 06:59:55,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 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:59:55,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:55,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 217 [2023-01-28 06:59:55,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:55,713 INFO L130 PetriNetUnfolder]: 174/353 cut-off events. [2023-01-28 06:59:55,714 INFO L131 PetriNetUnfolder]: For 843/869 co-relation queries the response was YES. [2023-01-28 06:59:55,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1389 conditions, 353 events. 174/353 cut-off events. For 843/869 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1502 event pairs, 12 based on Foata normal form. 52/403 useless extension candidates. Maximal degree in co-relation 1374. Up to 146 conditions per place. [2023-01-28 06:59:55,715 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 43 selfloop transitions, 13 changer transitions 15/77 dead transitions. [2023-01-28 06:59:55,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 77 transitions, 590 flow [2023-01-28 06:59:55,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:59:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:59:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 803 transitions. [2023-01-28 06:59:55,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286372613561554 [2023-01-28 06:59:55,717 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 803 transitions. [2023-01-28 06:59:55,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 803 transitions. [2023-01-28 06:59:55,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:55,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 803 transitions. [2023-01-28 06:59:55,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 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:59:55,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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:59:55,721 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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:59:55,721 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 263 flow. Second operand 7 states and 803 transitions. [2023-01-28 06:59:55,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 77 transitions, 590 flow [2023-01-28 06:59:55,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 555 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-01-28 06:59:55,723 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 282 flow [2023-01-28 06:59:55,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2023-01-28 06:59:55,724 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2023-01-28 06:59:55,724 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 282 flow [2023-01-28 06:59:55,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 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:59:55,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:55,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:55,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:59:55,725 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 06:59:55,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:55,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1125255683, now seen corresponding path program 1 times [2023-01-28 06:59:55,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:55,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409538641] [2023-01-28 06:59:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:55,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:56,459 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:59:56,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:56,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409538641] [2023-01-28 06:59:56,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409538641] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:56,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:56,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:59:56,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882355349] [2023-01-28 06:59:56,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:56,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:59:56,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:56,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:59:56,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:59:56,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 217 [2023-01-28 06:59:56,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 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:59:56,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:56,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 217 [2023-01-28 06:59:56,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:56,595 INFO L130 PetriNetUnfolder]: 234/456 cut-off events. [2023-01-28 06:59:56,596 INFO L131 PetriNetUnfolder]: For 1863/1864 co-relation queries the response was YES. [2023-01-28 06:59:56,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2165 conditions, 456 events. 234/456 cut-off events. For 1863/1864 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1878 event pairs, 89 based on Foata normal form. 4/459 useless extension candidates. Maximal degree in co-relation 2147. Up to 374 conditions per place. [2023-01-28 06:59:56,598 INFO L137 encePairwiseOnDemand]: 209/217 looper letters, 35 selfloop transitions, 10 changer transitions 16/62 dead transitions. [2023-01-28 06:59:56,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 62 transitions, 583 flow [2023-01-28 06:59:56,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:59:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:59:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 610 transitions. [2023-01-28 06:59:56,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685099846390169 [2023-01-28 06:59:56,599 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 610 transitions. [2023-01-28 06:59:56,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 610 transitions. [2023-01-28 06:59:56,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:56,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 610 transitions. [2023-01-28 06:59:56,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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:59:56,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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:59:56,603 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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:59:56,603 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 282 flow. Second operand 6 states and 610 transitions. [2023-01-28 06:59:56,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 62 transitions, 583 flow [2023-01-28 06:59:56,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 62 transitions, 529 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-01-28 06:59:56,607 INFO L231 Difference]: Finished difference. Result has 63 places, 40 transitions, 301 flow [2023-01-28 06:59:56,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=63, PETRI_TRANSITIONS=40} [2023-01-28 06:59:56,607 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 32 predicate places. [2023-01-28 06:59:56,608 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 40 transitions, 301 flow [2023-01-28 06:59:56,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 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:59:56,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:56,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:56,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 06:59:56,609 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 06:59:56,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:56,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1516841057, now seen corresponding path program 2 times [2023-01-28 06:59:56,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:56,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160198690] [2023-01-28 06:59:56,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:56,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:57,814 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:59:57,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:57,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160198690] [2023-01-28 06:59:57,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160198690] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:57,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:57,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-28 06:59:57,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573903679] [2023-01-28 06:59:57,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:57,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 06:59:57,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:57,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 06:59:57,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-01-28 06:59:57,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 217 [2023-01-28 06:59:57,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 40 transitions, 301 flow. Second operand has 10 states, 10 states have (on average 86.7) internal successors, (867), 10 states have internal predecessors, (867), 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:59:57,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:57,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 217 [2023-01-28 06:59:57,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:58,075 INFO L130 PetriNetUnfolder]: 125/256 cut-off events. [2023-01-28 06:59:58,075 INFO L131 PetriNetUnfolder]: For 969/969 co-relation queries the response was YES. [2023-01-28 06:59:58,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 256 events. 125/256 cut-off events. For 969/969 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 835 event pairs, 30 based on Foata normal form. 4/260 useless extension candidates. Maximal degree in co-relation 1234. Up to 105 conditions per place. [2023-01-28 06:59:58,076 INFO L137 encePairwiseOnDemand]: 209/217 looper letters, 41 selfloop transitions, 16 changer transitions 4/62 dead transitions. [2023-01-28 06:59:58,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 62 transitions, 578 flow [2023-01-28 06:59:58,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:59:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:59:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 725 transitions. [2023-01-28 06:59:58,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176267281105991 [2023-01-28 06:59:58,078 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 725 transitions. [2023-01-28 06:59:58,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 725 transitions. [2023-01-28 06:59:58,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:58,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 725 transitions. [2023-01-28 06:59:58,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 90.625) internal successors, (725), 8 states have internal predecessors, (725), 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:59:58,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 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:59:58,082 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 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:59:58,082 INFO L175 Difference]: Start difference. First operand has 63 places, 40 transitions, 301 flow. Second operand 8 states and 725 transitions. [2023-01-28 06:59:58,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 62 transitions, 578 flow [2023-01-28 06:59:58,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 512 flow, removed 24 selfloop flow, removed 9 redundant places. [2023-01-28 06:59:58,084 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 316 flow [2023-01-28 06:59:58,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=316, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-01-28 06:59:58,085 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 27 predicate places. [2023-01-28 06:59:58,086 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 316 flow [2023-01-28 06:59:58,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 86.7) internal successors, (867), 10 states have internal predecessors, (867), 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:59:58,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:58,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:58,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 06:59:58,086 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 06:59:58,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:58,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1144784950, now seen corresponding path program 1 times [2023-01-28 06:59:58,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:58,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029261258] [2023-01-28 06:59:58,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:58,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:59:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:59:58,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:59:58,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029261258] [2023-01-28 06:59:58,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029261258] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:59:58,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:59:58,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:59:58,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232215553] [2023-01-28 06:59:58,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:59:58,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:59:58,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:59:58,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:59:58,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:59:58,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 217 [2023-01-28 06:59:58,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 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:59:58,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:59:58,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 217 [2023-01-28 06:59:58,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:59:58,415 INFO L130 PetriNetUnfolder]: 81/183 cut-off events. [2023-01-28 06:59:58,416 INFO L131 PetriNetUnfolder]: For 464/470 co-relation queries the response was YES. [2023-01-28 06:59:58,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 183 events. 81/183 cut-off events. For 464/470 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 666 event pairs, 6 based on Foata normal form. 16/196 useless extension candidates. Maximal degree in co-relation 787. Up to 72 conditions per place. [2023-01-28 06:59:58,417 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 44 selfloop transitions, 11 changer transitions 5/68 dead transitions. [2023-01-28 06:59:58,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 618 flow [2023-01-28 06:59:58,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:59:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:59:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 788 transitions. [2023-01-28 06:59:58,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5187623436471362 [2023-01-28 06:59:58,419 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 788 transitions. [2023-01-28 06:59:58,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 788 transitions. [2023-01-28 06:59:58,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:59:58,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 788 transitions. [2023-01-28 06:59:58,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.57142857142857) internal successors, (788), 7 states have internal predecessors, (788), 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:59:58,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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:59:58,423 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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:59:58,423 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 316 flow. Second operand 7 states and 788 transitions. [2023-01-28 06:59:58,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 618 flow [2023-01-28 06:59:58,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 518 flow, removed 28 selfloop flow, removed 8 redundant places. [2023-01-28 06:59:58,425 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 291 flow [2023-01-28 06:59:58,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=291, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-01-28 06:59:58,426 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2023-01-28 06:59:58,426 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 291 flow [2023-01-28 06:59:58,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 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:59:58,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:59:58,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:58,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 06:59:58,427 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 06:59:58,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:59:58,427 INFO L85 PathProgramCache]: Analyzing trace with hash 2059235957, now seen corresponding path program 1 times [2023-01-28 06:59:58,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:59:58,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107029137] [2023-01-28 06:59:58,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:59:58,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:59:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:59:58,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:59:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:59:58,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:59:58,601 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:59:58,602 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-28 06:59:58,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-01-28 06:59:58,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-01-28 06:59:58,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-01-28 06:59:58,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 06:59:58,603 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:59:58,608 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:59:58,608 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:59:58,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:59:58 BasicIcfg [2023-01-28 06:59:58,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:59:58,691 INFO L158 Benchmark]: Toolchain (without parser) took 20106.56ms. Allocated memory was 360.7MB in the beginning and 1.4GB in the end (delta: 994.1MB). Free memory was 319.6MB in the beginning and 1.1GB in the end (delta: -791.1MB). Peak memory consumption was 205.7MB. Max. memory is 16.0GB. [2023-01-28 06:59:58,691 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 360.7MB. Free memory was 309.7MB in the beginning and 309.6MB in the end (delta: 29.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:59:58,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.46ms. Allocated memory is still 360.7MB. Free memory was 319.2MB in the beginning and 293.7MB in the end (delta: 25.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-01-28 06:59:58,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.21ms. Allocated memory is still 360.7MB. Free memory was 293.7MB in the beginning and 291.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:59:58,692 INFO L158 Benchmark]: Boogie Preprocessor took 36.29ms. Allocated memory is still 360.7MB. Free memory was 291.2MB in the beginning and 288.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:59:58,692 INFO L158 Benchmark]: RCFGBuilder took 693.20ms. Allocated memory was 360.7MB in the beginning and 574.6MB in the end (delta: 213.9MB). Free memory was 288.3MB in the beginning and 488.9MB in the end (delta: -200.6MB). Peak memory consumption was 46.3MB. Max. memory is 16.0GB. [2023-01-28 06:59:58,692 INFO L158 Benchmark]: TraceAbstraction took 18819.88ms. Allocated memory was 574.6MB in the beginning and 1.4GB in the end (delta: 780.1MB). Free memory was 488.9MB in the beginning and 1.1GB in the end (delta: -621.8MB). Peak memory consumption was 159.4MB. Max. memory is 16.0GB. [2023-01-28 06:59:58,693 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.09ms. Allocated memory is still 360.7MB. Free memory was 309.7MB in the beginning and 309.6MB in the end (delta: 29.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 491.46ms. Allocated memory is still 360.7MB. Free memory was 319.2MB in the beginning and 293.7MB in the end (delta: 25.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.21ms. Allocated memory is still 360.7MB. Free memory was 293.7MB in the beginning and 291.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 36.29ms. Allocated memory is still 360.7MB. Free memory was 291.2MB in the beginning and 288.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 693.20ms. Allocated memory was 360.7MB in the beginning and 574.6MB in the end (delta: 213.9MB). Free memory was 288.3MB in the beginning and 488.9MB in the end (delta: -200.6MB). Peak memory consumption was 46.3MB. Max. memory is 16.0GB. * TraceAbstraction took 18819.88ms. Allocated memory was 574.6MB in the beginning and 1.4GB in the end (delta: 780.1MB). Free memory was 488.9MB in the beginning and 1.1GB in the end (delta: -621.8MB). Peak memory consumption was 159.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 119 PlacesBefore, 31 PlacesAfterwards, 110 TransitionsBefore, 22 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 8 FixpointIterations, 57 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, 3777 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1409, independent: 1211, independent conditional: 0, independent unconditional: 1211, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 614, independent: 584, independent conditional: 0, independent unconditional: 584, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1409, independent: 627, independent conditional: 0, independent unconditional: 627, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 614, unknown conditional: 0, unknown unconditional: 614] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1789; [L853] FCALL, FORK 0 pthread_create(&t1789, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1789, ((void *)0), P0, ((void *)0))=-2, t1789={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t1790; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] EXPR 1 \read(y) [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] FCALL, FORK 0 pthread_create(&t1790, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1790, ((void *)0), P1, ((void *)0))=-1, t1789={7:0}, t1790={5:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t1791; [L791] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L794] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] FCALL, FORK 0 pthread_create(&t1791, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1791, ((void *)0), P2, ((void *)0))=0, t1789={7:0}, t1790={5:0}, t1791={6:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 3 \read(y) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] EXPR 3 \read(y) [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L827] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1789={7:0}, t1790={5:0}, t1791={6:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] EXPR 0 \read(y) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] EXPR 0 \read(y) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 855]: 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: 853]: 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: 857]: 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 7 procedures, 150 locations, 4 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: 18.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 408 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 408 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1412 IncrementalHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 10 mSDtfsCounter, 1412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316occurred in iteration=14, InterpolantAutomatonStates: 89, 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.5s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 3401 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:59:58,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...