/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 07:02:07,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 07:02:07,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 07:02:07,078 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 07:02:07,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 07:02:07,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 07:02:07,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 07:02:07,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 07:02:07,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 07:02:07,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 07:02:07,083 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 07:02:07,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 07:02:07,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 07:02:07,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 07:02:07,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 07:02:07,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 07:02:07,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 07:02:07,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 07:02:07,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 07:02:07,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 07:02:07,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 07:02:07,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 07:02:07,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 07:02:07,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 07:02:07,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 07:02:07,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 07:02:07,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 07:02:07,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 07:02:07,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 07:02:07,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 07:02:07,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 07:02:07,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 07:02:07,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 07:02:07,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 07:02:07,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 07:02:07,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 07:02:07,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 07:02:07,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 07:02:07,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 07:02:07,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 07:02:07,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 07:02:07,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 07:02:07,114 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 07:02:07,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 07:02:07,115 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 07:02:07,115 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 07:02:07,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 07:02:07,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 07:02:07,116 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 07:02:07,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 07:02:07,116 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 07:02:07,116 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 07:02:07,116 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 07:02:07,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 07:02:07,117 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 07:02:07,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 07:02:07,117 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 07:02:07,117 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 07:02:07,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 07:02:07,117 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 07:02:07,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 07:02:07,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 07:02:07,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 07:02:07,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 07:02:07,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 07:02:07,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:02:07,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 07:02:07,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 07:02:07,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 07:02:07,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 07:02:07,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 07:02:07,118 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 07:02:07,118 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 07:02:07,118 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 07:02:07,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 07:02:07,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 07:02:07,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 07:02:07,312 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 07:02:07,313 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 07:02:07,314 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 07:02:08,483 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 07:02:08,649 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 07:02:08,650 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 07:02:08,657 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcca426b2/8408527ce9064122a792f4f47a1b250d/FLAGc03510264 [2023-01-28 07:02:08,669 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcca426b2/8408527ce9064122a792f4f47a1b250d [2023-01-28 07:02:08,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 07:02:08,673 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 07:02:08,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 07:02:08,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 07:02:08,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 07:02:08,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:02:08" (1/1) ... [2023-01-28 07:02:08,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@efc9aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:08, skipping insertion in model container [2023-01-28 07:02:08,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:02:08" (1/1) ... [2023-01-28 07:02:08,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 07:02:08,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 07:02:08,847 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-01-28 07:02:08,988 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:02:08,997 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 07:02:09,013 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-01-28 07:02:09,056 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:02:09,085 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 07:02:09,086 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 07:02:09,090 INFO L208 MainTranslator]: Completed translation [2023-01-28 07:02:09,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:09 WrapperNode [2023-01-28 07:02:09,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 07:02:09,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 07:02:09,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 07:02:09,092 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 07:02:09,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:09" (1/1) ... [2023-01-28 07:02:09,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:09" (1/1) ... [2023-01-28 07:02:09,147 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-01-28 07:02:09,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 07:02:09,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 07:02:09,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 07:02:09,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 07:02:09,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:09" (1/1) ... [2023-01-28 07:02:09,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:09" (1/1) ... [2023-01-28 07:02:09,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:09" (1/1) ... [2023-01-28 07:02:09,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:09" (1/1) ... [2023-01-28 07:02:09,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:09" (1/1) ... [2023-01-28 07:02:09,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:09" (1/1) ... [2023-01-28 07:02:09,183 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:09" (1/1) ... [2023-01-28 07:02:09,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:09" (1/1) ... [2023-01-28 07:02:09,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 07:02:09,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 07:02:09,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 07:02:09,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 07:02:09,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:09" (1/1) ... [2023-01-28 07:02:09,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:02:09,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:02:09,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 07:02:09,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 07:02:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 07:02:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 07:02:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 07:02:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 07:02:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 07:02:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 07:02:09,276 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 07:02:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 07:02:09,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 07:02:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 07:02:09,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 07:02:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 07:02:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 07:02:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 07:02:09,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 07:02:09,278 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 07:02:09,383 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 07:02:09,384 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 07:02:09,640 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 07:02:09,778 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 07:02:09,778 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 07:02:09,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:02:09 BoogieIcfgContainer [2023-01-28 07:02:09,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 07:02:09,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 07:02:09,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 07:02:09,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 07:02:09,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 07:02:08" (1/3) ... [2023-01-28 07:02:09,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64927bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:02:09, skipping insertion in model container [2023-01-28 07:02:09,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:02:09" (2/3) ... [2023-01-28 07:02:09,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64927bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:02:09, skipping insertion in model container [2023-01-28 07:02:09,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:02:09" (3/3) ... [2023-01-28 07:02:09,788 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 07:02:09,800 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 07:02:09,800 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 07:02:09,800 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 07:02:09,841 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 07:02:09,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2023-01-28 07:02:09,919 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2023-01-28 07:02:09,919 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:02:09,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-28 07:02:09,923 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2023-01-28 07:02:09,926 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2023-01-28 07:02:09,929 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:02:09,945 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 102 transitions, 213 flow [2023-01-28 07:02:09,948 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 213 flow [2023-01-28 07:02:09,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 213 flow [2023-01-28 07:02:09,976 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2023-01-28 07:02:09,976 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:02:09,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-28 07:02:09,978 INFO L119 LiptonReduction]: Number of co-enabled transitions 1818 [2023-01-28 07:02:12,720 INFO L134 LiptonReduction]: Checked pairs total: 4335 [2023-01-28 07:02:12,721 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-01-28 07:02:12,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 07:02:12,734 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;@280e26fb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:02:12,735 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 07:02:12,736 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 07:02:12,736 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:02:12,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:12,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 07:02:12,737 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:02:12,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:12,740 INFO L85 PathProgramCache]: Analyzing trace with hash 464724, now seen corresponding path program 1 times [2023-01-28 07:02:12,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:12,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047202024] [2023-01-28 07:02:12,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:12,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:02:13,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:13,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047202024] [2023-01-28 07:02:13,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047202024] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:13,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:13,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 07:02:13,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486717520] [2023-01-28 07:02:13,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:13,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:02:13,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:13,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:02:13,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:02:13,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 199 [2023-01-28 07:02:13,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:13,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:13,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 199 [2023-01-28 07:02:13,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:13,189 INFO L130 PetriNetUnfolder]: 711/1126 cut-off events. [2023-01-28 07:02:13,190 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-01-28 07:02:13,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2245 conditions, 1126 events. 711/1126 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5132 event pairs, 191 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 2234. Up to 871 conditions per place. [2023-01-28 07:02:13,196 INFO L137 encePairwiseOnDemand]: 196/199 looper letters, 29 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2023-01-28 07:02:13,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 151 flow [2023-01-28 07:02:13,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:02:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:02:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-01-28 07:02:13,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142378559463987 [2023-01-28 07:02:13,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-01-28 07:02:13,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-01-28 07:02:13,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:13,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-01-28 07:02:13,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:13,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:13,213 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:13,215 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states and 307 transitions. [2023-01-28 07:02:13,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 151 flow [2023-01-28 07:02:13,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 07:02:13,217 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-01-28 07:02:13,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-01-28 07:02:13,221 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-01-28 07:02:13,221 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-01-28 07:02:13,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:13,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:13,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:13,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 07:02:13,222 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:02:13,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:13,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1006435865, now seen corresponding path program 1 times [2023-01-28 07:02:13,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:13,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212098374] [2023-01-28 07:02:13,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:13,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:02:14,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:14,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212098374] [2023-01-28 07:02:14,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212098374] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:14,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:14,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:02:14,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567553527] [2023-01-28 07:02:14,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:14,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:02:14,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:14,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:02:14,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:02:14,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-01-28 07:02:14,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:14,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:14,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-01-28 07:02:14,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:14,315 INFO L130 PetriNetUnfolder]: 988/1483 cut-off events. [2023-01-28 07:02:14,315 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2023-01-28 07:02:14,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3108 conditions, 1483 events. 988/1483 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5978 event pairs, 204 based on Foata normal form. 36/1519 useless extension candidates. Maximal degree in co-relation 3098. Up to 1101 conditions per place. [2023-01-28 07:02:14,321 INFO L137 encePairwiseOnDemand]: 190/199 looper letters, 30 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2023-01-28 07:02:14,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 164 flow [2023-01-28 07:02:14,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:02:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:02:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 356 transitions. [2023-01-28 07:02:14,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4472361809045226 [2023-01-28 07:02:14,324 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 356 transitions. [2023-01-28 07:02:14,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 356 transitions. [2023-01-28 07:02:14,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:14,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 356 transitions. [2023-01-28 07:02:14,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:14,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:14,327 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:14,327 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 4 states and 356 transitions. [2023-01-28 07:02:14,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 164 flow [2023-01-28 07:02:14,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 38 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 07:02:14,328 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 106 flow [2023-01-28 07:02:14,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2023-01-28 07:02:14,329 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2023-01-28 07:02:14,329 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 106 flow [2023-01-28 07:02:14,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:14,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:14,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:14,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 07:02:14,330 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:02:14,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:14,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1134739560, now seen corresponding path program 1 times [2023-01-28 07:02:14,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:14,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467259076] [2023-01-28 07:02:14,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:14,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:02:15,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:15,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467259076] [2023-01-28 07:02:15,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467259076] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:15,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:15,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:02:15,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213218951] [2023-01-28 07:02:15,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:15,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:02:15,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:15,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:02:15,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:02:15,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-01-28 07:02:15,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:15,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:15,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-01-28 07:02:15,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:15,270 INFO L130 PetriNetUnfolder]: 992/1491 cut-off events. [2023-01-28 07:02:15,271 INFO L131 PetriNetUnfolder]: For 647/647 co-relation queries the response was YES. [2023-01-28 07:02:15,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4202 conditions, 1491 events. 992/1491 cut-off events. For 647/647 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6210 event pairs, 293 based on Foata normal form. 8/1499 useless extension candidates. Maximal degree in co-relation 4189. Up to 1256 conditions per place. [2023-01-28 07:02:15,277 INFO L137 encePairwiseOnDemand]: 190/199 looper letters, 37 selfloop transitions, 16 changer transitions 0/53 dead transitions. [2023-01-28 07:02:15,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 53 transitions, 302 flow [2023-01-28 07:02:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:02:15,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:02:15,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 364 transitions. [2023-01-28 07:02:15,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.457286432160804 [2023-01-28 07:02:15,279 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 364 transitions. [2023-01-28 07:02:15,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 364 transitions. [2023-01-28 07:02:15,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:15,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 364 transitions. [2023-01-28 07:02:15,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:15,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:15,282 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:15,282 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 106 flow. Second operand 4 states and 364 transitions. [2023-01-28 07:02:15,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 53 transitions, 302 flow [2023-01-28 07:02:15,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 53 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 07:02:15,285 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 201 flow [2023-01-28 07:02:15,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2023-01-28 07:02:15,285 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2023-01-28 07:02:15,285 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 201 flow [2023-01-28 07:02:15,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:15,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:15,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:15,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 07:02:15,286 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:02:15,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:15,286 INFO L85 PathProgramCache]: Analyzing trace with hash 796112234, now seen corresponding path program 1 times [2023-01-28 07:02:15,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:15,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800209160] [2023-01-28 07:02:15,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:15,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:02:15,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:15,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800209160] [2023-01-28 07:02:15,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800209160] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:15,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:15,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:02:15,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210353295] [2023-01-28 07:02:15,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:15,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:02:15,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:15,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:02:15,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:02:15,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-01-28 07:02:15,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:15,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:15,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-01-28 07:02:15,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:16,216 INFO L130 PetriNetUnfolder]: 1469/2216 cut-off events. [2023-01-28 07:02:16,216 INFO L131 PetriNetUnfolder]: For 2439/2439 co-relation queries the response was YES. [2023-01-28 07:02:16,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7479 conditions, 2216 events. 1469/2216 cut-off events. For 2439/2439 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10372 event pairs, 208 based on Foata normal form. 72/2288 useless extension candidates. Maximal degree in co-relation 7463. Up to 1075 conditions per place. [2023-01-28 07:02:16,226 INFO L137 encePairwiseOnDemand]: 190/199 looper letters, 41 selfloop transitions, 10 changer transitions 14/65 dead transitions. [2023-01-28 07:02:16,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 65 transitions, 461 flow [2023-01-28 07:02:16,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:02:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:02:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2023-01-28 07:02:16,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45125628140703516 [2023-01-28 07:02:16,228 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 449 transitions. [2023-01-28 07:02:16,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 449 transitions. [2023-01-28 07:02:16,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:16,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 449 transitions. [2023-01-28 07:02:16,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.8) internal successors, (449), 5 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-28 07:02:16,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:16,231 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:16,231 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 201 flow. Second operand 5 states and 449 transitions. [2023-01-28 07:02:16,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 65 transitions, 461 flow [2023-01-28 07:02:16,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 461 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 07:02:16,235 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 208 flow [2023-01-28 07:02:16,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-01-28 07:02:16,236 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-01-28 07:02:16,236 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 208 flow [2023-01-28 07:02:16,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:16,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:16,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:16,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 07:02:16,237 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:02:16,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:16,237 INFO L85 PathProgramCache]: Analyzing trace with hash 817191614, now seen corresponding path program 2 times [2023-01-28 07:02:16,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:16,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768598841] [2023-01-28 07:02:16,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:16,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:02:16,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:16,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768598841] [2023-01-28 07:02:16,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768598841] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:16,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:16,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:02:16,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592019238] [2023-01-28 07:02:16,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:16,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:02:16,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:16,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:02:16,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:02:16,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-01-28 07:02:16,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:16,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:16,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-01-28 07:02:16,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:17,225 INFO L130 PetriNetUnfolder]: 906/1373 cut-off events. [2023-01-28 07:02:17,225 INFO L131 PetriNetUnfolder]: For 2191/2191 co-relation queries the response was YES. [2023-01-28 07:02:17,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5016 conditions, 1373 events. 906/1373 cut-off events. For 2191/2191 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5564 event pairs, 279 based on Foata normal form. 6/1379 useless extension candidates. Maximal degree in co-relation 4997. Up to 1162 conditions per place. [2023-01-28 07:02:17,231 INFO L137 encePairwiseOnDemand]: 188/199 looper letters, 37 selfloop transitions, 19 changer transitions 0/56 dead transitions. [2023-01-28 07:02:17,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 410 flow [2023-01-28 07:02:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:02:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:02:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2023-01-28 07:02:17,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4585427135678392 [2023-01-28 07:02:17,233 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 365 transitions. [2023-01-28 07:02:17,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 365 transitions. [2023-01-28 07:02:17,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:17,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 365 transitions. [2023-01-28 07:02:17,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:17,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:17,235 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:17,235 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 208 flow. Second operand 4 states and 365 transitions. [2023-01-28 07:02:17,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 410 flow [2023-01-28 07:02:17,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 376 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-01-28 07:02:17,238 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 273 flow [2023-01-28 07:02:17,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=273, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2023-01-28 07:02:17,239 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-01-28 07:02:17,239 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 273 flow [2023-01-28 07:02:17,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:17,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:17,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:17,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 07:02:17,239 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:02:17,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:17,240 INFO L85 PathProgramCache]: Analyzing trace with hash -437094604, now seen corresponding path program 1 times [2023-01-28 07:02:17,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:17,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63899057] [2023-01-28 07:02:17,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:17,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:02:17,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:17,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63899057] [2023-01-28 07:02:17,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63899057] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:17,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:17,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:02:17,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990249085] [2023-01-28 07:02:17,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:17,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:02:17,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:17,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:02:17,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:02:17,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 199 [2023-01-28 07:02:17,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:17,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:17,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 199 [2023-01-28 07:02:17,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:17,581 INFO L130 PetriNetUnfolder]: 1247/2027 cut-off events. [2023-01-28 07:02:17,581 INFO L131 PetriNetUnfolder]: For 4081/4177 co-relation queries the response was YES. [2023-01-28 07:02:17,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7524 conditions, 2027 events. 1247/2027 cut-off events. For 4081/4177 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10626 event pairs, 369 based on Foata normal form. 110/2125 useless extension candidates. Maximal degree in co-relation 7505. Up to 912 conditions per place. [2023-01-28 07:02:17,590 INFO L137 encePairwiseOnDemand]: 195/199 looper letters, 40 selfloop transitions, 4 changer transitions 22/68 dead transitions. [2023-01-28 07:02:17,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 539 flow [2023-01-28 07:02:17,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:02:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:02:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2023-01-28 07:02:17,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4904522613065327 [2023-01-28 07:02:17,592 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 488 transitions. [2023-01-28 07:02:17,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 488 transitions. [2023-01-28 07:02:17,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:17,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 488 transitions. [2023-01-28 07:02:17,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.6) internal successors, (488), 5 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:17,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:17,594 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:17,594 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 273 flow. Second operand 5 states and 488 transitions. [2023-01-28 07:02:17,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 68 transitions, 539 flow [2023-01-28 07:02:17,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 539 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 07:02:17,597 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 249 flow [2023-01-28 07:02:17,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-01-28 07:02:17,598 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2023-01-28 07:02:17,598 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 249 flow [2023-01-28 07:02:17,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:17,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:17,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:17,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 07:02:17,599 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:02:17,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1794977514, now seen corresponding path program 1 times [2023-01-28 07:02:17,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:17,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230736951] [2023-01-28 07:02:17,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:02:17,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:17,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230736951] [2023-01-28 07:02:17,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230736951] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:17,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:17,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:02:17,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918917472] [2023-01-28 07:02:17,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:17,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:02:17,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:17,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:02:17,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:02:17,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 199 [2023-01-28 07:02:17,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:17,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:17,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 199 [2023-01-28 07:02:17,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:18,142 INFO L130 PetriNetUnfolder]: 920/1459 cut-off events. [2023-01-28 07:02:18,143 INFO L131 PetriNetUnfolder]: For 3854/3910 co-relation queries the response was YES. [2023-01-28 07:02:18,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5879 conditions, 1459 events. 920/1459 cut-off events. For 3854/3910 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6649 event pairs, 294 based on Foata normal form. 63/1519 useless extension candidates. Maximal degree in co-relation 5856. Up to 1291 conditions per place. [2023-01-28 07:02:18,150 INFO L137 encePairwiseOnDemand]: 191/199 looper letters, 55 selfloop transitions, 17 changer transitions 5/79 dead transitions. [2023-01-28 07:02:18,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 79 transitions, 692 flow [2023-01-28 07:02:18,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:02:18,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:02:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2023-01-28 07:02:18,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824120603015075 [2023-01-28 07:02:18,152 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 480 transitions. [2023-01-28 07:02:18,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 480 transitions. [2023-01-28 07:02:18,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:18,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 480 transitions. [2023-01-28 07:02:18,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:18,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:18,154 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:18,154 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 249 flow. Second operand 5 states and 480 transitions. [2023-01-28 07:02:18,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 79 transitions, 692 flow [2023-01-28 07:02:18,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 79 transitions, 668 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 07:02:18,159 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 423 flow [2023-01-28 07:02:18,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=423, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2023-01-28 07:02:18,160 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2023-01-28 07:02:18,160 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 423 flow [2023-01-28 07:02:18,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:18,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:18,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:18,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 07:02:18,161 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:02:18,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:18,161 INFO L85 PathProgramCache]: Analyzing trace with hash 764989082, now seen corresponding path program 2 times [2023-01-28 07:02:18,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:18,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229062644] [2023-01-28 07:02:18,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:18,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:02:18,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:18,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229062644] [2023-01-28 07:02:18,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229062644] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:18,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:18,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:02:18,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984780900] [2023-01-28 07:02:18,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:18,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:02:18,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:18,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:02:18,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:02:18,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-01-28 07:02:18,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 423 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:18,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:18,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-01-28 07:02:18,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:18,903 INFO L130 PetriNetUnfolder]: 1028/1632 cut-off events. [2023-01-28 07:02:18,904 INFO L131 PetriNetUnfolder]: For 5834/5834 co-relation queries the response was YES. [2023-01-28 07:02:18,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7553 conditions, 1632 events. 1028/1632 cut-off events. For 5834/5834 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7468 event pairs, 437 based on Foata normal form. 6/1638 useless extension candidates. Maximal degree in co-relation 7529. Up to 1414 conditions per place. [2023-01-28 07:02:18,921 INFO L137 encePairwiseOnDemand]: 189/199 looper letters, 56 selfloop transitions, 22 changer transitions 4/82 dead transitions. [2023-01-28 07:02:18,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 82 transitions, 837 flow [2023-01-28 07:02:18,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:02:18,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:02:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 364 transitions. [2023-01-28 07:02:18,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.457286432160804 [2023-01-28 07:02:18,927 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 364 transitions. [2023-01-28 07:02:18,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 364 transitions. [2023-01-28 07:02:18,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:18,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 364 transitions. [2023-01-28 07:02:18,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:18,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:18,931 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:18,931 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 423 flow. Second operand 4 states and 364 transitions. [2023-01-28 07:02:18,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 82 transitions, 837 flow [2023-01-28 07:02:18,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 829 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-01-28 07:02:18,936 INFO L231 Difference]: Finished difference. Result has 54 places, 59 transitions, 610 flow [2023-01-28 07:02:18,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=610, PETRI_PLACES=54, PETRI_TRANSITIONS=59} [2023-01-28 07:02:18,936 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2023-01-28 07:02:18,936 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 59 transitions, 610 flow [2023-01-28 07:02:18,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:18,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:18,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:18,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 07:02:18,953 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:02:18,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:18,954 INFO L85 PathProgramCache]: Analyzing trace with hash 766400822, now seen corresponding path program 3 times [2023-01-28 07:02:18,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:18,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639257703] [2023-01-28 07:02:18,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:18,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:02:20,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:20,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639257703] [2023-01-28 07:02:20,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639257703] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:20,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:20,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:02:20,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4800360] [2023-01-28 07:02:20,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:20,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:02:20,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:20,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:02:20,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:02:20,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-01-28 07:02:20,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 59 transitions, 610 flow. Second operand has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:20,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:20,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-01-28 07:02:20,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:20,330 INFO L130 PetriNetUnfolder]: 1011/1625 cut-off events. [2023-01-28 07:02:20,330 INFO L131 PetriNetUnfolder]: For 7290/7290 co-relation queries the response was YES. [2023-01-28 07:02:20,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8091 conditions, 1625 events. 1011/1625 cut-off events. For 7290/7290 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7632 event pairs, 361 based on Foata normal form. 8/1633 useless extension candidates. Maximal degree in co-relation 8064. Up to 1204 conditions per place. [2023-01-28 07:02:20,341 INFO L137 encePairwiseOnDemand]: 190/199 looper letters, 58 selfloop transitions, 39 changer transitions 4/101 dead transitions. [2023-01-28 07:02:20,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 101 transitions, 1156 flow [2023-01-28 07:02:20,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:02:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:02:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2023-01-28 07:02:20,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542713567839196 [2023-01-28 07:02:20,343 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 452 transitions. [2023-01-28 07:02:20,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 452 transitions. [2023-01-28 07:02:20,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:20,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 452 transitions. [2023-01-28 07:02:20,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:20,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:20,346 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:20,346 INFO L175 Difference]: Start difference. First operand has 54 places, 59 transitions, 610 flow. Second operand 5 states and 452 transitions. [2023-01-28 07:02:20,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 101 transitions, 1156 flow [2023-01-28 07:02:20,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 101 transitions, 1122 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-28 07:02:20,353 INFO L231 Difference]: Finished difference. Result has 58 places, 73 transitions, 874 flow [2023-01-28 07:02:20,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=874, PETRI_PLACES=58, PETRI_TRANSITIONS=73} [2023-01-28 07:02:20,354 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2023-01-28 07:02:20,354 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 73 transitions, 874 flow [2023-01-28 07:02:20,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:20,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:20,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:20,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 07:02:20,355 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:02:20,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:20,355 INFO L85 PathProgramCache]: Analyzing trace with hash -2056674693, now seen corresponding path program 1 times [2023-01-28 07:02:20,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:20,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732584429] [2023-01-28 07:02:20,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:20,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:02:20,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:20,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732584429] [2023-01-28 07:02:20,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732584429] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:20,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:20,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:02:20,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841255194] [2023-01-28 07:02:20,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:20,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:02:20,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:20,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:02:20,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:02:20,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 199 [2023-01-28 07:02:20,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 73 transitions, 874 flow. Second operand has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:20,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:20,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 199 [2023-01-28 07:02:20,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:21,156 INFO L130 PetriNetUnfolder]: 937/1516 cut-off events. [2023-01-28 07:02:21,156 INFO L131 PetriNetUnfolder]: For 9135/9135 co-relation queries the response was YES. [2023-01-28 07:02:21,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8468 conditions, 1516 events. 937/1516 cut-off events. For 9135/9135 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6974 event pairs, 340 based on Foata normal form. 9/1525 useless extension candidates. Maximal degree in co-relation 8439. Up to 1237 conditions per place. [2023-01-28 07:02:21,172 INFO L137 encePairwiseOnDemand]: 192/199 looper letters, 84 selfloop transitions, 34 changer transitions 9/127 dead transitions. [2023-01-28 07:02:21,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 127 transitions, 1701 flow [2023-01-28 07:02:21,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:02:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:02:21,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 541 transitions. [2023-01-28 07:02:21,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45309882747068675 [2023-01-28 07:02:21,175 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 541 transitions. [2023-01-28 07:02:21,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 541 transitions. [2023-01-28 07:02:21,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:21,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 541 transitions. [2023-01-28 07:02:21,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:21,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:21,180 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:21,180 INFO L175 Difference]: Start difference. First operand has 58 places, 73 transitions, 874 flow. Second operand 6 states and 541 transitions. [2023-01-28 07:02:21,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 127 transitions, 1701 flow [2023-01-28 07:02:21,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 127 transitions, 1685 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-01-28 07:02:21,194 INFO L231 Difference]: Finished difference. Result has 66 places, 90 transitions, 1224 flow [2023-01-28 07:02:21,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1224, PETRI_PLACES=66, PETRI_TRANSITIONS=90} [2023-01-28 07:02:21,196 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 34 predicate places. [2023-01-28 07:02:21,196 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 90 transitions, 1224 flow [2023-01-28 07:02:21,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:21,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:21,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:21,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 07:02:21,197 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:02:21,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:21,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2055182322, now seen corresponding path program 1 times [2023-01-28 07:02:21,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:21,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187517249] [2023-01-28 07:02:21,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:21,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:21,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:02:21,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:21,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187517249] [2023-01-28 07:02:21,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187517249] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:21,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:21,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:02:21,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687884373] [2023-01-28 07:02:21,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:21,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:02:21,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:21,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:02:21,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:02:21,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 199 [2023-01-28 07:02:21,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 90 transitions, 1224 flow. Second operand has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:21,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:21,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 199 [2023-01-28 07:02:21,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:21,774 INFO L130 PetriNetUnfolder]: 831/1375 cut-off events. [2023-01-28 07:02:21,774 INFO L131 PetriNetUnfolder]: For 11181/11216 co-relation queries the response was YES. [2023-01-28 07:02:21,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8479 conditions, 1375 events. 831/1375 cut-off events. For 11181/11216 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6406 event pairs, 338 based on Foata normal form. 37/1408 useless extension candidates. Maximal degree in co-relation 8445. Up to 1165 conditions per place. [2023-01-28 07:02:21,784 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 87 selfloop transitions, 19 changer transitions 0/108 dead transitions. [2023-01-28 07:02:21,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 108 transitions, 1584 flow [2023-01-28 07:02:21,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:02:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:02:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 384 transitions. [2023-01-28 07:02:21,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824120603015075 [2023-01-28 07:02:21,786 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 384 transitions. [2023-01-28 07:02:21,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 384 transitions. [2023-01-28 07:02:21,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:21,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 384 transitions. [2023-01-28 07:02:21,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.0) internal successors, (384), 4 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-28 07:02:21,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:21,788 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:21,788 INFO L175 Difference]: Start difference. First operand has 66 places, 90 transitions, 1224 flow. Second operand 4 states and 384 transitions. [2023-01-28 07:02:21,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 108 transitions, 1584 flow [2023-01-28 07:02:21,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 1578 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-01-28 07:02:21,801 INFO L231 Difference]: Finished difference. Result has 70 places, 93 transitions, 1308 flow [2023-01-28 07:02:21,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1308, PETRI_PLACES=70, PETRI_TRANSITIONS=93} [2023-01-28 07:02:21,801 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2023-01-28 07:02:21,802 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 93 transitions, 1308 flow [2023-01-28 07:02:21,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:21,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:21,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:21,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 07:02:21,802 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:02:21,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:21,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2055182105, now seen corresponding path program 1 times [2023-01-28 07:02:21,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:21,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664617391] [2023-01-28 07:02:21,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:21,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:02:22,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:22,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664617391] [2023-01-28 07:02:22,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664617391] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:22,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:22,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:02:22,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165155117] [2023-01-28 07:02:22,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:22,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:02:22,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:22,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:02:22,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:02:22,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 199 [2023-01-28 07:02:22,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 93 transitions, 1308 flow. Second operand has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:22,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:22,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 199 [2023-01-28 07:02:22,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:22,384 INFO L130 PetriNetUnfolder]: 813/1351 cut-off events. [2023-01-28 07:02:22,384 INFO L131 PetriNetUnfolder]: For 12365/12413 co-relation queries the response was YES. [2023-01-28 07:02:22,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8609 conditions, 1351 events. 813/1351 cut-off events. For 12365/12413 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6294 event pairs, 331 based on Foata normal form. 38/1389 useless extension candidates. Maximal degree in co-relation 8572. Up to 1157 conditions per place. [2023-01-28 07:02:22,392 INFO L137 encePairwiseOnDemand]: 192/199 looper letters, 87 selfloop transitions, 18 changer transitions 0/107 dead transitions. [2023-01-28 07:02:22,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 107 transitions, 1608 flow [2023-01-28 07:02:22,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:02:22,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:02:22,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2023-01-28 07:02:22,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46608040201005024 [2023-01-28 07:02:22,394 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 371 transitions. [2023-01-28 07:02:22,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 371 transitions. [2023-01-28 07:02:22,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:22,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 371 transitions. [2023-01-28 07:02:22,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:22,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:22,396 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:22,396 INFO L175 Difference]: Start difference. First operand has 70 places, 93 transitions, 1308 flow. Second operand 4 states and 371 transitions. [2023-01-28 07:02:22,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 107 transitions, 1608 flow [2023-01-28 07:02:22,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 107 transitions, 1596 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 07:02:22,427 INFO L231 Difference]: Finished difference. Result has 73 places, 93 transitions, 1350 flow [2023-01-28 07:02:22,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1350, PETRI_PLACES=73, PETRI_TRANSITIONS=93} [2023-01-28 07:02:22,429 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 41 predicate places. [2023-01-28 07:02:22,429 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 93 transitions, 1350 flow [2023-01-28 07:02:22,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:22,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:22,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:22,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 07:02:22,430 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:02:22,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:22,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2054310239, now seen corresponding path program 1 times [2023-01-28 07:02:22,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:22,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862065886] [2023-01-28 07:02:22,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:22,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:02:22,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:22,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862065886] [2023-01-28 07:02:22,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862065886] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:22,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:22,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:02:22,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031815662] [2023-01-28 07:02:22,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:22,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:02:22,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:22,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:02:22,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:02:22,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 199 [2023-01-28 07:02:22,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 93 transitions, 1350 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:22,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:22,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 199 [2023-01-28 07:02:22,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:22,792 INFO L130 PetriNetUnfolder]: 599/1074 cut-off events. [2023-01-28 07:02:22,793 INFO L131 PetriNetUnfolder]: For 13171/13283 co-relation queries the response was YES. [2023-01-28 07:02:22,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6845 conditions, 1074 events. 599/1074 cut-off events. For 13171/13283 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5525 event pairs, 88 based on Foata normal form. 172/1239 useless extension candidates. Maximal degree in co-relation 6806. Up to 458 conditions per place. [2023-01-28 07:02:22,798 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 99 selfloop transitions, 5 changer transitions 7/119 dead transitions. [2023-01-28 07:02:22,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 119 transitions, 1817 flow [2023-01-28 07:02:22,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:02:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:02:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 383 transitions. [2023-01-28 07:02:22,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48115577889447236 [2023-01-28 07:02:22,800 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 383 transitions. [2023-01-28 07:02:22,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 383 transitions. [2023-01-28 07:02:22,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:22,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 383 transitions. [2023-01-28 07:02:22,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:22,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:22,802 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:22,802 INFO L175 Difference]: Start difference. First operand has 73 places, 93 transitions, 1350 flow. Second operand 4 states and 383 transitions. [2023-01-28 07:02:22,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 119 transitions, 1817 flow [2023-01-28 07:02:22,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 119 transitions, 1710 flow, removed 32 selfloop flow, removed 3 redundant places. [2023-01-28 07:02:22,814 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 920 flow [2023-01-28 07:02:22,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=920, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2023-01-28 07:02:22,815 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 43 predicate places. [2023-01-28 07:02:22,815 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 920 flow [2023-01-28 07:02:22,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:22,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:22,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:22,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 07:02:22,815 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:02:22,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:22,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1400353198, now seen corresponding path program 1 times [2023-01-28 07:02:22,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:22,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951711567] [2023-01-28 07:02:22,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:22,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:22,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:02:22,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:22,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951711567] [2023-01-28 07:02:22,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951711567] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:22,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:22,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:02:22,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761149309] [2023-01-28 07:02:22,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:22,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:02:22,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:22,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:02:22,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:02:22,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 199 [2023-01-28 07:02:22,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 920 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:23,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:23,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 199 [2023-01-28 07:02:23,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:23,132 INFO L130 PetriNetUnfolder]: 306/592 cut-off events. [2023-01-28 07:02:23,132 INFO L131 PetriNetUnfolder]: For 7135/7193 co-relation queries the response was YES. [2023-01-28 07:02:23,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3810 conditions, 592 events. 306/592 cut-off events. For 7135/7193 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2717 event pairs, 39 based on Foata normal form. 103/692 useless extension candidates. Maximal degree in co-relation 3769. Up to 238 conditions per place. [2023-01-28 07:02:23,135 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 84 selfloop transitions, 8 changer transitions 8/108 dead transitions. [2023-01-28 07:02:23,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 108 transitions, 1518 flow [2023-01-28 07:02:23,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:02:23,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:02:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2023-01-28 07:02:23,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793969849246231 [2023-01-28 07:02:23,136 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 477 transitions. [2023-01-28 07:02:23,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 477 transitions. [2023-01-28 07:02:23,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:23,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 477 transitions. [2023-01-28 07:02:23,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:23,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:23,138 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:23,139 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 920 flow. Second operand 5 states and 477 transitions. [2023-01-28 07:02:23,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 108 transitions, 1518 flow [2023-01-28 07:02:23,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 108 transitions, 1448 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-01-28 07:02:23,146 INFO L231 Difference]: Finished difference. Result has 78 places, 63 transitions, 774 flow [2023-01-28 07:02:23,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=774, PETRI_PLACES=78, PETRI_TRANSITIONS=63} [2023-01-28 07:02:23,146 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2023-01-28 07:02:23,146 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 63 transitions, 774 flow [2023-01-28 07:02:23,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:23,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:23,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:23,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 07:02:23,147 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:02:23,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:23,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1154380677, now seen corresponding path program 1 times [2023-01-28 07:02:23,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:23,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625874721] [2023-01-28 07:02:23,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:23,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:02:23,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:23,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625874721] [2023-01-28 07:02:23,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625874721] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:23,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:23,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 07:02:23,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416015000] [2023-01-28 07:02:23,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:23,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:02:23,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:23,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:02:23,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:02:23,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 199 [2023-01-28 07:02:23,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 63 transitions, 774 flow. Second operand has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:23,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:23,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 199 [2023-01-28 07:02:23,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:23,437 INFO L130 PetriNetUnfolder]: 188/380 cut-off events. [2023-01-28 07:02:23,437 INFO L131 PetriNetUnfolder]: For 3652/3673 co-relation queries the response was YES. [2023-01-28 07:02:23,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2436 conditions, 380 events. 188/380 cut-off events. For 3652/3673 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1575 event pairs, 33 based on Foata normal form. 27/405 useless extension candidates. Maximal degree in co-relation 2394. Up to 141 conditions per place. [2023-01-28 07:02:23,439 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 41 selfloop transitions, 11 changer transitions 39/95 dead transitions. [2023-01-28 07:02:23,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 95 transitions, 1302 flow [2023-01-28 07:02:23,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:02:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:02:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 554 transitions. [2023-01-28 07:02:23,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4639865996649916 [2023-01-28 07:02:23,441 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 554 transitions. [2023-01-28 07:02:23,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 554 transitions. [2023-01-28 07:02:23,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:23,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 554 transitions. [2023-01-28 07:02:23,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:23,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:23,444 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:23,444 INFO L175 Difference]: Start difference. First operand has 78 places, 63 transitions, 774 flow. Second operand 6 states and 554 transitions. [2023-01-28 07:02:23,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 95 transitions, 1302 flow [2023-01-28 07:02:23,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 95 transitions, 1218 flow, removed 23 selfloop flow, removed 6 redundant places. [2023-01-28 07:02:23,450 INFO L231 Difference]: Finished difference. Result has 79 places, 38 transitions, 398 flow [2023-01-28 07:02:23,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=398, PETRI_PLACES=79, PETRI_TRANSITIONS=38} [2023-01-28 07:02:23,451 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 47 predicate places. [2023-01-28 07:02:23,451 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 38 transitions, 398 flow [2023-01-28 07:02:23,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:23,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:23,452 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] [2023-01-28 07:02:23,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 07:02:23,452 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:02:23,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:23,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1144513876, now seen corresponding path program 1 times [2023-01-28 07:02:23,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:23,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831191135] [2023-01-28 07:02:23,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:23,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:02:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:02:24,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:02:24,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831191135] [2023-01-28 07:02:24,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831191135] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:02:24,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:02:24,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 07:02:24,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055615234] [2023-01-28 07:02:24,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:02:24,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 07:02:24,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:02:24,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 07:02:24,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-28 07:02:24,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 199 [2023-01-28 07:02:24,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 38 transitions, 398 flow. Second operand has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:24,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:02:24,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 199 [2023-01-28 07:02:24,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:02:24,156 INFO L130 PetriNetUnfolder]: 111/223 cut-off events. [2023-01-28 07:02:24,156 INFO L131 PetriNetUnfolder]: For 1392/1392 co-relation queries the response was YES. [2023-01-28 07:02:24,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 223 events. 111/223 cut-off events. For 1392/1392 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 682 event pairs, 17 based on Foata normal form. 1/224 useless extension candidates. Maximal degree in co-relation 1320. Up to 127 conditions per place. [2023-01-28 07:02:24,157 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 33 selfloop transitions, 9 changer transitions 22/65 dead transitions. [2023-01-28 07:02:24,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 65 transitions, 738 flow [2023-01-28 07:02:24,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:02:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:02:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2023-01-28 07:02:24,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45226130653266333 [2023-01-28 07:02:24,159 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 540 transitions. [2023-01-28 07:02:24,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 540 transitions. [2023-01-28 07:02:24,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:02:24,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 540 transitions. [2023-01-28 07:02:24,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:24,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:24,162 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:24,162 INFO L175 Difference]: Start difference. First operand has 79 places, 38 transitions, 398 flow. Second operand 6 states and 540 transitions. [2023-01-28 07:02:24,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 65 transitions, 738 flow [2023-01-28 07:02:24,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 65 transitions, 478 flow, removed 58 selfloop flow, removed 27 redundant places. [2023-01-28 07:02:24,165 INFO L231 Difference]: Finished difference. Result has 55 places, 33 transitions, 220 flow [2023-01-28 07:02:24,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=55, PETRI_TRANSITIONS=33} [2023-01-28 07:02:24,166 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2023-01-28 07:02:24,166 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 33 transitions, 220 flow [2023-01-28 07:02:24,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:02:24,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:02:24,166 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] [2023-01-28 07:02:24,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 07:02:24,167 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:02:24,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:02:24,167 INFO L85 PathProgramCache]: Analyzing trace with hash -795872754, now seen corresponding path program 2 times [2023-01-28 07:02:24,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:02:24,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180375591] [2023-01-28 07:02:24,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:02:24,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:02:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:02:24,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 07:02:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:02:24,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 07:02:24,255 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 07:02:24,256 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 07:02:24,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 07:02:24,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 07:02:24,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 07:02:24,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 07:02:24,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 07:02:24,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-28 07:02:24,258 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:02:24,262 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 07:02:24,262 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 07:02:24,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 07:02:24 BasicIcfg [2023-01-28 07:02:24,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 07:02:24,316 INFO L158 Benchmark]: Toolchain (without parser) took 15643.00ms. Allocated memory was 396.4MB in the beginning and 994.1MB in the end (delta: 597.7MB). Free memory was 360.6MB in the beginning and 451.9MB in the end (delta: -91.3MB). Peak memory consumption was 508.4MB. Max. memory is 16.0GB. [2023-01-28 07:02:24,316 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 255.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 07:02:24,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.52ms. Allocated memory is still 396.4MB. Free memory was 360.6MB in the beginning and 337.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 07:02:24,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.75ms. Allocated memory is still 396.4MB. Free memory was 337.5MB in the beginning and 334.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 07:02:24,316 INFO L158 Benchmark]: Boogie Preprocessor took 38.09ms. Allocated memory is still 396.4MB. Free memory was 334.7MB in the beginning and 333.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 07:02:24,316 INFO L158 Benchmark]: RCFGBuilder took 593.82ms. Allocated memory is still 396.4MB. Free memory was 332.7MB in the beginning and 364.9MB in the end (delta: -32.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-01-28 07:02:24,319 INFO L158 Benchmark]: TraceAbstraction took 14532.54ms. Allocated memory was 396.4MB in the beginning and 994.1MB in the end (delta: 597.7MB). Free memory was 364.9MB in the beginning and 451.9MB in the end (delta: -87.0MB). Peak memory consumption was 510.5MB. Max. memory is 16.0GB. [2023-01-28 07:02:24,320 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.64ms. Allocated memory is still 255.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 417.52ms. Allocated memory is still 396.4MB. Free memory was 360.6MB in the beginning and 337.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.75ms. Allocated memory is still 396.4MB. Free memory was 337.5MB in the beginning and 334.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.09ms. Allocated memory is still 396.4MB. Free memory was 334.7MB in the beginning and 333.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 593.82ms. Allocated memory is still 396.4MB. Free memory was 332.7MB in the beginning and 364.9MB in the end (delta: -32.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 14532.54ms. Allocated memory was 396.4MB in the beginning and 994.1MB in the end (delta: 597.7MB). Free memory was 364.9MB in the beginning and 451.9MB in the end (delta: -87.0MB). Peak memory consumption was 510.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 110 PlacesBefore, 32 PlacesAfterwards, 102 TransitionsBefore, 22 TransitionsAfterwards, 1818 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 94 TotalNumberOfCompositions, 4335 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2253, independent: 2109, independent conditional: 0, independent unconditional: 2109, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1004, independent: 964, independent conditional: 0, independent unconditional: 964, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2253, independent: 1145, independent conditional: 0, independent unconditional: 1145, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 1004, unknown conditional: 0, unknown unconditional: 1004] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2177, ((void *)0), P0, ((void *)0))=-1, t2177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L815] 0 pthread_t t2178; [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2178, ((void *)0), P1, ((void *)0))=0, t2177={5:0}, t2178={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L817] 0 pthread_t t2179; [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2179, ((void *)0), P2, ((void *)0))=1, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] 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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 814]: 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: 816]: 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: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 6 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: 14.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 409 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1117 IncrementalHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 22 mSDtfsCounter, 1117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1350occurred in iteration=12, InterpolantAutomatonStates: 74, 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.3s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 2534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 07:02:24,341 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...