/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/mix015.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:50:12,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:50:12,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:50:12,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:50:12,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:50:12,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:50:12,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:50:12,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:50:12,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:50:12,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:50:12,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:50:12,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:50:12,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:50:12,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:50:12,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:50:12,529 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:50:12,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:50:12,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:50:12,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:50:12,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:50:12,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:50:12,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:50:12,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:50:12,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:50:12,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:50:12,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:50:12,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:50:12,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:50:12,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:50:12,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:50:12,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:50:12,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:50:12,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:50:12,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:50:12,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:50:12,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:50:12,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:50:12,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:50:12,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:50:12,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:50:12,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:50:12,545 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:50:12,558 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:50:12,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:50:12,558 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:50:12,558 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:50:12,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:50:12,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:50:12,559 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:50:12,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:50:12,559 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:50:12,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:50:12,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:50:12,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:50:12,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:50:12,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:50:12,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:50:12,560 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:50:12,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:50:12,560 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:50:12,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:50:12,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:50:12,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:50:12,560 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:50:12,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:50:12,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:50:12,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:50:12,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:50:12,561 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:50:12,561 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:50:12,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:50:12,561 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:50:12,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:50:12,561 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:50:12,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:50:12,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:50:12,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:50:12,703 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:50:12,704 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:50:12,705 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2023-01-28 06:50:13,769 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:50:13,949 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:50:13,949 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2023-01-28 06:50:13,974 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8859e8e9f/5d285151c32e4aeeadbfb978d9e3be2f/FLAG79bb62f86 [2023-01-28 06:50:13,986 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8859e8e9f/5d285151c32e4aeeadbfb978d9e3be2f [2023-01-28 06:50:13,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:50:13,990 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:50:13,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:50:13,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:50:13,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:50:13,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:50:13" (1/1) ... [2023-01-28 06:50:13,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eeb671f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:13, skipping insertion in model container [2023-01-28 06:50:13,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:50:13" (1/1) ... [2023-01-28 06:50:14,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:50:14,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:50:14,138 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/mix015.oepc.i[945,958] [2023-01-28 06:50:14,302 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:50:14,314 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:50:14,322 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/mix015.oepc.i[945,958] [2023-01-28 06:50:14,370 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:50:14,396 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:50:14,397 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:50:14,401 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:50:14,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14 WrapperNode [2023-01-28 06:50:14,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:50:14,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:50:14,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:50:14,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:50:14,407 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:50:14" (1/1) ... [2023-01-28 06:50:14,418 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:50:14" (1/1) ... [2023-01-28 06:50:14,440 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2023-01-28 06:50:14,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:50:14,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:50:14,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:50:14,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:50:14,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,465 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:50:14,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:50:14,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:50:14,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:50:14,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:50:14,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:50:14,491 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:50:14,497 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:50:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:50:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:50:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:50:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:50:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:50:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:50:14,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:50:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:50:14,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:50:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:50:14,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:50:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:50:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:50:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:50:14,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:50:14,529 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:50:14,613 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:50:14,615 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:50:14,847 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:50:14,940 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:50:14,940 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:50:14,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:50:14 BoogieIcfgContainer [2023-01-28 06:50:14,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:50:14,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:50:14,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:50:14,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:50:14,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:50:13" (1/3) ... [2023-01-28 06:50:14,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:50:14, skipping insertion in model container [2023-01-28 06:50:14,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (2/3) ... [2023-01-28 06:50:14,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:50:14, skipping insertion in model container [2023-01-28 06:50:14,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:50:14" (3/3) ... [2023-01-28 06:50:14,947 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.oepc.i [2023-01-28 06:50:14,957 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:50:14,957 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:50:14,957 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:50:14,991 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:50:15,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2023-01-28 06:50:15,058 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-01-28 06:50:15,058 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:50:15,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-01-28 06:50:15,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2023-01-28 06:50:15,070 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2023-01-28 06:50:15,073 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:50:15,079 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2023-01-28 06:50:15,081 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2023-01-28 06:50:15,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2023-01-28 06:50:15,098 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-01-28 06:50:15,098 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:50:15,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-01-28 06:50:15,100 INFO L119 LiptonReduction]: Number of co-enabled transitions 2240 [2023-01-28 06:50:17,961 INFO L134 LiptonReduction]: Checked pairs total: 6801 [2023-01-28 06:50:17,961 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-01-28 06:50:17,971 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:50:17,975 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;@451e23db, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:50:17,975 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 06:50:17,977 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 06:50:17,977 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:50:17,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:17,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 06:50:17,978 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:50:17,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:17,981 INFO L85 PathProgramCache]: Analyzing trace with hash 491380, now seen corresponding path program 1 times [2023-01-28 06:50:17,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:17,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068649916] [2023-01-28 06:50:17,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:17,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:50:18,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:18,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068649916] [2023-01-28 06:50:18,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068649916] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:18,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:18,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:50:18,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798042055] [2023-01-28 06:50:18,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:18,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:50:18,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:18,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:50:18,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:50:18,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 212 [2023-01-28 06:50:18,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:18,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:18,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 212 [2023-01-28 06:50:18,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:18,577 INFO L130 PetriNetUnfolder]: 1616/2527 cut-off events. [2023-01-28 06:50:18,577 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-01-28 06:50:18,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4951 conditions, 2527 events. 1616/2527 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14075 event pairs, 204 based on Foata normal form. 100/2420 useless extension candidates. Maximal degree in co-relation 4940. Up to 2013 conditions per place. [2023-01-28 06:50:18,592 INFO L137 encePairwiseOnDemand]: 208/212 looper letters, 34 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2023-01-28 06:50:18,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 181 flow [2023-01-28 06:50:18,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:50:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:50:18,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-01-28 06:50:18,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5440251572327044 [2023-01-28 06:50:18,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-01-28 06:50:18,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-01-28 06:50:18,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:18,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-01-28 06:50:18,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states 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:50:18,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:18,611 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:18,612 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 346 transitions. [2023-01-28 06:50:18,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 181 flow [2023-01-28 06:50:18,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 06:50:18,615 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2023-01-28 06:50:18,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-01-28 06:50:18,619 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2023-01-28 06:50:18,619 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2023-01-28 06:50:18,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:18,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:18,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:18,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:50:18,620 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:50:18,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:18,620 INFO L85 PathProgramCache]: Analyzing trace with hash -585120088, now seen corresponding path program 1 times [2023-01-28 06:50:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:18,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328571532] [2023-01-28 06:50:18,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:18,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:18,831 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:50:18,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:18,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328571532] [2023-01-28 06:50:18,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328571532] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:18,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:18,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:50:18,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045690864] [2023-01-28 06:50:18,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:18,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:50:18,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:18,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:50:18,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:50:18,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2023-01-28 06:50:18,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 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:50:18,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:18,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2023-01-28 06:50:18,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:19,129 INFO L130 PetriNetUnfolder]: 2373/3510 cut-off events. [2023-01-28 06:50:19,129 INFO L131 PetriNetUnfolder]: For 183/183 co-relation queries the response was YES. [2023-01-28 06:50:19,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7282 conditions, 3510 events. 2373/3510 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 15994 event pairs, 1229 based on Foata normal form. 180/3690 useless extension candidates. Maximal degree in co-relation 7272. Up to 2983 conditions per place. [2023-01-28 06:50:19,140 INFO L137 encePairwiseOnDemand]: 206/212 looper letters, 32 selfloop transitions, 4 changer transitions 21/57 dead transitions. [2023-01-28 06:50:19,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 57 transitions, 248 flow [2023-01-28 06:50:19,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:50:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:50:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-01-28 06:50:19,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.480188679245283 [2023-01-28 06:50:19,143 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-01-28 06:50:19,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-01-28 06:50:19,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:19,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-01-28 06:50:19,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states 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:50:19,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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:50:19,147 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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:50:19,147 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 509 transitions. [2023-01-28 06:50:19,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 57 transitions, 248 flow [2023-01-28 06:50:19,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 57 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:50:19,148 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 90 flow [2023-01-28 06:50:19,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, 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=5, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2023-01-28 06:50:19,149 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2023-01-28 06:50:19,149 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 90 flow [2023-01-28 06:50:19,149 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:50:19,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:19,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:19,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:50:19,150 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:50:19,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:19,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1128493786, now seen corresponding path program 1 times [2023-01-28 06:50:19,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:19,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962868717] [2023-01-28 06:50:19,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:19,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:50:19,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:19,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962868717] [2023-01-28 06:50:19,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962868717] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:19,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:19,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:50:19,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187574336] [2023-01-28 06:50:19,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:19,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:50:19,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:19,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:50:19,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:50:19,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2023-01-28 06:50:19,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 90 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:50:19,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:19,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2023-01-28 06:50:19,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:19,658 INFO L130 PetriNetUnfolder]: 2105/3114 cut-off events. [2023-01-28 06:50:19,658 INFO L131 PetriNetUnfolder]: For 1470/1470 co-relation queries the response was YES. [2023-01-28 06:50:19,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7657 conditions, 3114 events. 2105/3114 cut-off events. For 1470/1470 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13637 event pairs, 589 based on Foata normal form. 156/3270 useless extension candidates. Maximal degree in co-relation 7644. Up to 2001 conditions per place. [2023-01-28 06:50:19,670 INFO L137 encePairwiseOnDemand]: 208/212 looper letters, 35 selfloop transitions, 3 changer transitions 24/62 dead transitions. [2023-01-28 06:50:19,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 62 transitions, 314 flow [2023-01-28 06:50:19,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:50:19,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:50:19,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2023-01-28 06:50:19,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4820754716981132 [2023-01-28 06:50:19,672 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 511 transitions. [2023-01-28 06:50:19,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 511 transitions. [2023-01-28 06:50:19,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:19,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 511 transitions. [2023-01-28 06:50:19,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states 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:50:19,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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:50:19,675 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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:50:19,675 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 90 flow. Second operand 5 states and 511 transitions. [2023-01-28 06:50:19,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 62 transitions, 314 flow [2023-01-28 06:50:19,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 62 transitions, 308 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 06:50:19,684 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 99 flow [2023-01-28 06:50:19,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-01-28 06:50:19,685 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2023-01-28 06:50:19,687 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 99 flow [2023-01-28 06:50:19,688 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:50:19,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:19,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:19,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:50:19,688 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:50:19,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:19,690 INFO L85 PathProgramCache]: Analyzing trace with hash 414373183, now seen corresponding path program 1 times [2023-01-28 06:50:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:19,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548068472] [2023-01-28 06:50:19,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:19,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:19,886 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:50:19,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:19,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548068472] [2023-01-28 06:50:19,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548068472] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:19,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:19,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:50:19,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844585835] [2023-01-28 06:50:19,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:19,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:50:19,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:19,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:50:19,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:50:19,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2023-01-28 06:50:19,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 99 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:50:19,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:19,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2023-01-28 06:50:19,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:20,302 INFO L130 PetriNetUnfolder]: 1835/2728 cut-off events. [2023-01-28 06:50:20,303 INFO L131 PetriNetUnfolder]: For 2087/2087 co-relation queries the response was YES. [2023-01-28 06:50:20,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6930 conditions, 2728 events. 1835/2728 cut-off events. For 2087/2087 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 11736 event pairs, 1061 based on Foata normal form. 120/2848 useless extension candidates. Maximal degree in co-relation 6914. Up to 1845 conditions per place. [2023-01-28 06:50:20,313 INFO L137 encePairwiseOnDemand]: 208/212 looper letters, 39 selfloop transitions, 3 changer transitions 20/62 dead transitions. [2023-01-28 06:50:20,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 62 transitions, 324 flow [2023-01-28 06:50:20,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:50:20,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:50:20,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2023-01-28 06:50:20,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4820754716981132 [2023-01-28 06:50:20,315 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 511 transitions. [2023-01-28 06:50:20,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 511 transitions. [2023-01-28 06:50:20,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:20,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 511 transitions. [2023-01-28 06:50:20,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states 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:50:20,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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:50:20,323 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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:50:20,324 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 99 flow. Second operand 5 states and 511 transitions. [2023-01-28 06:50:20,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 62 transitions, 324 flow [2023-01-28 06:50:20,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 62 transitions, 312 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 06:50:20,330 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 104 flow [2023-01-28 06:50:20,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2023-01-28 06:50:20,331 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2023-01-28 06:50:20,331 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 104 flow [2023-01-28 06:50:20,332 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:50:20,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:20,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:20,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:50:20,332 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:50:20,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:20,333 INFO L85 PathProgramCache]: Analyzing trace with hash 116505641, now seen corresponding path program 1 times [2023-01-28 06:50:20,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:20,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267211439] [2023-01-28 06:50:20,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:20,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:20,475 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:50:20,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:20,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267211439] [2023-01-28 06:50:20,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267211439] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:20,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:20,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:50:20,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580932017] [2023-01-28 06:50:20,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:20,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:50:20,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:20,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:50:20,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:50:20,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 212 [2023-01-28 06:50:20,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 104 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:50:20,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:20,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 212 [2023-01-28 06:50:20,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:20,581 INFO L130 PetriNetUnfolder]: 599/1007 cut-off events. [2023-01-28 06:50:20,581 INFO L131 PetriNetUnfolder]: For 662/673 co-relation queries the response was YES. [2023-01-28 06:50:20,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2595 conditions, 1007 events. 599/1007 cut-off events. For 662/673 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4599 event pairs, 164 based on Foata normal form. 62/1049 useless extension candidates. Maximal degree in co-relation 2578. Up to 747 conditions per place. [2023-01-28 06:50:20,585 INFO L137 encePairwiseOnDemand]: 207/212 looper letters, 33 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-01-28 06:50:20,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 219 flow [2023-01-28 06:50:20,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:50:20,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:50:20,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-01-28 06:50:20,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157232704402516 [2023-01-28 06:50:20,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-01-28 06:50:20,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-01-28 06:50:20,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:20,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-01-28 06:50:20,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:20,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:20,588 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:20,588 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 104 flow. Second operand 3 states and 328 transitions. [2023-01-28 06:50:20,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 219 flow [2023-01-28 06:50:20,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 207 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 06:50:20,590 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 120 flow [2023-01-28 06:50:20,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2023-01-28 06:50:20,590 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2023-01-28 06:50:20,590 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 120 flow [2023-01-28 06:50:20,591 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:50:20,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:20,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:20,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:50:20,591 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:50:20,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:20,591 INFO L85 PathProgramCache]: Analyzing trace with hash 308684934, now seen corresponding path program 1 times [2023-01-28 06:50:20,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:20,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85731631] [2023-01-28 06:50:20,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:20,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:20,714 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:50:20,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:20,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85731631] [2023-01-28 06:50:20,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85731631] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:20,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:20,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:50:20,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227902084] [2023-01-28 06:50:20,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:20,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:50:20,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:20,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:50:20,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:50:20,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 212 [2023-01-28 06:50:20,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states 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:50:20,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:20,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 212 [2023-01-28 06:50:20,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:20,807 INFO L130 PetriNetUnfolder]: 299/553 cut-off events. [2023-01-28 06:50:20,807 INFO L131 PetriNetUnfolder]: For 208/212 co-relation queries the response was YES. [2023-01-28 06:50:20,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1565 conditions, 553 events. 299/553 cut-off events. For 208/212 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2339 event pairs, 106 based on Foata normal form. 51/594 useless extension candidates. Maximal degree in co-relation 1549. Up to 218 conditions per place. [2023-01-28 06:50:20,809 INFO L137 encePairwiseOnDemand]: 207/212 looper letters, 43 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2023-01-28 06:50:20,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 292 flow [2023-01-28 06:50:20,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:50:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:50:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions. [2023-01-28 06:50:20,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5165094339622641 [2023-01-28 06:50:20,811 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 438 transitions. [2023-01-28 06:50:20,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 438 transitions. [2023-01-28 06:50:20,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:20,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 438 transitions. [2023-01-28 06:50:20,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states 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:50:20,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:50:20,813 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:50:20,813 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 120 flow. Second operand 4 states and 438 transitions. [2023-01-28 06:50:20,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 292 flow [2023-01-28 06:50:20,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:50:20,814 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 156 flow [2023-01-28 06:50:20,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-01-28 06:50:20,815 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2023-01-28 06:50:20,815 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 156 flow [2023-01-28 06:50:20,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states 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:50:20,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:20,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:20,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:50:20,816 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:50:20,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:20,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1803191772, now seen corresponding path program 1 times [2023-01-28 06:50:20,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:20,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838078826] [2023-01-28 06:50:20,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:20,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:21,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:50:21,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:21,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838078826] [2023-01-28 06:50:21,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838078826] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:21,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:21,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:50:21,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385834338] [2023-01-28 06:50:21,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:21,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:50:21,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:21,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:50:21,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:50:21,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 212 [2023-01-28 06:50:21,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states 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:50:21,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:21,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 212 [2023-01-28 06:50:21,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:21,463 INFO L130 PetriNetUnfolder]: 453/897 cut-off events. [2023-01-28 06:50:21,463 INFO L131 PetriNetUnfolder]: For 923/933 co-relation queries the response was YES. [2023-01-28 06:50:21,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2751 conditions, 897 events. 453/897 cut-off events. For 923/933 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4616 event pairs, 104 based on Foata normal form. 13/902 useless extension candidates. Maximal degree in co-relation 2733. Up to 412 conditions per place. [2023-01-28 06:50:21,467 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 68 selfloop transitions, 11 changer transitions 20/104 dead transitions. [2023-01-28 06:50:21,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 104 transitions, 683 flow [2023-01-28 06:50:21,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:50:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:50:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 735 transitions. [2023-01-28 06:50:21,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49528301886792453 [2023-01-28 06:50:21,469 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 735 transitions. [2023-01-28 06:50:21,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 735 transitions. [2023-01-28 06:50:21,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:21,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 735 transitions. [2023-01-28 06:50:21,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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:50:21,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states 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:50:21,473 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states 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:50:21,473 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 156 flow. Second operand 7 states and 735 transitions. [2023-01-28 06:50:21,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 104 transitions, 683 flow [2023-01-28 06:50:21,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 104 transitions, 629 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-01-28 06:50:21,476 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 216 flow [2023-01-28 06:50:21,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-01-28 06:50:21,477 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2023-01-28 06:50:21,477 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 216 flow [2023-01-28 06:50:21,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states 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:50:21,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:21,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:21,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:50:21,478 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:50:21,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:21,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1854376428, now seen corresponding path program 2 times [2023-01-28 06:50:21,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:21,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177825246] [2023-01-28 06:50:21,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:21,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:21,770 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:50:21,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:21,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177825246] [2023-01-28 06:50:21,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177825246] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:21,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:21,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:50:21,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876878931] [2023-01-28 06:50:21,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:21,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:50:21,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:21,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:50:21,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:50:21,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 212 [2023-01-28 06:50:21,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 216 flow. Second operand has 5 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:50:21,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:21,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 212 [2023-01-28 06:50:21,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:21,878 INFO L130 PetriNetUnfolder]: 380/727 cut-off events. [2023-01-28 06:50:21,879 INFO L131 PetriNetUnfolder]: For 828/832 co-relation queries the response was YES. [2023-01-28 06:50:21,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2480 conditions, 727 events. 380/727 cut-off events. For 828/832 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3584 event pairs, 95 based on Foata normal form. 31/749 useless extension candidates. Maximal degree in co-relation 2462. Up to 285 conditions per place. [2023-01-28 06:50:21,882 INFO L137 encePairwiseOnDemand]: 207/212 looper letters, 56 selfloop transitions, 10 changer transitions 6/77 dead transitions. [2023-01-28 06:50:21,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 77 transitions, 508 flow [2023-01-28 06:50:21,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:50:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:50:21,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2023-01-28 06:50:21,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047169811320755 [2023-01-28 06:50:21,884 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 535 transitions. [2023-01-28 06:50:21,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 535 transitions. [2023-01-28 06:50:21,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:21,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 535 transitions. [2023-01-28 06:50:21,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states 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:50:21,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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:50:21,886 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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:50:21,886 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 216 flow. Second operand 5 states and 535 transitions. [2023-01-28 06:50:21,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 77 transitions, 508 flow [2023-01-28 06:50:21,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 480 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-01-28 06:50:21,889 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 207 flow [2023-01-28 06:50:21,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-01-28 06:50:21,889 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2023-01-28 06:50:21,889 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 207 flow [2023-01-28 06:50:21,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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:50:21,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:21,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:21,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:50:21,890 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:50:21,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:21,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1224664419, now seen corresponding path program 1 times [2023-01-28 06:50:21,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:21,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951618447] [2023-01-28 06:50:21,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:21,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:22,350 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:50:22,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:22,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951618447] [2023-01-28 06:50:22,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951618447] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:22,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:22,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-28 06:50:22,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47127897] [2023-01-28 06:50:22,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:22,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 06:50:22,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:22,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 06:50:22,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-01-28 06:50:22,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 212 [2023-01-28 06:50:22,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 207 flow. Second operand has 10 states, 10 states have (on average 87.4) internal successors, (874), 10 states have internal predecessors, (874), 0 states have call successors, (0), 0 states 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:50:22,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:22,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 212 [2023-01-28 06:50:22,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:22,727 INFO L130 PetriNetUnfolder]: 681/1227 cut-off events. [2023-01-28 06:50:22,727 INFO L131 PetriNetUnfolder]: For 2116/2116 co-relation queries the response was YES. [2023-01-28 06:50:22,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4469 conditions, 1227 events. 681/1227 cut-off events. For 2116/2116 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6097 event pairs, 87 based on Foata normal form. 1/1228 useless extension candidates. Maximal degree in co-relation 4448. Up to 397 conditions per place. [2023-01-28 06:50:22,732 INFO L137 encePairwiseOnDemand]: 201/212 looper letters, 111 selfloop transitions, 28 changer transitions 9/148 dead transitions. [2023-01-28 06:50:22,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 148 transitions, 1090 flow [2023-01-28 06:50:22,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 06:50:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 06:50:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1127 transitions. [2023-01-28 06:50:22,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4430031446540881 [2023-01-28 06:50:22,735 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1127 transitions. [2023-01-28 06:50:22,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1127 transitions. [2023-01-28 06:50:22,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:22,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1127 transitions. [2023-01-28 06:50:22,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 93.91666666666667) internal successors, (1127), 12 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states 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:50:22,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 212.0) internal successors, (2756), 13 states have internal predecessors, (2756), 0 states have call successors, (0), 0 states 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:50:22,740 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 212.0) internal successors, (2756), 13 states have internal predecessors, (2756), 0 states have call successors, (0), 0 states 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:50:22,740 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 207 flow. Second operand 12 states and 1127 transitions. [2023-01-28 06:50:22,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 148 transitions, 1090 flow [2023-01-28 06:50:22,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 148 transitions, 940 flow, removed 41 selfloop flow, removed 5 redundant places. [2023-01-28 06:50:22,747 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 381 flow [2023-01-28 06:50:22,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=381, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2023-01-28 06:50:22,748 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2023-01-28 06:50:22,748 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 381 flow [2023-01-28 06:50:22,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.4) internal successors, (874), 10 states have internal predecessors, (874), 0 states have call successors, (0), 0 states 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:50:22,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:22,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:22,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:50:22,748 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:50:22,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:22,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1258688055, now seen corresponding path program 2 times [2023-01-28 06:50:22,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:22,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594265990] [2023-01-28 06:50:22,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:22,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:22,965 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:50:22,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:22,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594265990] [2023-01-28 06:50:22,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594265990] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:22,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:22,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:50:22,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567531601] [2023-01-28 06:50:22,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:22,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:50:22,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:22,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:50:22,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:50:22,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 212 [2023-01-28 06:50:22,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states 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:50:22,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:22,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 212 [2023-01-28 06:50:22,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:23,205 INFO L130 PetriNetUnfolder]: 871/1589 cut-off events. [2023-01-28 06:50:23,206 INFO L131 PetriNetUnfolder]: For 3394/3394 co-relation queries the response was YES. [2023-01-28 06:50:23,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6411 conditions, 1589 events. 871/1589 cut-off events. For 3394/3394 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8502 event pairs, 144 based on Foata normal form. 2/1591 useless extension candidates. Maximal degree in co-relation 6384. Up to 719 conditions per place. [2023-01-28 06:50:23,216 INFO L137 encePairwiseOnDemand]: 205/212 looper letters, 56 selfloop transitions, 6 changer transitions 49/111 dead transitions. [2023-01-28 06:50:23,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 111 transitions, 889 flow [2023-01-28 06:50:23,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:50:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:50:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 678 transitions. [2023-01-28 06:50:23,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4568733153638814 [2023-01-28 06:50:23,218 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 678 transitions. [2023-01-28 06:50:23,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 678 transitions. [2023-01-28 06:50:23,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:23,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 678 transitions. [2023-01-28 06:50:23,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states 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:50:23,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states 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:50:23,221 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states 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:50:23,221 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 381 flow. Second operand 7 states and 678 transitions. [2023-01-28 06:50:23,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 111 transitions, 889 flow [2023-01-28 06:50:23,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 111 transitions, 884 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 06:50:23,231 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 291 flow [2023-01-28 06:50:23,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=291, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2023-01-28 06:50:23,232 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 32 predicate places. [2023-01-28 06:50:23,232 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 46 transitions, 291 flow [2023-01-28 06:50:23,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states 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:50:23,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:23,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:23,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:50:23,233 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:50:23,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:23,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1243169375, now seen corresponding path program 3 times [2023-01-28 06:50:23,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:23,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369546542] [2023-01-28 06:50:23,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:23,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:50:23,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:23,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369546542] [2023-01-28 06:50:23,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369546542] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:23,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:23,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:50:23,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356426236] [2023-01-28 06:50:23,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:23,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:50:23,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:23,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:50:23,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:50:23,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 212 [2023-01-28 06:50:23,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 46 transitions, 291 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:23,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:23,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 212 [2023-01-28 06:50:23,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:23,573 INFO L130 PetriNetUnfolder]: 499/1014 cut-off events. [2023-01-28 06:50:23,573 INFO L131 PetriNetUnfolder]: For 2419/2438 co-relation queries the response was YES. [2023-01-28 06:50:23,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4073 conditions, 1014 events. 499/1014 cut-off events. For 2419/2438 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5502 event pairs, 129 based on Foata normal form. 3/1014 useless extension candidates. Maximal degree in co-relation 4044. Up to 492 conditions per place. [2023-01-28 06:50:23,576 INFO L137 encePairwiseOnDemand]: 208/212 looper letters, 38 selfloop transitions, 1 changer transitions 48/89 dead transitions. [2023-01-28 06:50:23,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 736 flow [2023-01-28 06:50:23,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:50:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:50:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2023-01-28 06:50:23,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49245283018867925 [2023-01-28 06:50:23,577 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2023-01-28 06:50:23,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2023-01-28 06:50:23,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:23,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2023-01-28 06:50:23,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states 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:50:23,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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:50:23,580 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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:50:23,580 INFO L175 Difference]: Start difference. First operand has 69 places, 46 transitions, 291 flow. Second operand 5 states and 522 transitions. [2023-01-28 06:50:23,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 736 flow [2023-01-28 06:50:23,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 698 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-01-28 06:50:23,585 INFO L231 Difference]: Finished difference. Result has 62 places, 37 transitions, 212 flow [2023-01-28 06:50:23,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=62, PETRI_TRANSITIONS=37} [2023-01-28 06:50:23,586 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 25 predicate places. [2023-01-28 06:50:23,586 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 37 transitions, 212 flow [2023-01-28 06:50:23,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:23,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:23,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:23,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:50:23,586 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:50:23,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:23,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1002616571, now seen corresponding path program 4 times [2023-01-28 06:50:23,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:23,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150519371] [2023-01-28 06:50:23,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:23,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:24,228 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:50:24,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:24,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150519371] [2023-01-28 06:50:24,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150519371] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:24,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:24,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:50:24,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126292141] [2023-01-28 06:50:24,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:24,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:50:24,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:24,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:50:24,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:50:24,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 212 [2023-01-28 06:50:24,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 37 transitions, 212 flow. Second operand has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 0 states have call successors, (0), 0 states 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:50:24,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:24,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 212 [2023-01-28 06:50:24,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:24,481 INFO L130 PetriNetUnfolder]: 279/594 cut-off events. [2023-01-28 06:50:24,481 INFO L131 PetriNetUnfolder]: For 1149/1149 co-relation queries the response was YES. [2023-01-28 06:50:24,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 594 events. 279/594 cut-off events. For 1149/1149 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2721 event pairs, 71 based on Foata normal form. 2/596 useless extension candidates. Maximal degree in co-relation 2354. Up to 222 conditions per place. [2023-01-28 06:50:24,483 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 59 selfloop transitions, 6 changer transitions 26/91 dead transitions. [2023-01-28 06:50:24,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 91 transitions, 664 flow [2023-01-28 06:50:24,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:50:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:50:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 732 transitions. [2023-01-28 06:50:24,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43160377358490565 [2023-01-28 06:50:24,485 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 732 transitions. [2023-01-28 06:50:24,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 732 transitions. [2023-01-28 06:50:24,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:24,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 732 transitions. [2023-01-28 06:50:24,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 91.5) internal successors, (732), 8 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:50:24,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states 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:50:24,488 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states 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:50:24,488 INFO L175 Difference]: Start difference. First operand has 62 places, 37 transitions, 212 flow. Second operand 8 states and 732 transitions. [2023-01-28 06:50:24,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 91 transitions, 664 flow [2023-01-28 06:50:24,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 91 transitions, 612 flow, removed 20 selfloop flow, removed 7 redundant places. [2023-01-28 06:50:24,491 INFO L231 Difference]: Finished difference. Result has 64 places, 37 transitions, 213 flow [2023-01-28 06:50:24,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=64, PETRI_TRANSITIONS=37} [2023-01-28 06:50:24,492 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 27 predicate places. [2023-01-28 06:50:24,492 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 37 transitions, 213 flow [2023-01-28 06:50:24,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 0 states have call successors, (0), 0 states 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:50:24,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:24,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:24,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:50:24,493 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:50:24,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:24,493 INFO L85 PathProgramCache]: Analyzing trace with hash 462935021, now seen corresponding path program 5 times [2023-01-28 06:50:24,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:24,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838505380] [2023-01-28 06:50:24,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:24,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:50:24,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:50:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:50:24,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:50:24,578 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:50:24,579 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 06:50:24,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 06:50:24,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 06:50:24,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 06:50:24,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 06:50:24,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 06:50:24,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 06:50:24,580 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:24,584 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:50:24,584 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:50:24,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:50:24 BasicIcfg [2023-01-28 06:50:24,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:50:24,648 INFO L158 Benchmark]: Toolchain (without parser) took 10658.37ms. Allocated memory was 354.4MB in the beginning and 864.0MB in the end (delta: 509.6MB). Free memory was 308.2MB in the beginning and 513.2MB in the end (delta: -205.0MB). Peak memory consumption was 306.6MB. Max. memory is 16.0GB. [2023-01-28 06:50:24,648 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 354.4MB. Free memory was 302.3MB in the beginning and 302.1MB in the end (delta: 237.7kB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:50:24,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.22ms. Allocated memory is still 354.4MB. Free memory was 308.2MB in the beginning and 284.2MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 06:50:24,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.03ms. Allocated memory is still 354.4MB. Free memory was 284.2MB in the beginning and 282.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:50:24,648 INFO L158 Benchmark]: Boogie Preprocessor took 27.29ms. Allocated memory is still 354.4MB. Free memory was 282.1MB in the beginning and 280.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:50:24,649 INFO L158 Benchmark]: RCFGBuilder took 472.92ms. Allocated memory is still 354.4MB. Free memory was 280.0MB in the beginning and 243.2MB in the end (delta: 36.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-01-28 06:50:24,649 INFO L158 Benchmark]: TraceAbstraction took 9704.35ms. Allocated memory was 354.4MB in the beginning and 864.0MB in the end (delta: 509.6MB). Free memory was 242.3MB in the beginning and 513.2MB in the end (delta: -270.9MB). Peak memory consumption was 241.6MB. Max. memory is 16.0GB. [2023-01-28 06:50:24,650 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.47ms. Allocated memory is still 354.4MB. Free memory was 302.3MB in the beginning and 302.1MB in the end (delta: 237.7kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 410.22ms. Allocated memory is still 354.4MB. Free memory was 308.2MB in the beginning and 284.2MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 38.03ms. Allocated memory is still 354.4MB. Free memory was 284.2MB in the beginning and 282.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.29ms. Allocated memory is still 354.4MB. Free memory was 282.1MB in the beginning and 280.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 472.92ms. Allocated memory is still 354.4MB. Free memory was 280.0MB in the beginning and 243.2MB in the end (delta: 36.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 9704.35ms. Allocated memory was 354.4MB in the beginning and 864.0MB in the end (delta: 509.6MB). Free memory was 242.3MB in the beginning and 513.2MB in the end (delta: -270.9MB). Peak memory consumption was 241.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 120 PlacesBefore, 37 PlacesAfterwards, 112 TransitionsBefore, 28 TransitionsAfterwards, 2240 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, 6801 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3490, independent: 3270, independent conditional: 0, independent unconditional: 3270, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1227, independent: 1193, independent conditional: 0, independent unconditional: 1193, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3490, independent: 2077, independent conditional: 0, independent unconditional: 2077, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 1227, unknown conditional: 0, unknown unconditional: 1227] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 125, Positive conditional cache size: 0, Positive unconditional cache size: 125, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t385; [L851] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t385, ((void *)0), P0, ((void *)0))=-3, t385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t386; [L853] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t386, ((void *)0), P1, ((void *)0))=-2, t385={5:0}, t386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t387; [L855] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t387, ((void *)0), P2, ((void *)0))=-1, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, z=0] [L763] 1 x = 1 [L766] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L769] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=0] [L789] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=1] [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 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: 9.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 384 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 384 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1591 IncrementalHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 31 mSDtfsCounter, 1591 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381occurred in iteration=9, InterpolantAutomatonStates: 69, 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.9s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 1760 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:50:24,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...