/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/mix035_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:55:21,232 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:55:21,234 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:55:21,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:55:21,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:55:21,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:55:21,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:55:21,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:55:21,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:55:21,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:55:21,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:55:21,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:55:21,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:55:21,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:55:21,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:55:21,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:55:21,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:55:21,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:55:21,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:55:21,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:55:21,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:55:21,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:55:21,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:55:21,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:55:21,311 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:55:21,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:55:21,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:55:21,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:55:21,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:55:21,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:55:21,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:55:21,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:55:21,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:55:21,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:55:21,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:55:21,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:55:21,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:55:21,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:55:21,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:55:21,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:55:21,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:55:21,321 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 06:55:21,351 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:55:21,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:55:21,352 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:55:21,352 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:55:21,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:55:21,353 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:55:21,354 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:55:21,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:55:21,354 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:55:21,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:55:21,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:55:21,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:55:21,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:55:21,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:55:21,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:55:21,355 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:55:21,355 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:55:21,355 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:55:21,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:55:21,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:55:21,356 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:55:21,356 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:55:21,356 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:55:21,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:55:21,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:55:21,357 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:55:21,357 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:55:21,357 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:55:21,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:55:21,357 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:55:21,358 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:55:21,358 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 06:55:21,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:55:21,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:55:21,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:55:21,614 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:55:21,615 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:55:21,616 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2023-01-28 06:55:22,719 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:55:22,941 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:55:22,942 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2023-01-28 06:55:22,971 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7483220b/c2950dec0eeb41c4b64fd9527efad57f/FLAG10ccac331 [2023-01-28 06:55:22,983 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7483220b/c2950dec0eeb41c4b64fd9527efad57f [2023-01-28 06:55:22,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:55:22,986 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:55:22,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:55:22,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:55:22,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:55:22,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:55:22" (1/1) ... [2023-01-28 06:55:22,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ff7bd43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:22, skipping insertion in model container [2023-01-28 06:55:22,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:55:22" (1/1) ... [2023-01-28 06:55:22,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:55:23,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:55:23,158 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/mix035_pso.opt_tso.opt.i[956,969] [2023-01-28 06:55:23,374 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:55:23,386 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:55:23,396 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/mix035_pso.opt_tso.opt.i[956,969] [2023-01-28 06:55:23,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:55:23,510 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:55:23,511 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:55:23,519 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:55:23,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:23 WrapperNode [2023-01-28 06:55:23,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:55:23,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:55:23,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:55:23,533 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:55:23,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:23" (1/1) ... [2023-01-28 06:55:23,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:23" (1/1) ... [2023-01-28 06:55:23,604 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2023-01-28 06:55:23,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:55:23,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:55:23,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:55:23,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:55:23,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:23" (1/1) ... [2023-01-28 06:55:23,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:23" (1/1) ... [2023-01-28 06:55:23,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:23" (1/1) ... [2023-01-28 06:55:23,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:23" (1/1) ... [2023-01-28 06:55:23,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:23" (1/1) ... [2023-01-28 06:55:23,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:23" (1/1) ... [2023-01-28 06:55:23,638 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:23" (1/1) ... [2023-01-28 06:55:23,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:23" (1/1) ... [2023-01-28 06:55:23,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:55:23,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:55:23,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:55:23,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:55:23,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:23" (1/1) ... [2023-01-28 06:55:23,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:55:23,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:55:23,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 06:55:23,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 06:55:23,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:55:23,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:55:23,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:55:23,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:55:23,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:55:23,725 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:55:23,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:55:23,726 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:55:23,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:55:23,726 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:55:23,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:55:23,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:55:23,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:55:23,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:55:23,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:55:23,728 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 06:55:23,912 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:55:23,914 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:55:24,160 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:55:24,305 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:55:24,305 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:55:24,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:55:24 BoogieIcfgContainer [2023-01-28 06:55:24,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:55:24,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:55:24,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:55:24,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:55:24,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:55:22" (1/3) ... [2023-01-28 06:55:24,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352a115c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:55:24, skipping insertion in model container [2023-01-28 06:55:24,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:23" (2/3) ... [2023-01-28 06:55:24,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352a115c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:55:24, skipping insertion in model container [2023-01-28 06:55:24,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:55:24" (3/3) ... [2023-01-28 06:55:24,315 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt_tso.opt.i [2023-01-28 06:55:24,330 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:55:24,330 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:55:24,330 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:55:24,398 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:55:24,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2023-01-28 06:55:24,473 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2023-01-28 06:55:24,473 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:55:24,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-01-28 06:55:24,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2023-01-28 06:55:24,482 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2023-01-28 06:55:24,485 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:55:24,500 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 225 flow [2023-01-28 06:55:24,502 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 225 flow [2023-01-28 06:55:24,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 225 flow [2023-01-28 06:55:24,527 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2023-01-28 06:55:24,527 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:55:24,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-01-28 06:55:24,533 INFO L119 LiptonReduction]: Number of co-enabled transitions 1840 [2023-01-28 06:55:27,705 INFO L134 LiptonReduction]: Checked pairs total: 4131 [2023-01-28 06:55:27,705 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-01-28 06:55:27,716 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:55:27,721 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;@59c91485, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:55:27,721 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 06:55:27,725 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2023-01-28 06:55:27,726 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:55:27,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:27,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:27,727 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:55:27,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:27,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2144081652, now seen corresponding path program 1 times [2023-01-28 06:55:27,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:27,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11670624] [2023-01-28 06:55:27,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:27,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:28,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:28,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:28,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11670624] [2023-01-28 06:55:28,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11670624] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:28,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:28,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:55:28,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986785032] [2023-01-28 06:55:28,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:28,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:55:28,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:28,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:55:28,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:55:28,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 207 [2023-01-28 06:55:28,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:28,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:28,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 207 [2023-01-28 06:55:28,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:28,548 INFO L130 PetriNetUnfolder]: 910/1447 cut-off events. [2023-01-28 06:55:28,548 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2023-01-28 06:55:28,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1447 events. 910/1447 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7089 event pairs, 146 based on Foata normal form. 60/1386 useless extension candidates. Maximal degree in co-relation 2834. Up to 1101 conditions per place. [2023-01-28 06:55:28,561 INFO L137 encePairwiseOnDemand]: 203/207 looper letters, 26 selfloop transitions, 2 changer transitions 4/34 dead transitions. [2023-01-28 06:55:28,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 141 flow [2023-01-28 06:55:28,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:55:28,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:55:28,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-01-28 06:55:28,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.534621578099839 [2023-01-28 06:55:28,573 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-01-28 06:55:28,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-01-28 06:55:28,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:28,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-01-28 06:55:28,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:28,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:28,585 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:28,586 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 332 transitions. [2023-01-28 06:55:28,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 141 flow [2023-01-28 06:55:28,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 06:55:28,590 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-01-28 06:55:28,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-01-28 06:55:28,594 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-28 06:55:28,594 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-01-28 06:55:28,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:28,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:28,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:28,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:55:28,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:55:28,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:28,596 INFO L85 PathProgramCache]: Analyzing trace with hash -415131908, now seen corresponding path program 1 times [2023-01-28 06:55:28,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:28,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435416761] [2023-01-28 06:55:28,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:28,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:28,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:28,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435416761] [2023-01-28 06:55:28,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435416761] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:28,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:28,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:55:28,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44822320] [2023-01-28 06:55:28,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:28,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:55:28,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:28,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:55:28,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:55:28,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 207 [2023-01-28 06:55:28,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:28,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:28,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 207 [2023-01-28 06:55:28,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:29,187 INFO L130 PetriNetUnfolder]: 1167/1768 cut-off events. [2023-01-28 06:55:29,187 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2023-01-28 06:55:29,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3670 conditions, 1768 events. 1167/1768 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7468 event pairs, 459 based on Foata normal form. 96/1864 useless extension candidates. Maximal degree in co-relation 3660. Up to 1461 conditions per place. [2023-01-28 06:55:29,196 INFO L137 encePairwiseOnDemand]: 201/207 looper letters, 29 selfloop transitions, 4 changer transitions 18/51 dead transitions. [2023-01-28 06:55:29,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 51 transitions, 224 flow [2023-01-28 06:55:29,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:55:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:55:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-01-28 06:55:29,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4859903381642512 [2023-01-28 06:55:29,201 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-01-28 06:55:29,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-01-28 06:55:29,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:29,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-01-28 06:55:29,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:29,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:29,208 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:29,208 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 5 states and 503 transitions. [2023-01-28 06:55:29,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 51 transitions, 224 flow [2023-01-28 06:55:29,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 51 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:55:29,222 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 84 flow [2023-01-28 06:55:29,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-01-28 06:55:29,223 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2023-01-28 06:55:29,224 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 84 flow [2023-01-28 06:55:29,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:29,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:29,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:29,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:55:29,226 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:55:29,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:29,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1357417574, now seen corresponding path program 1 times [2023-01-28 06:55:29,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:29,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224152338] [2023-01-28 06:55:29,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:29,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:29,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:29,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:29,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224152338] [2023-01-28 06:55:29,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224152338] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:29,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:29,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:55:29,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314969359] [2023-01-28 06:55:29,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:29,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:55:29,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:29,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:55:29,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:55:29,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 207 [2023-01-28 06:55:29,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:29,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:29,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 207 [2023-01-28 06:55:29,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:29,693 INFO L130 PetriNetUnfolder]: 1027/1556 cut-off events. [2023-01-28 06:55:29,693 INFO L131 PetriNetUnfolder]: For 860/860 co-relation queries the response was YES. [2023-01-28 06:55:29,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3997 conditions, 1556 events. 1027/1556 cut-off events. For 860/860 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6210 event pairs, 295 based on Foata normal form. 72/1628 useless extension candidates. Maximal degree in co-relation 3984. Up to 1025 conditions per place. [2023-01-28 06:55:29,703 INFO L137 encePairwiseOnDemand]: 203/207 looper letters, 29 selfloop transitions, 3 changer transitions 18/50 dead transitions. [2023-01-28 06:55:29,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 266 flow [2023-01-28 06:55:29,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:55:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:55:29,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2023-01-28 06:55:29,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4821256038647343 [2023-01-28 06:55:29,705 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 499 transitions. [2023-01-28 06:55:29,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 499 transitions. [2023-01-28 06:55:29,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:29,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 499 transitions. [2023-01-28 06:55:29,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:29,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:29,709 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:29,709 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 84 flow. Second operand 5 states and 499 transitions. [2023-01-28 06:55:29,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 266 flow [2023-01-28 06:55:29,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 260 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 06:55:29,715 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 93 flow [2023-01-28 06:55:29,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2023-01-28 06:55:29,716 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-01-28 06:55:29,719 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 93 flow [2023-01-28 06:55:29,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:29,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:29,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:29,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:55:29,720 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:55:29,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:29,720 INFO L85 PathProgramCache]: Analyzing trace with hash -996218725, now seen corresponding path program 1 times [2023-01-28 06:55:29,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:29,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121054328] [2023-01-28 06:55:29,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:29,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:29,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:29,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121054328] [2023-01-28 06:55:29,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121054328] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:29,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:29,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:55:29,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253044459] [2023-01-28 06:55:29,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:29,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:55:29,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:29,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:55:29,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:55:29,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 207 [2023-01-28 06:55:29,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:29,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:29,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 207 [2023-01-28 06:55:29,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:30,027 INFO L130 PetriNetUnfolder]: 368/638 cut-off events. [2023-01-28 06:55:30,028 INFO L131 PetriNetUnfolder]: For 412/412 co-relation queries the response was YES. [2023-01-28 06:55:30,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1700 conditions, 638 events. 368/638 cut-off events. For 412/412 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2593 event pairs, 87 based on Foata normal form. 32/668 useless extension candidates. Maximal degree in co-relation 1684. Up to 514 conditions per place. [2023-01-28 06:55:30,032 INFO L137 encePairwiseOnDemand]: 202/207 looper letters, 30 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2023-01-28 06:55:30,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 202 flow [2023-01-28 06:55:30,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:55:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:55:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2023-01-28 06:55:30,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5120772946859904 [2023-01-28 06:55:30,034 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2023-01-28 06:55:30,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2023-01-28 06:55:30,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:30,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2023-01-28 06:55:30,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:30,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:30,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:30,040 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 93 flow. Second operand 3 states and 318 transitions. [2023-01-28 06:55:30,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 202 flow [2023-01-28 06:55:30,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 190 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 06:55:30,042 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 109 flow [2023-01-28 06:55:30,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-01-28 06:55:30,043 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2023-01-28 06:55:30,043 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 109 flow [2023-01-28 06:55:30,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:30,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:30,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:30,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:55:30,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:55:30,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1485294156, now seen corresponding path program 1 times [2023-01-28 06:55:30,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:30,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110471095] [2023-01-28 06:55:30,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:30,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:30,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:30,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110471095] [2023-01-28 06:55:30,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110471095] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:30,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:30,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:55:30,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740794849] [2023-01-28 06:55:30,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:30,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:55:30,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:30,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:55:30,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:55:30,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 207 [2023-01-28 06:55:30,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:30,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:30,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 207 [2023-01-28 06:55:30,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:30,344 INFO L130 PetriNetUnfolder]: 166/328 cut-off events. [2023-01-28 06:55:30,344 INFO L131 PetriNetUnfolder]: For 154/154 co-relation queries the response was YES. [2023-01-28 06:55:30,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 328 events. 166/328 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1191 event pairs, 46 based on Foata normal form. 33/359 useless extension candidates. Maximal degree in co-relation 961. Up to 108 conditions per place. [2023-01-28 06:55:30,346 INFO L137 encePairwiseOnDemand]: 202/207 looper letters, 38 selfloop transitions, 7 changer transitions 0/48 dead transitions. [2023-01-28 06:55:30,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 271 flow [2023-01-28 06:55:30,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:55:30,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:55:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 424 transitions. [2023-01-28 06:55:30,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5120772946859904 [2023-01-28 06:55:30,348 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 424 transitions. [2023-01-28 06:55:30,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 424 transitions. [2023-01-28 06:55:30,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:30,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 424 transitions. [2023-01-28 06:55:30,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:30,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:30,352 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:30,352 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 109 flow. Second operand 4 states and 424 transitions. [2023-01-28 06:55:30,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 271 flow [2023-01-28 06:55:30,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:55:30,355 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 145 flow [2023-01-28 06:55:30,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-01-28 06:55:30,357 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-01-28 06:55:30,357 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 145 flow [2023-01-28 06:55:30,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:30,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:30,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:30,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:55:30,358 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:55:30,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:30,358 INFO L85 PathProgramCache]: Analyzing trace with hash 649913194, now seen corresponding path program 1 times [2023-01-28 06:55:30,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:30,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750848720] [2023-01-28 06:55:30,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:30,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:30,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:30,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750848720] [2023-01-28 06:55:30,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750848720] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:30,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:30,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:55:30,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139396360] [2023-01-28 06:55:30,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:30,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:55:30,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:30,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:55:30,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:55:30,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 207 [2023-01-28 06:55:30,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:30,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:30,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 207 [2023-01-28 06:55:30,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:30,713 INFO L130 PetriNetUnfolder]: 132/258 cut-off events. [2023-01-28 06:55:30,714 INFO L131 PetriNetUnfolder]: For 322/322 co-relation queries the response was YES. [2023-01-28 06:55:30,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 258 events. 132/258 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 910 event pairs, 42 based on Foata normal form. 10/266 useless extension candidates. Maximal degree in co-relation 811. Up to 106 conditions per place. [2023-01-28 06:55:30,716 INFO L137 encePairwiseOnDemand]: 202/207 looper letters, 35 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2023-01-28 06:55:30,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 295 flow [2023-01-28 06:55:30,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:55:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:55:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2023-01-28 06:55:30,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5014492753623189 [2023-01-28 06:55:30,718 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 519 transitions. [2023-01-28 06:55:30,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 519 transitions. [2023-01-28 06:55:30,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:30,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 519 transitions. [2023-01-28 06:55:30,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:30,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:30,721 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:30,721 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 145 flow. Second operand 5 states and 519 transitions. [2023-01-28 06:55:30,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 295 flow [2023-01-28 06:55:30,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 270 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-01-28 06:55:30,724 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 150 flow [2023-01-28 06:55:30,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-01-28 06:55:30,726 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2023-01-28 06:55:30,727 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 150 flow [2023-01-28 06:55:30,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:30,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:30,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:30,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:55:30,727 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:55:30,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:30,728 INFO L85 PathProgramCache]: Analyzing trace with hash 891822790, now seen corresponding path program 1 times [2023-01-28 06:55:30,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:30,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876796946] [2023-01-28 06:55:30,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:30,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:30,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:30,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876796946] [2023-01-28 06:55:30,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876796946] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:30,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:30,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:55:30,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824179221] [2023-01-28 06:55:30,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:30,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:55:30,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:30,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:55:30,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:55:30,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 207 [2023-01-28 06:55:30,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:30,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:30,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 207 [2023-01-28 06:55:30,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:31,115 INFO L130 PetriNetUnfolder]: 184/363 cut-off events. [2023-01-28 06:55:31,115 INFO L131 PetriNetUnfolder]: For 611/611 co-relation queries the response was YES. [2023-01-28 06:55:31,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 363 events. 184/363 cut-off events. For 611/611 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1426 event pairs, 27 based on Foata normal form. 1/364 useless extension candidates. Maximal degree in co-relation 1179. Up to 196 conditions per place. [2023-01-28 06:55:31,117 INFO L137 encePairwiseOnDemand]: 203/207 looper letters, 34 selfloop transitions, 1 changer transitions 25/61 dead transitions. [2023-01-28 06:55:31,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 61 transitions, 432 flow [2023-01-28 06:55:31,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:55:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:55:31,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-01-28 06:55:31,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48985507246376814 [2023-01-28 06:55:31,119 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-01-28 06:55:31,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-01-28 06:55:31,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:31,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-01-28 06:55:31,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:31,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:31,122 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:31,123 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 150 flow. Second operand 5 states and 507 transitions. [2023-01-28 06:55:31,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 61 transitions, 432 flow [2023-01-28 06:55:31,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 61 transitions, 364 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-01-28 06:55:31,125 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 123 flow [2023-01-28 06:55:31,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2023-01-28 06:55:31,126 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-01-28 06:55:31,126 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 123 flow [2023-01-28 06:55:31,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:31,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:31,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:31,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:55:31,127 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:55:31,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:31,127 INFO L85 PathProgramCache]: Analyzing trace with hash -425340124, now seen corresponding path program 2 times [2023-01-28 06:55:31,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:31,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439855896] [2023-01-28 06:55:31,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:31,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:31,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:31,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439855896] [2023-01-28 06:55:31,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439855896] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:31,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:31,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:55:31,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544123496] [2023-01-28 06:55:31,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:31,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:55:31,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:31,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:55:31,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:55:31,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 207 [2023-01-28 06:55:31,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:31,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:31,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 207 [2023-01-28 06:55:31,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:31,486 INFO L130 PetriNetUnfolder]: 151/299 cut-off events. [2023-01-28 06:55:31,486 INFO L131 PetriNetUnfolder]: For 285/285 co-relation queries the response was YES. [2023-01-28 06:55:31,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 299 events. 151/299 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1062 event pairs, 28 based on Foata normal form. 1/300 useless extension candidates. Maximal degree in co-relation 932. Up to 157 conditions per place. [2023-01-28 06:55:31,488 INFO L137 encePairwiseOnDemand]: 200/207 looper letters, 39 selfloop transitions, 7 changer transitions 16/62 dead transitions. [2023-01-28 06:55:31,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 390 flow [2023-01-28 06:55:31,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:55:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:55:31,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions. [2023-01-28 06:55:31,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2023-01-28 06:55:31,490 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 575 transitions. [2023-01-28 06:55:31,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions. [2023-01-28 06:55:31,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:31,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions. [2023-01-28 06:55:31,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:31,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:31,494 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:31,494 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 123 flow. Second operand 6 states and 575 transitions. [2023-01-28 06:55:31,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 390 flow [2023-01-28 06:55:31,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 62 transitions, 380 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-01-28 06:55:31,497 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 154 flow [2023-01-28 06:55:31,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2023-01-28 06:55:31,498 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-01-28 06:55:31,498 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 154 flow [2023-01-28 06:55:31,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:31,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:31,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:31,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:55:31,499 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:55:31,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:31,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1042987598, now seen corresponding path program 3 times [2023-01-28 06:55:31,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:31,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268035584] [2023-01-28 06:55:31,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:31,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:31,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:31,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268035584] [2023-01-28 06:55:31,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268035584] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:31,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:31,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:55:31,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219223727] [2023-01-28 06:55:31,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:31,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:55:31,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:31,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:55:31,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:55:31,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 207 [2023-01-28 06:55:31,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:31,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:31,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 207 [2023-01-28 06:55:31,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:31,798 INFO L130 PetriNetUnfolder]: 108/240 cut-off events. [2023-01-28 06:55:31,798 INFO L131 PetriNetUnfolder]: For 325/325 co-relation queries the response was YES. [2023-01-28 06:55:31,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 240 events. 108/240 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 918 event pairs, 18 based on Foata normal form. 1/239 useless extension candidates. Maximal degree in co-relation 840. Up to 117 conditions per place. [2023-01-28 06:55:31,800 INFO L137 encePairwiseOnDemand]: 203/207 looper letters, 30 selfloop transitions, 1 changer transitions 21/53 dead transitions. [2023-01-28 06:55:31,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 360 flow [2023-01-28 06:55:31,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:55:31,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:55:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-01-28 06:55:31,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4859903381642512 [2023-01-28 06:55:31,801 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-01-28 06:55:31,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-01-28 06:55:31,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:31,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-01-28 06:55:31,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:31,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:31,805 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:31,805 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 154 flow. Second operand 5 states and 503 transitions. [2023-01-28 06:55:31,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 360 flow [2023-01-28 06:55:31,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 355 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 06:55:31,807 INFO L231 Difference]: Finished difference. Result has 49 places, 27 transitions, 127 flow [2023-01-28 06:55:31,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=49, PETRI_TRANSITIONS=27} [2023-01-28 06:55:31,808 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-01-28 06:55:31,808 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 27 transitions, 127 flow [2023-01-28 06:55:31,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:31,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:31,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:31,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:55:31,809 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:55:31,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:31,809 INFO L85 PathProgramCache]: Analyzing trace with hash -119133906, now seen corresponding path program 4 times [2023-01-28 06:55:31,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:31,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291017778] [2023-01-28 06:55:31,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:31,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:32,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:32,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291017778] [2023-01-28 06:55:32,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291017778] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:32,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:32,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:55:32,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924596566] [2023-01-28 06:55:32,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:32,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:55:32,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:32,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:55:32,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:55:32,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 207 [2023-01-28 06:55:32,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 27 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:32,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:32,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 207 [2023-01-28 06:55:32,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:32,361 INFO L130 PetriNetUnfolder]: 71/171 cut-off events. [2023-01-28 06:55:32,362 INFO L131 PetriNetUnfolder]: For 261/261 co-relation queries the response was YES. [2023-01-28 06:55:32,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 171 events. 71/171 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 565 event pairs, 12 based on Foata normal form. 1/172 useless extension candidates. Maximal degree in co-relation 598. Up to 63 conditions per place. [2023-01-28 06:55:32,363 INFO L137 encePairwiseOnDemand]: 199/207 looper letters, 24 selfloop transitions, 4 changer transitions 26/54 dead transitions. [2023-01-28 06:55:32,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 54 transitions, 374 flow [2023-01-28 06:55:32,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:55:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:55:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 729 transitions. [2023-01-28 06:55:32,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44021739130434784 [2023-01-28 06:55:32,366 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 729 transitions. [2023-01-28 06:55:32,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 729 transitions. [2023-01-28 06:55:32,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:32,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 729 transitions. [2023-01-28 06:55:32,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:32,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:32,372 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:32,372 INFO L175 Difference]: Start difference. First operand has 49 places, 27 transitions, 127 flow. Second operand 8 states and 729 transitions. [2023-01-28 06:55:32,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 54 transitions, 374 flow [2023-01-28 06:55:32,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 352 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-01-28 06:55:32,375 INFO L231 Difference]: Finished difference. Result has 52 places, 27 transitions, 134 flow [2023-01-28 06:55:32,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=134, PETRI_PLACES=52, PETRI_TRANSITIONS=27} [2023-01-28 06:55:32,377 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2023-01-28 06:55:32,377 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 27 transitions, 134 flow [2023-01-28 06:55:32,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:32,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:32,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:32,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:55:32,378 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:55:32,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:32,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1037369380, now seen corresponding path program 5 times [2023-01-28 06:55:32,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:32,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066180611] [2023-01-28 06:55:32,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:32,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:55:32,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:55:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:55:32,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:55:32,493 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:55:32,494 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 06:55:32,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 06:55:32,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 06:55:32,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 06:55:32,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 06:55:32,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 06:55:32,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:55:32,496 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:32,501 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:55:32,501 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:55:32,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:55:32 BasicIcfg [2023-01-28 06:55:32,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:55:32,548 INFO L158 Benchmark]: Toolchain (without parser) took 9562.22ms. Allocated memory was 346.0MB in the beginning and 499.1MB in the end (delta: 153.1MB). Free memory was 289.9MB in the beginning and 404.2MB in the end (delta: -114.3MB). Peak memory consumption was 40.4MB. Max. memory is 16.0GB. [2023-01-28 06:55:32,549 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 214.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:55:32,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.75ms. Allocated memory is still 346.0MB. Free memory was 289.7MB in the beginning and 319.1MB in the end (delta: -29.4MB). Peak memory consumption was 27.2MB. Max. memory is 16.0GB. [2023-01-28 06:55:32,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.34ms. Allocated memory is still 346.0MB. Free memory was 319.1MB in the beginning and 317.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:55:32,549 INFO L158 Benchmark]: Boogie Preprocessor took 52.99ms. Allocated memory is still 346.0MB. Free memory was 317.0MB in the beginning and 314.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:55:32,550 INFO L158 Benchmark]: RCFGBuilder took 648.59ms. Allocated memory is still 346.0MB. Free memory was 314.9MB in the beginning and 282.8MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-01-28 06:55:32,550 INFO L158 Benchmark]: TraceAbstraction took 8238.93ms. Allocated memory was 346.0MB in the beginning and 499.1MB in the end (delta: 153.1MB). Free memory was 282.1MB in the beginning and 404.2MB in the end (delta: -122.1MB). Peak memory consumption was 32.0MB. Max. memory is 16.0GB. [2023-01-28 06:55:32,551 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 214.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 544.75ms. Allocated memory is still 346.0MB. Free memory was 289.7MB in the beginning and 319.1MB in the end (delta: -29.4MB). Peak memory consumption was 27.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 71.34ms. Allocated memory is still 346.0MB. Free memory was 319.1MB in the beginning and 317.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 52.99ms. Allocated memory is still 346.0MB. Free memory was 317.0MB in the beginning and 314.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 648.59ms. Allocated memory is still 346.0MB. Free memory was 314.9MB in the beginning and 282.8MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 8238.93ms. Allocated memory was 346.0MB in the beginning and 499.1MB in the end (delta: 153.1MB). Free memory was 282.1MB in the beginning and 404.2MB in the end (delta: -122.1MB). Peak memory consumption was 32.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 116 PlacesBefore, 34 PlacesAfterwards, 108 TransitionsBefore, 25 TransitionsAfterwards, 1840 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 4131 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2390, independent: 2248, independent conditional: 0, independent unconditional: 2248, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1009, independent: 982, independent conditional: 0, independent unconditional: 982, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2390, independent: 1266, independent conditional: 0, independent unconditional: 1266, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 1009, unknown conditional: 0, unknown unconditional: 1009] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t922; [L836] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t922, ((void *)0), P0, ((void *)0))=-1, t922={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, z=0] [L837] 0 pthread_t t923; [L838] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t923, ((void *)0), P1, ((void *)0))=0, t922={5:0}, t923={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, z=0] [L839] 0 pthread_t t924; [L840] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t924, ((void *)0), P2, ((void *)0))=1, t922={5:0}, t923={6:0}, t924={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, z=0] [L792] 3 y$w_buff1 = y$w_buff0 [L793] 3 y$w_buff0 = 1 [L794] 3 y$w_buff1_used = y$w_buff0_used [L795] 3 y$w_buff0_used = (_Bool)1 [L796] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L796] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L797] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L798] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L799] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L800] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L804] 3 z = 1 [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 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) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 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 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 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) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 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 [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L853] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 836]: 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: 840]: 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, 138 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: 8.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 767 IncrementalHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 15 mSDtfsCounter, 767 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=8, InterpolantAutomatonStates: 49, 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, 2.2s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 711 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 06:55:32,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...