/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:13:22,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:13:22,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:13:22,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:13:22,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:13:22,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:13:22,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:13:22,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:13:22,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:13:22,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:13:22,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:13:22,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:13:22,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:13:22,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:13:22,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:13:22,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:13:22,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:13:22,205 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:13:22,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:13:22,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:13:22,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:13:22,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:13:22,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:13:22,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:13:22,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:13:22,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:13:22,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:13:22,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:13:22,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:13:22,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:13:22,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:13:22,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:13:22,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:13:22,214 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:13:22,215 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:13:22,215 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:13:22,216 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:13:22,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:13:22,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:13:22,216 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:13:22,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:13:22,218 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-27 18:13:22,241 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:13:22,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:13:22,242 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:13:22,242 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:13:22,242 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:13:22,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:13:22,243 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:13:22,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:13:22,243 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:13:22,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:13:22,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:13:22,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:13:22,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:13:22,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:13:22,244 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:13:22,244 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:13:22,244 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:13:22,244 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:13:22,245 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:13:22,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:13:22,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:13:22,245 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:13:22,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:13:22,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:13:22,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:13:22,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:13:22,246 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:13:22,246 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:13:22,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:13:22,246 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:13:22,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:13:22,246 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 [2023-01-27 18:13:22,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:13:22,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:13:22,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:13:22,461 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:13:22,461 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:13:22,462 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-01-27 18:13:23,512 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:13:23,719 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:13:23,721 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-01-27 18:13:23,729 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/127a5c677/e28bf8b7ae7148109524ef38a3c3186f/FLAG081bf3545 [2023-01-27 18:13:23,738 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/127a5c677/e28bf8b7ae7148109524ef38a3c3186f [2023-01-27 18:13:23,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:13:23,740 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:13:23,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:13:23,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:13:23,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:13:23,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:13:23" (1/1) ... [2023-01-27 18:13:23,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@731dcaab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:23, skipping insertion in model container [2023-01-27 18:13:23,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:13:23" (1/1) ... [2023-01-27 18:13:23,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:13:23,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:13:23,874 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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-01-27 18:13:23,980 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:13:23,994 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:13:24,003 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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-01-27 18:13:24,054 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:13:24,077 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:13:24,077 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:13:24,082 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:13:24,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:24 WrapperNode [2023-01-27 18:13:24,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:13:24,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:13:24,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:13:24,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:13:24,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:24" (1/1) ... [2023-01-27 18:13:24,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:24" (1/1) ... [2023-01-27 18:13:24,135 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 167 [2023-01-27 18:13:24,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:13:24,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:13:24,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:13:24,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:13:24,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:24" (1/1) ... [2023-01-27 18:13:24,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:24" (1/1) ... [2023-01-27 18:13:24,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:24" (1/1) ... [2023-01-27 18:13:24,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:24" (1/1) ... [2023-01-27 18:13:24,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:24" (1/1) ... [2023-01-27 18:13:24,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:24" (1/1) ... [2023-01-27 18:13:24,162 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:24" (1/1) ... [2023-01-27 18:13:24,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:24" (1/1) ... [2023-01-27 18:13:24,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:13:24,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:13:24,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:13:24,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:13:24,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:24" (1/1) ... [2023-01-27 18:13:24,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:13:24,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:13:24,195 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-27 18:13:24,210 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-27 18:13:24,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:13:24,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:13:24,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:13:24,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:13:24,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:13:24,222 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:13:24,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:13:24,223 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:13:24,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:13:24,223 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:13:24,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:13:24,223 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-27 18:13:24,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-27 18:13:24,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:13:24,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:13:24,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:13:24,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:13:24,225 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:13:24,323 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:13:24,325 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:13:24,575 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:13:24,681 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:13:24,682 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:13:24,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:13:24 BoogieIcfgContainer [2023-01-27 18:13:24,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:13:24,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:13:24,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:13:24,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:13:24,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:13:23" (1/3) ... [2023-01-27 18:13:24,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0717a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:13:24, skipping insertion in model container [2023-01-27 18:13:24,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:24" (2/3) ... [2023-01-27 18:13:24,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0717a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:13:24, skipping insertion in model container [2023-01-27 18:13:24,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:13:24" (3/3) ... [2023-01-27 18:13:24,694 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-01-27 18:13:24,706 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:13:24,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:13:24,707 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:13:24,753 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:13:24,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2023-01-27 18:13:24,828 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-01-27 18:13:24,829 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:13:24,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-01-27 18:13:24,834 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2023-01-27 18:13:24,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2023-01-27 18:13:24,844 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:13:24,850 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2023-01-27 18:13:24,852 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2023-01-27 18:13:24,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2023-01-27 18:13:24,870 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-01-27 18:13:24,871 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:13:24,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-01-27 18:13:24,873 INFO L119 LiptonReduction]: Number of co-enabled transitions 2936 [2023-01-27 18:13:27,956 INFO L134 LiptonReduction]: Checked pairs total: 6820 [2023-01-27 18:13:27,957 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-01-27 18:13:27,967 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:13:27,971 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;@36d7ca52, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:13:27,971 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-27 18:13:27,974 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2023-01-27 18:13:27,974 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:13:27,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:27,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:27,975 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:13:27,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:27,979 INFO L85 PathProgramCache]: Analyzing trace with hash -273626498, now seen corresponding path program 1 times [2023-01-27 18:13:27,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:27,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778932736] [2023-01-27 18:13:27,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:27,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:28,320 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-27 18:13:28,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:28,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778932736] [2023-01-27 18:13:28,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778932736] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:28,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:28,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:13:28,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780696386] [2023-01-27 18:13:28,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:28,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:13:28,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:28,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:13:28,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:13:28,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 235 [2023-01-27 18:13:28,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-27 18:13:28,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:28,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 235 [2023-01-27 18:13:28,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:28,759 INFO L130 PetriNetUnfolder]: 3113/4519 cut-off events. [2023-01-27 18:13:28,759 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-01-27 18:13:28,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8913 conditions, 4519 events. 3113/4519 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 24198 event pairs, 593 based on Foata normal form. 0/4326 useless extension candidates. Maximal degree in co-relation 8901. Up to 3385 conditions per place. [2023-01-27 18:13:28,808 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 32 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-01-27 18:13:28,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 164 flow [2023-01-27 18:13:28,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:13:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:13:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-01-27 18:13:28,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5446808510638298 [2023-01-27 18:13:28,822 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-01-27 18:13:28,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-01-27 18:13:28,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:28,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-01-27 18:13:28,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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-27 18:13:28,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 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-27 18:13:28,834 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 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-27 18:13:28,835 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 384 transitions. [2023-01-27 18:13:28,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 164 flow [2023-01-27 18:13:28,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 18:13:28,844 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-01-27 18:13:28,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-01-27 18:13:28,848 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-01-27 18:13:28,849 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-01-27 18:13:28,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-27 18:13:28,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:28,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:28,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:13:28,850 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:13:28,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:28,852 INFO L85 PathProgramCache]: Analyzing trace with hash 243126665, now seen corresponding path program 1 times [2023-01-27 18:13:28,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:28,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083614107] [2023-01-27 18:13:28,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:28,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:29,410 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-27 18:13:29,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:29,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083614107] [2023-01-27 18:13:29,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083614107] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:29,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:29,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:13:29,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255100427] [2023-01-27 18:13:29,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:29,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:13:29,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:29,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:13:29,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:13:29,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-27 18:13:29,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 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-27 18:13:29,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:29,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-27 18:13:29,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:30,518 INFO L130 PetriNetUnfolder]: 11263/15464 cut-off events. [2023-01-27 18:13:30,518 INFO L131 PetriNetUnfolder]: For 272/272 co-relation queries the response was YES. [2023-01-27 18:13:30,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31454 conditions, 15464 events. 11263/15464 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 77721 event pairs, 2087 based on Foata normal form. 720/16184 useless extension candidates. Maximal degree in co-relation 31444. Up to 7121 conditions per place. [2023-01-27 18:13:30,583 INFO L137 encePairwiseOnDemand]: 223/235 looper letters, 45 selfloop transitions, 10 changer transitions 40/95 dead transitions. [2023-01-27 18:13:30,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 95 transitions, 394 flow [2023-01-27 18:13:30,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:13:30,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:13:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 770 transitions. [2023-01-27 18:13:30,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2023-01-27 18:13:30,585 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 770 transitions. [2023-01-27 18:13:30,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 770 transitions. [2023-01-27 18:13:30,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:30,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 770 transitions. [2023-01-27 18:13:30,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 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-27 18:13:30,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 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-27 18:13:30,590 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 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-27 18:13:30,590 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 7 states and 770 transitions. [2023-01-27 18:13:30,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 95 transitions, 394 flow [2023-01-27 18:13:30,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 95 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:13:30,596 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 158 flow [2023-01-27 18:13:30,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=158, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-01-27 18:13:30,596 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-01-27 18:13:30,596 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 158 flow [2023-01-27 18:13:30,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 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-27 18:13:30,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:30,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:30,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:13:30,597 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:13:30,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:30,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1656233583, now seen corresponding path program 1 times [2023-01-27 18:13:30,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:30,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347931814] [2023-01-27 18:13:30,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:30,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:30,890 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-27 18:13:30,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:30,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347931814] [2023-01-27 18:13:30,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347931814] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:30,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:30,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:13:30,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676252120] [2023-01-27 18:13:30,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:30,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:13:30,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:30,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:13:30,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:13:30,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-27 18:13:30,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 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-27 18:13:30,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:30,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-27 18:13:30,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:32,037 INFO L130 PetriNetUnfolder]: 11182/15497 cut-off events. [2023-01-27 18:13:32,037 INFO L131 PetriNetUnfolder]: For 15828/15828 co-relation queries the response was YES. [2023-01-27 18:13:32,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47216 conditions, 15497 events. 11182/15497 cut-off events. For 15828/15828 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 80805 event pairs, 1039 based on Foata normal form. 550/16047 useless extension candidates. Maximal degree in co-relation 47200. Up to 8595 conditions per place. [2023-01-27 18:13:32,111 INFO L137 encePairwiseOnDemand]: 222/235 looper letters, 56 selfloop transitions, 20 changer transitions 37/113 dead transitions. [2023-01-27 18:13:32,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 113 transitions, 700 flow [2023-01-27 18:13:32,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:13:32,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:13:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 781 transitions. [2023-01-27 18:13:32,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47477203647416416 [2023-01-27 18:13:32,113 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 781 transitions. [2023-01-27 18:13:32,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 781 transitions. [2023-01-27 18:13:32,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:32,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 781 transitions. [2023-01-27 18:13:32,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.57142857142857) internal successors, (781), 7 states have internal predecessors, (781), 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-27 18:13:32,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 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-27 18:13:32,118 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 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-27 18:13:32,118 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 158 flow. Second operand 7 states and 781 transitions. [2023-01-27 18:13:32,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 113 transitions, 700 flow [2023-01-27 18:13:32,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 113 transitions, 692 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-27 18:13:32,185 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 317 flow [2023-01-27 18:13:32,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=317, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-01-27 18:13:32,186 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2023-01-27 18:13:32,186 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 317 flow [2023-01-27 18:13:32,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 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-27 18:13:32,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:32,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:32,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:13:32,187 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:13:32,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:32,187 INFO L85 PathProgramCache]: Analyzing trace with hash -196410352, now seen corresponding path program 1 times [2023-01-27 18:13:32,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:32,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091900859] [2023-01-27 18:13:32,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:32,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:32,438 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-27 18:13:32,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:32,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091900859] [2023-01-27 18:13:32,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091900859] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:32,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:32,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:13:32,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681539104] [2023-01-27 18:13:32,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:32,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:13:32,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:32,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:13:32,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:13:32,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-27 18:13:32,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 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-27 18:13:32,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:32,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-27 18:13:32,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:33,562 INFO L130 PetriNetUnfolder]: 10691/14832 cut-off events. [2023-01-27 18:13:33,562 INFO L131 PetriNetUnfolder]: For 41291/41291 co-relation queries the response was YES. [2023-01-27 18:13:33,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55978 conditions, 14832 events. 10691/14832 cut-off events. For 41291/41291 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 77487 event pairs, 1159 based on Foata normal form. 472/15304 useless extension candidates. Maximal degree in co-relation 55956. Up to 8401 conditions per place. [2023-01-27 18:13:33,726 INFO L137 encePairwiseOnDemand]: 222/235 looper letters, 64 selfloop transitions, 25 changer transitions 39/128 dead transitions. [2023-01-27 18:13:33,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 128 transitions, 1077 flow [2023-01-27 18:13:33,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:13:33,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:13:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 774 transitions. [2023-01-27 18:13:33,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.470516717325228 [2023-01-27 18:13:33,729 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 774 transitions. [2023-01-27 18:13:33,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 774 transitions. [2023-01-27 18:13:33,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:33,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 774 transitions. [2023-01-27 18:13:33,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 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-27 18:13:33,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 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-27 18:13:33,740 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 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-27 18:13:33,740 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 317 flow. Second operand 7 states and 774 transitions. [2023-01-27 18:13:33,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 128 transitions, 1077 flow [2023-01-27 18:13:33,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 128 transitions, 1061 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-01-27 18:13:33,892 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 622 flow [2023-01-27 18:13:33,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=622, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2023-01-27 18:13:33,894 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2023-01-27 18:13:33,894 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 622 flow [2023-01-27 18:13:33,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 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-27 18:13:33,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:33,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:33,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:13:33,894 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:13:33,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:33,895 INFO L85 PathProgramCache]: Analyzing trace with hash -672716148, now seen corresponding path program 1 times [2023-01-27 18:13:33,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:33,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266263047] [2023-01-27 18:13:33,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:33,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:34,230 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-27 18:13:34,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:34,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266263047] [2023-01-27 18:13:34,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266263047] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:34,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:34,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:13:34,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951867122] [2023-01-27 18:13:34,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:34,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:13:34,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:34,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:13:34,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:13:34,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-27 18:13:34,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 622 flow. Second operand has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 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-27 18:13:34,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:34,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-27 18:13:34,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:35,795 INFO L130 PetriNetUnfolder]: 13229/18482 cut-off events. [2023-01-27 18:13:35,796 INFO L131 PetriNetUnfolder]: For 75968/75968 co-relation queries the response was YES. [2023-01-27 18:13:35,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76413 conditions, 18482 events. 13229/18482 cut-off events. For 75968/75968 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 100177 event pairs, 2623 based on Foata normal form. 432/18914 useless extension candidates. Maximal degree in co-relation 76386. Up to 7683 conditions per place. [2023-01-27 18:13:35,879 INFO L137 encePairwiseOnDemand]: 222/235 looper letters, 66 selfloop transitions, 41 changer transitions 36/143 dead transitions. [2023-01-27 18:13:35,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 143 transitions, 1418 flow [2023-01-27 18:13:35,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:13:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:13:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 774 transitions. [2023-01-27 18:13:35,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.470516717325228 [2023-01-27 18:13:35,881 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 774 transitions. [2023-01-27 18:13:35,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 774 transitions. [2023-01-27 18:13:35,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:35,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 774 transitions. [2023-01-27 18:13:35,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 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-27 18:13:35,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 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-27 18:13:35,885 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 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-27 18:13:35,885 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 622 flow. Second operand 7 states and 774 transitions. [2023-01-27 18:13:35,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 143 transitions, 1418 flow [2023-01-27 18:13:36,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 143 transitions, 1402 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-01-27 18:13:36,019 INFO L231 Difference]: Finished difference. Result has 70 places, 77 transitions, 971 flow [2023-01-27 18:13:36,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=971, PETRI_PLACES=70, PETRI_TRANSITIONS=77} [2023-01-27 18:13:36,021 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2023-01-27 18:13:36,021 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 77 transitions, 971 flow [2023-01-27 18:13:36,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 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-27 18:13:36,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:36,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:36,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:13:36,022 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:13:36,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:36,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2006318020, now seen corresponding path program 1 times [2023-01-27 18:13:36,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:36,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780535276] [2023-01-27 18:13:36,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:36,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:36,590 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-27 18:13:36,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:36,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780535276] [2023-01-27 18:13:36,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780535276] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:36,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:36,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:13:36,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063516312] [2023-01-27 18:13:36,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:36,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:13:36,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:36,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:13:36,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:13:36,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-01-27 18:13:36,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 77 transitions, 971 flow. Second operand has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 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-27 18:13:36,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:36,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-01-27 18:13:36,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:37,987 INFO L130 PetriNetUnfolder]: 9622/14180 cut-off events. [2023-01-27 18:13:37,988 INFO L131 PetriNetUnfolder]: For 96937/98364 co-relation queries the response was YES. [2023-01-27 18:13:38,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65024 conditions, 14180 events. 9622/14180 cut-off events. For 96937/98364 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 85456 event pairs, 2375 based on Foata normal form. 1033/14994 useless extension candidates. Maximal degree in co-relation 64989. Up to 9641 conditions per place. [2023-01-27 18:13:38,072 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 92 selfloop transitions, 12 changer transitions 22/147 dead transitions. [2023-01-27 18:13:38,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 147 transitions, 1932 flow [2023-01-27 18:13:38,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:13:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:13:38,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 705 transitions. [2023-01-27 18:13:38,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-27 18:13:38,074 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 705 transitions. [2023-01-27 18:13:38,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 705 transitions. [2023-01-27 18:13:38,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:38,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 705 transitions. [2023-01-27 18:13:38,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 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-27 18:13:38,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 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-27 18:13:38,078 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 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-27 18:13:38,078 INFO L175 Difference]: Start difference. First operand has 70 places, 77 transitions, 971 flow. Second operand 6 states and 705 transitions. [2023-01-27 18:13:38,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 147 transitions, 1932 flow [2023-01-27 18:13:38,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 147 transitions, 1910 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-01-27 18:13:38,303 INFO L231 Difference]: Finished difference. Result has 72 places, 85 transitions, 1098 flow [2023-01-27 18:13:38,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1098, PETRI_PLACES=72, PETRI_TRANSITIONS=85} [2023-01-27 18:13:38,303 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2023-01-27 18:13:38,303 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 85 transitions, 1098 flow [2023-01-27 18:13:38,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 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-27 18:13:38,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:38,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:38,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:13:38,304 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:13:38,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:38,304 INFO L85 PathProgramCache]: Analyzing trace with hash 271270556, now seen corresponding path program 1 times [2023-01-27 18:13:38,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:38,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487721721] [2023-01-27 18:13:38,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:38,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:38,872 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-27 18:13:38,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:38,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487721721] [2023-01-27 18:13:38,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487721721] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:38,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:38,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:13:38,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619128902] [2023-01-27 18:13:38,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:38,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:13:38,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:38,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:13:38,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:13:38,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-01-27 18:13:38,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 85 transitions, 1098 flow. Second operand has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 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-27 18:13:38,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:38,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-01-27 18:13:38,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:40,524 INFO L130 PetriNetUnfolder]: 10332/15054 cut-off events. [2023-01-27 18:13:40,524 INFO L131 PetriNetUnfolder]: For 111662/113297 co-relation queries the response was YES. [2023-01-27 18:13:40,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74190 conditions, 15054 events. 10332/15054 cut-off events. For 111662/113297 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 90031 event pairs, 1773 based on Foata normal form. 944/15731 useless extension candidates. Maximal degree in co-relation 74153. Up to 10500 conditions per place. [2023-01-27 18:13:40,607 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 93 selfloop transitions, 30 changer transitions 13/157 dead transitions. [2023-01-27 18:13:40,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 157 transitions, 2149 flow [2023-01-27 18:13:40,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:13:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:13:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 699 transitions. [2023-01-27 18:13:40,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4957446808510638 [2023-01-27 18:13:40,609 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 699 transitions. [2023-01-27 18:13:40,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 699 transitions. [2023-01-27 18:13:40,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:40,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 699 transitions. [2023-01-27 18:13:40,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 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-27 18:13:40,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 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-27 18:13:40,612 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 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-27 18:13:40,612 INFO L175 Difference]: Start difference. First operand has 72 places, 85 transitions, 1098 flow. Second operand 6 states and 699 transitions. [2023-01-27 18:13:40,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 157 transitions, 2149 flow [2023-01-27 18:13:40,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 157 transitions, 2068 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 18:13:40,719 INFO L231 Difference]: Finished difference. Result has 76 places, 105 transitions, 1449 flow [2023-01-27 18:13:40,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1449, PETRI_PLACES=76, PETRI_TRANSITIONS=105} [2023-01-27 18:13:40,720 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2023-01-27 18:13:40,720 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 105 transitions, 1449 flow [2023-01-27 18:13:40,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 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-27 18:13:40,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:40,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:40,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:13:40,721 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:13:40,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:40,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1653571782, now seen corresponding path program 2 times [2023-01-27 18:13:40,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:40,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172127861] [2023-01-27 18:13:40,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:40,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:41,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-27 18:13:41,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:41,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172127861] [2023-01-27 18:13:41,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172127861] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:41,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:41,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:13:41,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908100184] [2023-01-27 18:13:41,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:41,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:13:41,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:41,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:13:41,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:13:41,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-27 18:13:41,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 105 transitions, 1449 flow. Second operand has 8 states, 8 states have (on average 98.125) internal successors, (785), 8 states have internal predecessors, (785), 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-27 18:13:41,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:41,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-27 18:13:41,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:43,273 INFO L130 PetriNetUnfolder]: 14125/19886 cut-off events. [2023-01-27 18:13:43,273 INFO L131 PetriNetUnfolder]: For 144352/144352 co-relation queries the response was YES. [2023-01-27 18:13:43,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102998 conditions, 19886 events. 14125/19886 cut-off events. For 144352/144352 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 109918 event pairs, 1035 based on Foata normal form. 552/20438 useless extension candidates. Maximal degree in co-relation 102958. Up to 6877 conditions per place. [2023-01-27 18:13:43,510 INFO L137 encePairwiseOnDemand]: 221/235 looper letters, 134 selfloop transitions, 50 changer transitions 61/245 dead transitions. [2023-01-27 18:13:43,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 245 transitions, 3559 flow [2023-01-27 18:13:43,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:13:43,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:13:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 981 transitions. [2023-01-27 18:13:43,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46382978723404256 [2023-01-27 18:13:43,513 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 981 transitions. [2023-01-27 18:13:43,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 981 transitions. [2023-01-27 18:13:43,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:43,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 981 transitions. [2023-01-27 18:13:43,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 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-27 18:13:43,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 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-27 18:13:43,517 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 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-27 18:13:43,517 INFO L175 Difference]: Start difference. First operand has 76 places, 105 transitions, 1449 flow. Second operand 9 states and 981 transitions. [2023-01-27 18:13:43,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 245 transitions, 3559 flow [2023-01-27 18:13:43,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 245 transitions, 3516 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-01-27 18:13:43,696 INFO L231 Difference]: Finished difference. Result has 87 places, 123 transitions, 1974 flow [2023-01-27 18:13:43,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1974, PETRI_PLACES=87, PETRI_TRANSITIONS=123} [2023-01-27 18:13:43,696 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2023-01-27 18:13:43,696 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 123 transitions, 1974 flow [2023-01-27 18:13:43,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.125) internal successors, (785), 8 states have internal predecessors, (785), 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-27 18:13:43,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:43,697 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-27 18:13:43,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:13:43,697 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:13:43,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:43,697 INFO L85 PathProgramCache]: Analyzing trace with hash -175886107, now seen corresponding path program 1 times [2023-01-27 18:13:43,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:43,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952694189] [2023-01-27 18:13:43,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:43,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:44,247 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-27 18:13:44,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:44,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952694189] [2023-01-27 18:13:44,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952694189] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:44,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:44,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:13:44,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526122507] [2023-01-27 18:13:44,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:44,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:13:44,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:44,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:13:44,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:13:44,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 235 [2023-01-27 18:13:44,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 123 transitions, 1974 flow. Second operand has 7 states, 7 states have (on average 96.57142857142857) internal successors, (676), 7 states have internal predecessors, (676), 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-27 18:13:44,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:44,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 235 [2023-01-27 18:13:44,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:46,888 INFO L130 PetriNetUnfolder]: 15901/22538 cut-off events. [2023-01-27 18:13:46,888 INFO L131 PetriNetUnfolder]: For 222749/222749 co-relation queries the response was YES. [2023-01-27 18:13:46,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125468 conditions, 22538 events. 15901/22538 cut-off events. For 222749/222749 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 130488 event pairs, 1435 based on Foata normal form. 304/22842 useless extension candidates. Maximal degree in co-relation 125422. Up to 10239 conditions per place. [2023-01-27 18:13:47,033 INFO L137 encePairwiseOnDemand]: 221/235 looper letters, 119 selfloop transitions, 138 changer transitions 49/306 dead transitions. [2023-01-27 18:13:47,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 306 transitions, 4703 flow [2023-01-27 18:13:47,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-27 18:13:47,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-27 18:13:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1383 transitions. [2023-01-27 18:13:47,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45270049099836335 [2023-01-27 18:13:47,036 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1383 transitions. [2023-01-27 18:13:47,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1383 transitions. [2023-01-27 18:13:47,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:47,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1383 transitions. [2023-01-27 18:13:47,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 106.38461538461539) internal successors, (1383), 13 states have internal predecessors, (1383), 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-27 18:13:47,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 235.0) internal successors, (3290), 14 states have internal predecessors, (3290), 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-27 18:13:47,041 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 235.0) internal successors, (3290), 14 states have internal predecessors, (3290), 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-27 18:13:47,041 INFO L175 Difference]: Start difference. First operand has 87 places, 123 transitions, 1974 flow. Second operand 13 states and 1383 transitions. [2023-01-27 18:13:47,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 306 transitions, 4703 flow [2023-01-27 18:13:48,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 306 transitions, 4591 flow, removed 48 selfloop flow, removed 3 redundant places. [2023-01-27 18:13:48,196 INFO L231 Difference]: Finished difference. Result has 101 places, 190 transitions, 3636 flow [2023-01-27 18:13:48,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3636, PETRI_PLACES=101, PETRI_TRANSITIONS=190} [2023-01-27 18:13:48,197 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2023-01-27 18:13:48,197 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 190 transitions, 3636 flow [2023-01-27 18:13:48,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.57142857142857) internal successors, (676), 7 states have internal predecessors, (676), 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-27 18:13:48,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:48,197 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-27 18:13:48,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:13:48,198 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:13:48,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:48,198 INFO L85 PathProgramCache]: Analyzing trace with hash 963103137, now seen corresponding path program 2 times [2023-01-27 18:13:48,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:48,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120362398] [2023-01-27 18:13:48,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:48,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:49,074 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-27 18:13:49,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:49,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120362398] [2023-01-27 18:13:49,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120362398] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:49,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:49,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:13:49,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404137934] [2023-01-27 18:13:49,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:49,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:13:49,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:49,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:13:49,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:13:49,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-27 18:13:49,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 190 transitions, 3636 flow. Second operand has 8 states, 8 states have (on average 98.25) internal successors, (786), 8 states have internal predecessors, (786), 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-27 18:13:49,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:49,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-27 18:13:49,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:51,525 INFO L130 PetriNetUnfolder]: 15957/22674 cut-off events. [2023-01-27 18:13:51,526 INFO L131 PetriNetUnfolder]: For 303707/303707 co-relation queries the response was YES. [2023-01-27 18:13:51,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141143 conditions, 22674 events. 15957/22674 cut-off events. For 303707/303707 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 132515 event pairs, 4099 based on Foata normal form. 272/22946 useless extension candidates. Maximal degree in co-relation 141090. Up to 15599 conditions per place. [2023-01-27 18:13:51,696 INFO L137 encePairwiseOnDemand]: 224/235 looper letters, 213 selfloop transitions, 49 changer transitions 40/302 dead transitions. [2023-01-27 18:13:51,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 302 transitions, 5884 flow [2023-01-27 18:13:51,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:13:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:13:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 859 transitions. [2023-01-27 18:13:51,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45691489361702126 [2023-01-27 18:13:51,698 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 859 transitions. [2023-01-27 18:13:51,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 859 transitions. [2023-01-27 18:13:51,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:51,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 859 transitions. [2023-01-27 18:13:51,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.375) internal successors, (859), 8 states have internal predecessors, (859), 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-27 18:13:51,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 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-27 18:13:51,702 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 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-27 18:13:51,702 INFO L175 Difference]: Start difference. First operand has 101 places, 190 transitions, 3636 flow. Second operand 8 states and 859 transitions. [2023-01-27 18:13:51,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 302 transitions, 5884 flow [2023-01-27 18:13:53,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 302 transitions, 5584 flow, removed 138 selfloop flow, removed 8 redundant places. [2023-01-27 18:13:53,785 INFO L231 Difference]: Finished difference. Result has 101 places, 211 transitions, 3996 flow [2023-01-27 18:13:53,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=3424, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3996, PETRI_PLACES=101, PETRI_TRANSITIONS=211} [2023-01-27 18:13:53,786 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2023-01-27 18:13:53,786 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 211 transitions, 3996 flow [2023-01-27 18:13:53,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.25) internal successors, (786), 8 states have internal predecessors, (786), 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-27 18:13:53,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:53,786 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-27 18:13:53,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:13:53,786 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:13:53,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:53,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1600301353, now seen corresponding path program 3 times [2023-01-27 18:13:53,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:53,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325012364] [2023-01-27 18:13:53,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:53,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:54,551 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-27 18:13:54,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:54,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325012364] [2023-01-27 18:13:54,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325012364] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:54,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:54,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:13:54,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035870566] [2023-01-27 18:13:54,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:54,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:13:54,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:54,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:13:54,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:13:54,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 235 [2023-01-27 18:13:54,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 211 transitions, 3996 flow. Second operand has 8 states, 8 states have (on average 96.25) internal successors, (770), 8 states have internal predecessors, (770), 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-27 18:13:54,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:54,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 235 [2023-01-27 18:13:54,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:57,207 INFO L130 PetriNetUnfolder]: 16346/23371 cut-off events. [2023-01-27 18:13:57,207 INFO L131 PetriNetUnfolder]: For 290317/290317 co-relation queries the response was YES. [2023-01-27 18:13:57,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147515 conditions, 23371 events. 16346/23371 cut-off events. For 290317/290317 co-relation queries the response was YES. Maximal size of possible extension queue 961. Compared 138511 event pairs, 1818 based on Foata normal form. 272/23643 useless extension candidates. Maximal degree in co-relation 147462. Up to 11149 conditions per place. [2023-01-27 18:13:57,366 INFO L137 encePairwiseOnDemand]: 221/235 looper letters, 168 selfloop transitions, 143 changer transitions 43/354 dead transitions. [2023-01-27 18:13:57,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 354 transitions, 6594 flow [2023-01-27 18:13:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-27 18:13:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-27 18:13:57,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1064 transitions. [2023-01-27 18:13:57,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45276595744680853 [2023-01-27 18:13:57,369 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1064 transitions. [2023-01-27 18:13:57,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1064 transitions. [2023-01-27 18:13:57,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:57,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1064 transitions. [2023-01-27 18:13:57,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.4) internal successors, (1064), 10 states have internal predecessors, (1064), 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-27 18:13:57,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 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-27 18:13:57,373 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 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-27 18:13:57,373 INFO L175 Difference]: Start difference. First operand has 101 places, 211 transitions, 3996 flow. Second operand 10 states and 1064 transitions. [2023-01-27 18:13:57,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 354 transitions, 6594 flow [2023-01-27 18:13:58,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 354 transitions, 6452 flow, removed 37 selfloop flow, removed 5 redundant places. [2023-01-27 18:13:58,929 INFO L231 Difference]: Finished difference. Result has 112 places, 263 transitions, 5526 flow [2023-01-27 18:13:58,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=3895, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5526, PETRI_PLACES=112, PETRI_TRANSITIONS=263} [2023-01-27 18:13:58,929 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 70 predicate places. [2023-01-27 18:13:58,929 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 263 transitions, 5526 flow [2023-01-27 18:13:58,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.25) internal successors, (770), 8 states have internal predecessors, (770), 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-27 18:13:58,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:58,930 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-27 18:13:58,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:13:58,930 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:13:58,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:58,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2031542937, now seen corresponding path program 4 times [2023-01-27 18:13:58,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:58,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331362868] [2023-01-27 18:13:58,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:58,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:59,325 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-27 18:13:59,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:59,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331362868] [2023-01-27 18:13:59,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331362868] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:59,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:59,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:13:59,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247413447] [2023-01-27 18:13:59,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:59,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:13:59,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:59,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:13:59,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:13:59,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 235 [2023-01-27 18:13:59,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 263 transitions, 5526 flow. Second operand has 7 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 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-27 18:13:59,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:59,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 235 [2023-01-27 18:13:59,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:02,064 INFO L130 PetriNetUnfolder]: 14187/21191 cut-off events. [2023-01-27 18:14:02,064 INFO L131 PetriNetUnfolder]: For 344433/346863 co-relation queries the response was YES. [2023-01-27 18:14:02,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142876 conditions, 21191 events. 14187/21191 cut-off events. For 344433/346863 co-relation queries the response was YES. Maximal size of possible extension queue 1082. Compared 140847 event pairs, 1991 based on Foata normal form. 1652/22122 useless extension candidates. Maximal degree in co-relation 142815. Up to 11029 conditions per place. [2023-01-27 18:14:02,282 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 199 selfloop transitions, 23 changer transitions 24/319 dead transitions. [2023-01-27 18:14:02,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 319 transitions, 6855 flow [2023-01-27 18:14:02,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:14:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:14:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 791 transitions. [2023-01-27 18:14:02,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4808510638297872 [2023-01-27 18:14:02,284 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 791 transitions. [2023-01-27 18:14:02,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 791 transitions. [2023-01-27 18:14:02,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:02,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 791 transitions. [2023-01-27 18:14:02,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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-27 18:14:02,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 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-27 18:14:02,287 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 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-27 18:14:02,287 INFO L175 Difference]: Start difference. First operand has 112 places, 263 transitions, 5526 flow. Second operand 7 states and 791 transitions. [2023-01-27 18:14:02,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 319 transitions, 6855 flow [2023-01-27 18:14:04,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 319 transitions, 6749 flow, removed 48 selfloop flow, removed 3 redundant places. [2023-01-27 18:14:04,045 INFO L231 Difference]: Finished difference. Result has 115 places, 263 transitions, 5511 flow [2023-01-27 18:14:04,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=5442, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5511, PETRI_PLACES=115, PETRI_TRANSITIONS=263} [2023-01-27 18:14:04,046 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 73 predicate places. [2023-01-27 18:14:04,046 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 263 transitions, 5511 flow [2023-01-27 18:14:04,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 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-27 18:14:04,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:04,046 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-27 18:14:04,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:14:04,046 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:04,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:04,047 INFO L85 PathProgramCache]: Analyzing trace with hash 886799159, now seen corresponding path program 1 times [2023-01-27 18:14:04,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:04,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040803265] [2023-01-27 18:14:04,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:04,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:04,222 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-27 18:14:04,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:04,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040803265] [2023-01-27 18:14:04,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040803265] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:04,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:04,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:14:04,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21210069] [2023-01-27 18:14:04,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:04,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:14:04,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:04,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:14:04,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:14:04,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 235 [2023-01-27 18:14:04,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 263 transitions, 5511 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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-27 18:14:04,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:04,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 235 [2023-01-27 18:14:04,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:06,738 INFO L130 PetriNetUnfolder]: 10864/16522 cut-off events. [2023-01-27 18:14:06,738 INFO L131 PetriNetUnfolder]: For 452829/462901 co-relation queries the response was YES. [2023-01-27 18:14:06,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111515 conditions, 16522 events. 10864/16522 cut-off events. For 452829/462901 co-relation queries the response was YES. Maximal size of possible extension queue 1142. Compared 115632 event pairs, 1956 based on Foata normal form. 5530/21534 useless extension candidates. Maximal degree in co-relation 111452. Up to 11110 conditions per place. [2023-01-27 18:14:06,856 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 375 selfloop transitions, 10 changer transitions 74/529 dead transitions. [2023-01-27 18:14:06,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 529 transitions, 12169 flow [2023-01-27 18:14:06,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:14:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:14:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2023-01-27 18:14:06,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5148936170212766 [2023-01-27 18:14:06,857 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 605 transitions. [2023-01-27 18:14:06,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 605 transitions. [2023-01-27 18:14:06,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:06,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 605 transitions. [2023-01-27 18:14:06,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 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-27 18:14:06,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 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-27 18:14:06,860 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 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-27 18:14:06,860 INFO L175 Difference]: Start difference. First operand has 115 places, 263 transitions, 5511 flow. Second operand 5 states and 605 transitions. [2023-01-27 18:14:06,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 529 transitions, 12169 flow [2023-01-27 18:14:07,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 529 transitions, 12107 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-01-27 18:14:07,353 INFO L231 Difference]: Finished difference. Result has 114 places, 254 transitions, 5285 flow [2023-01-27 18:14:07,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=5110, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5285, PETRI_PLACES=114, PETRI_TRANSITIONS=254} [2023-01-27 18:14:07,354 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2023-01-27 18:14:07,354 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 254 transitions, 5285 flow [2023-01-27 18:14:07,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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-27 18:14:07,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:07,354 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-27 18:14:07,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:14:07,354 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:07,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:07,354 INFO L85 PathProgramCache]: Analyzing trace with hash -597741335, now seen corresponding path program 1 times [2023-01-27 18:14:07,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:07,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514121102] [2023-01-27 18:14:07,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:07,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:07,483 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-27 18:14:07,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:07,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514121102] [2023-01-27 18:14:07,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514121102] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:07,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:07,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:14:07,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700934282] [2023-01-27 18:14:07,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:07,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:14:07,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:07,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:14:07,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:14:07,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 235 [2023-01-27 18:14:07,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 254 transitions, 5285 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 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-27 18:14:07,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:07,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 235 [2023-01-27 18:14:07,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:09,461 INFO L130 PetriNetUnfolder]: 8408/13257 cut-off events. [2023-01-27 18:14:09,461 INFO L131 PetriNetUnfolder]: For 392495/402003 co-relation queries the response was YES. [2023-01-27 18:14:09,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98457 conditions, 13257 events. 8408/13257 cut-off events. For 392495/402003 co-relation queries the response was YES. Maximal size of possible extension queue 957. Compared 95782 event pairs, 503 based on Foata normal form. 4870/17740 useless extension candidates. Maximal degree in co-relation 98395. Up to 5449 conditions per place. [2023-01-27 18:14:09,554 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 422 selfloop transitions, 18 changer transitions 137/635 dead transitions. [2023-01-27 18:14:09,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 635 transitions, 14742 flow [2023-01-27 18:14:09,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:14:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:14:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 848 transitions. [2023-01-27 18:14:09,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155015197568389 [2023-01-27 18:14:09,556 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 848 transitions. [2023-01-27 18:14:09,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 848 transitions. [2023-01-27 18:14:09,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:09,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 848 transitions. [2023-01-27 18:14:09,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 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-27 18:14:09,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 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-27 18:14:09,560 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 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-27 18:14:09,560 INFO L175 Difference]: Start difference. First operand has 114 places, 254 transitions, 5285 flow. Second operand 7 states and 848 transitions. [2023-01-27 18:14:09,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 635 transitions, 14742 flow [2023-01-27 18:14:09,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 635 transitions, 14334 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-01-27 18:14:09,852 INFO L231 Difference]: Finished difference. Result has 120 places, 221 transitions, 4449 flow [2023-01-27 18:14:09,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=4236, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4449, PETRI_PLACES=120, PETRI_TRANSITIONS=221} [2023-01-27 18:14:09,853 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 78 predicate places. [2023-01-27 18:14:09,853 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 221 transitions, 4449 flow [2023-01-27 18:14:09,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 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-27 18:14:09,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:09,854 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-27 18:14:09,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-27 18:14:09,854 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:09,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:09,854 INFO L85 PathProgramCache]: Analyzing trace with hash -989767449, now seen corresponding path program 1 times [2023-01-27 18:14:09,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:09,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014316402] [2023-01-27 18:14:09,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:09,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:10,094 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-27 18:14:10,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:10,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014316402] [2023-01-27 18:14:10,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014316402] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:10,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:10,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:14:10,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598189984] [2023-01-27 18:14:10,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:10,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:14:10,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:10,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:14:10,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:14:10,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-27 18:14:10,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 221 transitions, 4449 flow. Second operand has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 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-27 18:14:10,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:10,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-27 18:14:10,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:13,318 INFO L130 PetriNetUnfolder]: 14311/22452 cut-off events. [2023-01-27 18:14:13,318 INFO L131 PetriNetUnfolder]: For 394141/394141 co-relation queries the response was YES. [2023-01-27 18:14:13,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175294 conditions, 22452 events. 14311/22452 cut-off events. For 394141/394141 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 159215 event pairs, 2880 based on Foata normal form. 110/22562 useless extension candidates. Maximal degree in co-relation 175230. Up to 11813 conditions per place. [2023-01-27 18:14:13,434 INFO L137 encePairwiseOnDemand]: 222/235 looper letters, 181 selfloop transitions, 60 changer transitions 130/371 dead transitions. [2023-01-27 18:14:13,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 371 transitions, 7350 flow [2023-01-27 18:14:13,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:14:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:14:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 767 transitions. [2023-01-27 18:14:13,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4662613981762918 [2023-01-27 18:14:13,435 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 767 transitions. [2023-01-27 18:14:13,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 767 transitions. [2023-01-27 18:14:13,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:13,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 767 transitions. [2023-01-27 18:14:13,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 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-27 18:14:13,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 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-27 18:14:13,438 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 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-27 18:14:13,438 INFO L175 Difference]: Start difference. First operand has 120 places, 221 transitions, 4449 flow. Second operand 7 states and 767 transitions. [2023-01-27 18:14:13,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 371 transitions, 7350 flow [2023-01-27 18:14:15,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 371 transitions, 7203 flow, removed 53 selfloop flow, removed 4 redundant places. [2023-01-27 18:14:15,460 INFO L231 Difference]: Finished difference. Result has 126 places, 176 transitions, 3669 flow [2023-01-27 18:14:15,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=4396, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3669, PETRI_PLACES=126, PETRI_TRANSITIONS=176} [2023-01-27 18:14:15,460 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 84 predicate places. [2023-01-27 18:14:15,460 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 176 transitions, 3669 flow [2023-01-27 18:14:15,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 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-27 18:14:15,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:15,461 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-27 18:14:15,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-27 18:14:15,461 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:15,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:15,461 INFO L85 PathProgramCache]: Analyzing trace with hash -706237089, now seen corresponding path program 1 times [2023-01-27 18:14:15,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:15,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108325542] [2023-01-27 18:14:15,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:15,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:15,581 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-27 18:14:15,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:15,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108325542] [2023-01-27 18:14:15,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108325542] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:15,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:15,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:14:15,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77790345] [2023-01-27 18:14:15,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:15,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:14:15,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:15,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:14:15,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:14:15,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 235 [2023-01-27 18:14:15,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 176 transitions, 3669 flow. Second operand has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 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-27 18:14:15,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:15,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 235 [2023-01-27 18:14:15,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:16,324 INFO L130 PetriNetUnfolder]: 2754/4742 cut-off events. [2023-01-27 18:14:16,324 INFO L131 PetriNetUnfolder]: For 125368/127204 co-relation queries the response was YES. [2023-01-27 18:14:16,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34084 conditions, 4742 events. 2754/4742 cut-off events. For 125368/127204 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 31514 event pairs, 197 based on Foata normal form. 1115/5722 useless extension candidates. Maximal degree in co-relation 34017. Up to 1759 conditions per place. [2023-01-27 18:14:16,349 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 248 selfloop transitions, 17 changer transitions 102/401 dead transitions. [2023-01-27 18:14:16,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 401 transitions, 9010 flow [2023-01-27 18:14:16,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:14:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:14:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 849 transitions. [2023-01-27 18:14:16,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161094224924012 [2023-01-27 18:14:16,350 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 849 transitions. [2023-01-27 18:14:16,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 849 transitions. [2023-01-27 18:14:16,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:16,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 849 transitions. [2023-01-27 18:14:16,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 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-27 18:14:16,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 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-27 18:14:16,354 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 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-27 18:14:16,354 INFO L175 Difference]: Start difference. First operand has 126 places, 176 transitions, 3669 flow. Second operand 7 states and 849 transitions. [2023-01-27 18:14:16,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 401 transitions, 9010 flow [2023-01-27 18:14:16,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 401 transitions, 8214 flow, removed 73 selfloop flow, removed 14 redundant places. [2023-01-27 18:14:16,453 INFO L231 Difference]: Finished difference. Result has 114 places, 148 transitions, 2661 flow [2023-01-27 18:14:16,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=2707, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2661, PETRI_PLACES=114, PETRI_TRANSITIONS=148} [2023-01-27 18:14:16,454 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2023-01-27 18:14:16,454 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 148 transitions, 2661 flow [2023-01-27 18:14:16,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 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-27 18:14:16,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:16,454 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, 1, 1, 1] [2023-01-27 18:14:16,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-27 18:14:16,455 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:16,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:16,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2136738546, now seen corresponding path program 1 times [2023-01-27 18:14:16,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:16,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770084559] [2023-01-27 18:14:16,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:16,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:16,679 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-27 18:14:16,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:16,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770084559] [2023-01-27 18:14:16,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770084559] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:16,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:16,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:14:16,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51338038] [2023-01-27 18:14:16,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:16,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:14:16,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:16,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:14:16,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:14:16,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 235 [2023-01-27 18:14:16,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 148 transitions, 2661 flow. Second operand has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 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-27 18:14:16,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:16,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 235 [2023-01-27 18:14:16,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:17,708 INFO L130 PetriNetUnfolder]: 4500/7871 cut-off events. [2023-01-27 18:14:17,708 INFO L131 PetriNetUnfolder]: For 115537/115537 co-relation queries the response was YES. [2023-01-27 18:14:17,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56871 conditions, 7871 events. 4500/7871 cut-off events. For 115537/115537 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 54850 event pairs, 570 based on Foata normal form. 16/7887 useless extension candidates. Maximal degree in co-relation 56828. Up to 2884 conditions per place. [2023-01-27 18:14:17,746 INFO L137 encePairwiseOnDemand]: 221/235 looper letters, 109 selfloop transitions, 47 changer transitions 192/348 dead transitions. [2023-01-27 18:14:17,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 348 transitions, 6293 flow [2023-01-27 18:14:17,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:14:17,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:14:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 767 transitions. [2023-01-27 18:14:17,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4662613981762918 [2023-01-27 18:14:17,747 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 767 transitions. [2023-01-27 18:14:17,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 767 transitions. [2023-01-27 18:14:17,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:17,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 767 transitions. [2023-01-27 18:14:17,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 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-27 18:14:17,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 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-27 18:14:17,750 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 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-27 18:14:17,750 INFO L175 Difference]: Start difference. First operand has 114 places, 148 transitions, 2661 flow. Second operand 7 states and 767 transitions. [2023-01-27 18:14:17,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 348 transitions, 6293 flow [2023-01-27 18:14:18,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 348 transitions, 5950 flow, removed 133 selfloop flow, removed 6 redundant places. [2023-01-27 18:14:18,245 INFO L231 Difference]: Finished difference. Result has 117 places, 107 transitions, 1923 flow [2023-01-27 18:14:18,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=2571, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1923, PETRI_PLACES=117, PETRI_TRANSITIONS=107} [2023-01-27 18:14:18,246 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2023-01-27 18:14:18,246 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 107 transitions, 1923 flow [2023-01-27 18:14:18,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 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-27 18:14:18,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:18,246 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, 1, 1, 1] [2023-01-27 18:14:18,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-27 18:14:18,247 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:18,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:18,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1212472198, now seen corresponding path program 2 times [2023-01-27 18:14:18,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:18,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465853668] [2023-01-27 18:14:18,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:18,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:18,372 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-27 18:14:18,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:18,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465853668] [2023-01-27 18:14:18,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465853668] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:18,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:18,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:14:18,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143242595] [2023-01-27 18:14:18,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:18,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:14:18,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:18,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:14:18,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:14:18,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 235 [2023-01-27 18:14:18,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 107 transitions, 1923 flow. Second operand has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 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-27 18:14:18,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:18,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 235 [2023-01-27 18:14:18,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:18,692 INFO L130 PetriNetUnfolder]: 1239/2224 cut-off events. [2023-01-27 18:14:18,693 INFO L131 PetriNetUnfolder]: For 34709/34996 co-relation queries the response was YES. [2023-01-27 18:14:18,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14868 conditions, 2224 events. 1239/2224 cut-off events. For 34709/34996 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 13419 event pairs, 120 based on Foata normal form. 219/2389 useless extension candidates. Maximal degree in co-relation 14825. Up to 791 conditions per place. [2023-01-27 18:14:18,701 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 33 selfloop transitions, 17 changer transitions 164/218 dead transitions. [2023-01-27 18:14:18,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 218 transitions, 4472 flow [2023-01-27 18:14:18,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:14:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:14:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 936 transitions. [2023-01-27 18:14:18,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4978723404255319 [2023-01-27 18:14:18,703 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 936 transitions. [2023-01-27 18:14:18,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 936 transitions. [2023-01-27 18:14:18,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:18,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 936 transitions. [2023-01-27 18:14:18,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 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-27 18:14:18,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 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-27 18:14:18,705 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 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-27 18:14:18,705 INFO L175 Difference]: Start difference. First operand has 117 places, 107 transitions, 1923 flow. Second operand 8 states and 936 transitions. [2023-01-27 18:14:18,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 218 transitions, 4472 flow [2023-01-27 18:14:18,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 218 transitions, 4228 flow, removed 29 selfloop flow, removed 6 redundant places. [2023-01-27 18:14:18,742 INFO L231 Difference]: Finished difference. Result has 116 places, 41 transitions, 454 flow [2023-01-27 18:14:18,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1791, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=454, PETRI_PLACES=116, PETRI_TRANSITIONS=41} [2023-01-27 18:14:18,742 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 74 predicate places. [2023-01-27 18:14:18,742 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 41 transitions, 454 flow [2023-01-27 18:14:18,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 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-27 18:14:18,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:18,743 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, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:18,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-27 18:14:18,743 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:18,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:18,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2145444237, now seen corresponding path program 1 times [2023-01-27 18:14:18,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:18,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146319159] [2023-01-27 18:14:18,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:18,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:14:18,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:14:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:14:18,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:14:18,803 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:14:18,804 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-27 18:14:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-27 18:14:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-27 18:14:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-27 18:14:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-27 18:14:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-27 18:14:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-27 18:14:18,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-01-27 18:14:18,806 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:18,810 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:14:18,810 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:14:18,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:14:18 BasicIcfg [2023-01-27 18:14:18,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:14:18,850 INFO L158 Benchmark]: Toolchain (without parser) took 55110.56ms. Allocated memory was 329.3MB in the beginning and 9.8GB in the end (delta: 9.4GB). Free memory was 270.7MB in the beginning and 7.6GB in the end (delta: -7.3GB). Peak memory consumption was 2.1GB. Max. memory is 16.0GB. [2023-01-27 18:14:18,851 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 329.3MB. Free memory is still 278.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:14:18,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.49ms. Allocated memory is still 329.3MB. Free memory was 270.4MB in the beginning and 247.3MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:14:18,851 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.98ms. Allocated memory is still 329.3MB. Free memory was 247.3MB in the beginning and 244.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:14:18,851 INFO L158 Benchmark]: Boogie Preprocessor took 29.95ms. Allocated memory was 329.3MB in the beginning and 494.9MB in the end (delta: 165.7MB). Free memory was 244.5MB in the beginning and 460.8MB in the end (delta: -216.4MB). Peak memory consumption was 8.8MB. Max. memory is 16.0GB. [2023-01-27 18:14:18,851 INFO L158 Benchmark]: RCFGBuilder took 517.70ms. Allocated memory is still 494.9MB. Free memory was 460.8MB in the beginning and 426.4MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-01-27 18:14:18,851 INFO L158 Benchmark]: TraceAbstraction took 54165.43ms. Allocated memory was 494.9MB in the beginning and 9.8GB in the end (delta: 9.3GB). Free memory was 426.1MB in the beginning and 7.6GB in the end (delta: -7.2GB). Peak memory consumption was 2.1GB. Max. memory is 16.0GB. [2023-01-27 18:14:18,852 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.17ms. Allocated memory is still 329.3MB. Free memory is still 278.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 341.49ms. Allocated memory is still 329.3MB. Free memory was 270.4MB in the beginning and 247.3MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 51.98ms. Allocated memory is still 329.3MB. Free memory was 247.3MB in the beginning and 244.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.95ms. Allocated memory was 329.3MB in the beginning and 494.9MB in the end (delta: 165.7MB). Free memory was 244.5MB in the beginning and 460.8MB in the end (delta: -216.4MB). Peak memory consumption was 8.8MB. Max. memory is 16.0GB. * RCFGBuilder took 517.70ms. Allocated memory is still 494.9MB. Free memory was 460.8MB in the beginning and 426.4MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 54165.43ms. Allocated memory was 494.9MB in the beginning and 9.8GB in the end (delta: 9.3GB). Free memory was 426.1MB in the beginning and 7.6GB in the end (delta: -7.2GB). Peak memory consumption was 2.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 136 PlacesBefore, 42 PlacesAfterwards, 125 TransitionsBefore, 30 TransitionsAfterwards, 2936 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 6820 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3180, independent: 3000, independent conditional: 0, independent unconditional: 3000, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1541, independent: 1507, independent conditional: 0, independent unconditional: 1507, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3180, independent: 1493, independent conditional: 0, independent unconditional: 1493, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 1541, unknown conditional: 0, unknown unconditional: 1541] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1253; [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1253, ((void *)0), P0, ((void *)0))=-1, t1253={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 0 pthread_t t1254; [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1254, ((void *)0), P1, ((void *)0))=0, t1253={5:0}, t1254={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1255; [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1255, ((void *)0), P2, ((void *)0))=1, t1253={5:0}, t1254={6:0}, t1255={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1256; [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1256, ((void *)0), P3, ((void *)0))=2, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L804] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L804] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 849]: 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: 845]: 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: 847]: 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 9 procedures, 165 locations, 7 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: 54.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 43.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 882 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 882 mSDsluCounter, 392 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 264 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3115 IncrementalHoareTripleChecker+Invalid, 3246 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 128 mSDtfsCounter, 3115 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5526occurred in iteration=11, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 342 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 297 ConstructedInterpolants, 0 QuantifiedInterpolants, 3488 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-27 18:14:18,868 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...