/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/mix038_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:55:51,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:55:51,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:55:51,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:55:51,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:55:51,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:55:51,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:55:51,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:55:51,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:55:51,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:55:51,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:55:51,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:55:51,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:55:51,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:55:51,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:55:51,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:55:51,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:55:51,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:55:51,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:55:51,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:55:51,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:55:51,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:55:51,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:55:51,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:55:51,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:55:51,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:55:51,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:55:51,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:55:51,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:55:51,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:55:51,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:55:51,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:55:51,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:55:51,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:55:51,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:55:51,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:55:51,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:55:51,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:55:51,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:55:51,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:55:51,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:55:51,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 06:55:51,661 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:55:51,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:55:51,662 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:55:51,662 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:55:51,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:55:51,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:55:51,663 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:55:51,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:55:51,663 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:55:51,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:55:51,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:55:51,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:55:51,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:55:51,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:55:51,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:55:51,664 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:55:51,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:55:51,664 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:55:51,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:55:51,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:55:51,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:55:51,665 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:55:51,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:55:51,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:55:51,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:55:51,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:55:51,665 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:55:51,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:55:51,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:55:51,665 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:55:51,665 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:55:51,665 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 06:55:51,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:55:51,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:55:51,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:55:51,869 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:55:51,869 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:55:51,870 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2023-01-28 06:55:52,903 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:55:53,056 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:55:53,056 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2023-01-28 06:55:53,066 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57a9ffed0/4fbcc66ecb684b959cc10864e30b04b6/FLAGc6550dd13 [2023-01-28 06:55:53,078 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57a9ffed0/4fbcc66ecb684b959cc10864e30b04b6 [2023-01-28 06:55:53,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:55:53,081 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:55:53,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:55:53,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:55:53,085 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:55:53,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:55:53" (1/1) ... [2023-01-28 06:55:53,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67943d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:53, skipping insertion in model container [2023-01-28 06:55:53,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:55:53" (1/1) ... [2023-01-28 06:55:53,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:55:53,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:55:53,222 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/mix038_tso.oepc.i[949,962] [2023-01-28 06:55:53,396 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:55:53,408 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:55:53,417 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/mix038_tso.oepc.i[949,962] [2023-01-28 06:55:53,465 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:55:53,490 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:55:53,491 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:55:53,495 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:55:53,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:53 WrapperNode [2023-01-28 06:55:53,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:55:53,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:55:53,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:55:53,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:55:53,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:53" (1/1) ... [2023-01-28 06:55:53,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:53" (1/1) ... [2023-01-28 06:55:53,553 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-01-28 06:55:53,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:55:53,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:55:53,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:55:53,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:55:53,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:53" (1/1) ... [2023-01-28 06:55:53,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:53" (1/1) ... [2023-01-28 06:55:53,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:53" (1/1) ... [2023-01-28 06:55:53,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:53" (1/1) ... [2023-01-28 06:55:53,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:53" (1/1) ... [2023-01-28 06:55:53,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:53" (1/1) ... [2023-01-28 06:55:53,581 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:53" (1/1) ... [2023-01-28 06:55:53,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:53" (1/1) ... [2023-01-28 06:55:53,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:55:53,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:55:53,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:55:53,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:55:53,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:53" (1/1) ... [2023-01-28 06:55:53,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:55:53,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:55:53,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 06:55:53,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 06:55:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:55:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:55:53,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:55:53,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:55:53,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:55:53,654 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:55:53,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:55:53,654 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:55:53,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:55:53,654 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:55:53,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:55:53,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:55:53,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:55:53,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:55:53,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:55:53,656 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 06:55:53,771 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:55:53,774 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:55:54,015 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:55:54,153 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:55:54,154 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:55:54,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:55:54 BoogieIcfgContainer [2023-01-28 06:55:54,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:55:54,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:55:54,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:55:54,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:55:54,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:55:53" (1/3) ... [2023-01-28 06:55:54,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22169f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:55:54, skipping insertion in model container [2023-01-28 06:55:54,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:55:53" (2/3) ... [2023-01-28 06:55:54,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22169f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:55:54, skipping insertion in model container [2023-01-28 06:55:54,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:55:54" (3/3) ... [2023-01-28 06:55:54,161 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2023-01-28 06:55:54,173 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:55:54,173 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:55:54,173 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:55:54,217 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:55:54,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2023-01-28 06:55:54,290 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2023-01-28 06:55:54,290 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:55:54,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-01-28 06:55:54,295 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2023-01-28 06:55:54,298 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2023-01-28 06:55:54,300 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:55:54,310 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2023-01-28 06:55:54,311 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2023-01-28 06:55:54,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2023-01-28 06:55:54,334 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2023-01-28 06:55:54,334 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:55:54,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-01-28 06:55:54,336 INFO L119 LiptonReduction]: Number of co-enabled transitions 2082 [2023-01-28 06:55:57,336 INFO L134 LiptonReduction]: Checked pairs total: 5852 [2023-01-28 06:55:57,337 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-01-28 06:55:57,347 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:55:57,351 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;@2cd5a144, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:55:57,351 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 06:55:57,353 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2023-01-28 06:55:57,354 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:55:57,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:57,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 06:55:57,355 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:55:57,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:57,358 INFO L85 PathProgramCache]: Analyzing trace with hash 463746085, now seen corresponding path program 1 times [2023-01-28 06:55:57,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:57,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049173391] [2023-01-28 06:55:57,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:57,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:57,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:57,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049173391] [2023-01-28 06:55:57,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049173391] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:57,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:57,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:55:57,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464130388] [2023-01-28 06:55:57,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:57,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:55:57,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:57,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:55:57,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:55:57,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 207 [2023-01-28 06:55:57,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:57,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:57,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 207 [2023-01-28 06:55:57,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:57,947 INFO L130 PetriNetUnfolder]: 1079/1694 cut-off events. [2023-01-28 06:55:57,947 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-01-28 06:55:57,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3341 conditions, 1694 events. 1079/1694 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8399 event pairs, 275 based on Foata normal form. 0/1609 useless extension candidates. Maximal degree in co-relation 3330. Up to 1285 conditions per place. [2023-01-28 06:55:57,962 INFO L137 encePairwiseOnDemand]: 203/207 looper letters, 31 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-01-28 06:55:57,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 158 flow [2023-01-28 06:55:57,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:55:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:55:57,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-01-28 06:55:57,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.534621578099839 [2023-01-28 06:55:57,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-01-28 06:55:57,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-01-28 06:55:57,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:57,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-01-28 06:55:57,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:57,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:57,985 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:57,986 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 332 transitions. [2023-01-28 06:55:57,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 158 flow [2023-01-28 06:55:57,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 06:55:57,989 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 56 flow [2023-01-28 06:55:57,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-01-28 06:55:57,992 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-01-28 06:55:57,993 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 56 flow [2023-01-28 06:55:57,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:57,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:57,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:57,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:55:57,993 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:55:57,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:57,994 INFO L85 PathProgramCache]: Analyzing trace with hash -613409417, now seen corresponding path program 1 times [2023-01-28 06:55:57,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:57,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664549887] [2023-01-28 06:55:57,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:57,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:58,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:58,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664549887] [2023-01-28 06:55:58,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664549887] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:58,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:58,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:55:58,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751755272] [2023-01-28 06:55:58,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:58,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:55:58,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:58,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:55:58,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:55:58,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 207 [2023-01-28 06:55:58,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:58,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:58,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 207 [2023-01-28 06:55:58,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:58,923 INFO L130 PetriNetUnfolder]: 1769/2630 cut-off events. [2023-01-28 06:55:58,923 INFO L131 PetriNetUnfolder]: For 168/168 co-relation queries the response was YES. [2023-01-28 06:55:58,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5496 conditions, 2630 events. 1769/2630 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11283 event pairs, 504 based on Foata normal form. 150/2780 useless extension candidates. Maximal degree in co-relation 5486. Up to 1651 conditions per place. [2023-01-28 06:55:58,932 INFO L137 encePairwiseOnDemand]: 203/207 looper letters, 31 selfloop transitions, 2 changer transitions 22/55 dead transitions. [2023-01-28 06:55:58,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 55 transitions, 236 flow [2023-01-28 06:55:58,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:55:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:55:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2023-01-28 06:55:58,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45603864734299515 [2023-01-28 06:55:58,934 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 472 transitions. [2023-01-28 06:55:58,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 472 transitions. [2023-01-28 06:55:58,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:58,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 472 transitions. [2023-01-28 06:55:58,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:58,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:58,938 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:58,938 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 56 flow. Second operand 5 states and 472 transitions. [2023-01-28 06:55:58,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 55 transitions, 236 flow [2023-01-28 06:55:58,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 55 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:55:58,939 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 64 flow [2023-01-28 06:55:58,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2023-01-28 06:55:58,940 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2023-01-28 06:55:58,940 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 64 flow [2023-01-28 06:55:58,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:58,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:58,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:58,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:55:58,941 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:55:58,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:58,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1113002135, now seen corresponding path program 1 times [2023-01-28 06:55:58,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:58,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805012185] [2023-01-28 06:55:58,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:58,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:55:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:55:59,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:55:59,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805012185] [2023-01-28 06:55:59,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805012185] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:55:59,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:55:59,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:55:59,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921729402] [2023-01-28 06:55:59,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:55:59,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:55:59,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:55:59,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:55:59,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:55:59,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 207 [2023-01-28 06:55:59,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 64 flow. Second operand has 6 states, 6 states have (on average 85.0) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:59,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:55:59,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 207 [2023-01-28 06:55:59,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:55:59,868 INFO L130 PetriNetUnfolder]: 1645/2457 cut-off events. [2023-01-28 06:55:59,868 INFO L131 PetriNetUnfolder]: For 552/552 co-relation queries the response was YES. [2023-01-28 06:55:59,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5423 conditions, 2457 events. 1645/2457 cut-off events. For 552/552 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 11200 event pairs, 323 based on Foata normal form. 103/2560 useless extension candidates. Maximal degree in co-relation 5410. Up to 2079 conditions per place. [2023-01-28 06:55:59,877 INFO L137 encePairwiseOnDemand]: 197/207 looper letters, 41 selfloop transitions, 9 changer transitions 24/74 dead transitions. [2023-01-28 06:55:59,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 74 transitions, 332 flow [2023-01-28 06:55:59,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:55:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:55:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 658 transitions. [2023-01-28 06:55:59,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45410628019323673 [2023-01-28 06:55:59,879 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 658 transitions. [2023-01-28 06:55:59,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 658 transitions. [2023-01-28 06:55:59,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:55:59,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 658 transitions. [2023-01-28 06:55:59,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:59,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:59,882 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:59,882 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 64 flow. Second operand 7 states and 658 transitions. [2023-01-28 06:55:59,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 74 transitions, 332 flow [2023-01-28 06:55:59,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 74 transitions, 320 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 06:55:59,887 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 133 flow [2023-01-28 06:55:59,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-01-28 06:55:59,888 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2023-01-28 06:55:59,888 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 133 flow [2023-01-28 06:55:59,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.0) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:55:59,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:55:59,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:55:59,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:55:59,889 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:55:59,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:55:59,889 INFO L85 PathProgramCache]: Analyzing trace with hash -143298099, now seen corresponding path program 1 times [2023-01-28 06:55:59,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:55:59,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834428719] [2023-01-28 06:55:59,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:55:59,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:55:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:00,204 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:56:00,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:00,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834428719] [2023-01-28 06:56:00,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834428719] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:00,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:00,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:56:00,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674961425] [2023-01-28 06:56:00,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:00,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:56:00,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:00,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:56:00,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:56:00,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 207 [2023-01-28 06:56:00,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have 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:56:00,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:00,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 207 [2023-01-28 06:56:00,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:00,504 INFO L130 PetriNetUnfolder]: 1188/1882 cut-off events. [2023-01-28 06:56:00,504 INFO L131 PetriNetUnfolder]: For 1953/2105 co-relation queries the response was YES. [2023-01-28 06:56:00,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5498 conditions, 1882 events. 1188/1882 cut-off events. For 1953/2105 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9197 event pairs, 261 based on Foata normal form. 59/1900 useless extension candidates. Maximal degree in co-relation 5482. Up to 1453 conditions per place. [2023-01-28 06:56:00,513 INFO L137 encePairwiseOnDemand]: 200/207 looper letters, 44 selfloop transitions, 6 changer transitions 14/67 dead transitions. [2023-01-28 06:56:00,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 67 transitions, 387 flow [2023-01-28 06:56:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:56:00,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:56:00,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 601 transitions. [2023-01-28 06:56:00,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48389694041867953 [2023-01-28 06:56:00,516 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 601 transitions. [2023-01-28 06:56:00,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 601 transitions. [2023-01-28 06:56:00,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:00,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 601 transitions. [2023-01-28 06:56:00,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have 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:56:00,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:00,522 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:00,523 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 133 flow. Second operand 6 states and 601 transitions. [2023-01-28 06:56:00,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 67 transitions, 387 flow [2023-01-28 06:56:00,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 67 transitions, 385 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 06:56:00,528 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 179 flow [2023-01-28 06:56:00,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2023-01-28 06:56:00,529 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2023-01-28 06:56:00,529 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 179 flow [2023-01-28 06:56:00,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have 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:56:00,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:00,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:00,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:56:00,530 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:56:00,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:00,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1530962582, now seen corresponding path program 1 times [2023-01-28 06:56:00,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:00,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994349113] [2023-01-28 06:56:00,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:00,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:00,883 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:56:00,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:00,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994349113] [2023-01-28 06:56:00,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994349113] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:00,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:00,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:56:00,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470999360] [2023-01-28 06:56:00,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:00,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:56:00,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:00,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:56:00,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:56:00,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 207 [2023-01-28 06:56:00,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have 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:56:00,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:00,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 207 [2023-01-28 06:56:00,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:01,166 INFO L130 PetriNetUnfolder]: 1156/1872 cut-off events. [2023-01-28 06:56:01,167 INFO L131 PetriNetUnfolder]: For 3791/3912 co-relation queries the response was YES. [2023-01-28 06:56:01,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6309 conditions, 1872 events. 1156/1872 cut-off events. For 3791/3912 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9362 event pairs, 192 based on Foata normal form. 69/1915 useless extension candidates. Maximal degree in co-relation 6289. Up to 1326 conditions per place. [2023-01-28 06:56:01,177 INFO L137 encePairwiseOnDemand]: 200/207 looper letters, 46 selfloop transitions, 10 changer transitions 16/75 dead transitions. [2023-01-28 06:56:01,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 515 flow [2023-01-28 06:56:01,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:56:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:56:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 717 transitions. [2023-01-28 06:56:01,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494824016563147 [2023-01-28 06:56:01,179 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 717 transitions. [2023-01-28 06:56:01,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 717 transitions. [2023-01-28 06:56:01,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:01,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 717 transitions. [2023-01-28 06:56:01,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have 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:56:01,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have 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:56:01,182 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have 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:56:01,182 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 179 flow. Second operand 7 states and 717 transitions. [2023-01-28 06:56:01,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 515 flow [2023-01-28 06:56:01,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 75 transitions, 499 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-01-28 06:56:01,189 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 228 flow [2023-01-28 06:56:01,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-01-28 06:56:01,191 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2023-01-28 06:56:01,191 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 228 flow [2023-01-28 06:56:01,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have 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:56:01,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:01,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:01,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:56:01,192 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:56:01,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:01,192 INFO L85 PathProgramCache]: Analyzing trace with hash -466612042, now seen corresponding path program 1 times [2023-01-28 06:56:01,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:01,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221530815] [2023-01-28 06:56:01,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:01,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:01,682 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:56:01,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:01,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221530815] [2023-01-28 06:56:01,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221530815] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:01,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:01,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:56:01,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96218921] [2023-01-28 06:56:01,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:01,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:56:01,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:01,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:56:01,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:56:01,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 207 [2023-01-28 06:56:01,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have 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:56:01,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:01,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 207 [2023-01-28 06:56:01,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:01,964 INFO L130 PetriNetUnfolder]: 1150/1835 cut-off events. [2023-01-28 06:56:01,964 INFO L131 PetriNetUnfolder]: For 6662/6801 co-relation queries the response was YES. [2023-01-28 06:56:01,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6965 conditions, 1835 events. 1150/1835 cut-off events. For 6662/6801 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8980 event pairs, 168 based on Foata normal form. 55/1857 useless extension candidates. Maximal degree in co-relation 6942. Up to 1324 conditions per place. [2023-01-28 06:56:01,974 INFO L137 encePairwiseOnDemand]: 201/207 looper letters, 49 selfloop transitions, 10 changer transitions 13/75 dead transitions. [2023-01-28 06:56:01,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 568 flow [2023-01-28 06:56:01,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:56:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:56:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 687 transitions. [2023-01-28 06:56:01,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.474120082815735 [2023-01-28 06:56:01,976 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 687 transitions. [2023-01-28 06:56:01,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 687 transitions. [2023-01-28 06:56:01,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:01,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 687 transitions. [2023-01-28 06:56:01,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.14285714285714) internal successors, (687), 7 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have 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:56:01,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have 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:56:01,979 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have 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:56:01,979 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 228 flow. Second operand 7 states and 687 transitions. [2023-01-28 06:56:01,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 568 flow [2023-01-28 06:56:01,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 75 transitions, 524 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-01-28 06:56:01,989 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 261 flow [2023-01-28 06:56:01,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-01-28 06:56:01,990 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2023-01-28 06:56:01,991 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 261 flow [2023-01-28 06:56:01,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have 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:56:01,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:01,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:01,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:56:01,991 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:56:01,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash 242041404, now seen corresponding path program 1 times [2023-01-28 06:56:01,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:01,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547296891] [2023-01-28 06:56:01,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:01,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:02,474 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:56:02,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:02,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547296891] [2023-01-28 06:56:02,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547296891] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:02,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:02,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:56:02,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163803079] [2023-01-28 06:56:02,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:02,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:56:02,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:02,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:56:02,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:56:02,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 207 [2023-01-28 06:56:02,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 261 flow. Second operand has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have 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:56:02,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:02,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 207 [2023-01-28 06:56:02,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:03,002 INFO L130 PetriNetUnfolder]: 1590/2376 cut-off events. [2023-01-28 06:56:03,002 INFO L131 PetriNetUnfolder]: For 6181/6181 co-relation queries the response was YES. [2023-01-28 06:56:03,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8850 conditions, 2376 events. 1590/2376 cut-off events. For 6181/6181 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 10142 event pairs, 436 based on Foata normal form. 51/2427 useless extension candidates. Maximal degree in co-relation 8826. Up to 1854 conditions per place. [2023-01-28 06:56:03,016 INFO L137 encePairwiseOnDemand]: 196/207 looper letters, 67 selfloop transitions, 28 changer transitions 14/109 dead transitions. [2023-01-28 06:56:03,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 109 transitions, 851 flow [2023-01-28 06:56:03,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:56:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:56:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 844 transitions. [2023-01-28 06:56:03,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45303274288781537 [2023-01-28 06:56:03,018 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 844 transitions. [2023-01-28 06:56:03,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 844 transitions. [2023-01-28 06:56:03,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:03,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 844 transitions. [2023-01-28 06:56:03,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have 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:56:03,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have 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:56:03,022 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have 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:56:03,022 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 261 flow. Second operand 9 states and 844 transitions. [2023-01-28 06:56:03,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 109 transitions, 851 flow [2023-01-28 06:56:03,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 109 transitions, 816 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-01-28 06:56:03,032 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 499 flow [2023-01-28 06:56:03,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=499, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2023-01-28 06:56:03,033 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2023-01-28 06:56:03,033 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 499 flow [2023-01-28 06:56:03,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have 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:56:03,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:03,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:03,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:56:03,034 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:56:03,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:03,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1772096380, now seen corresponding path program 2 times [2023-01-28 06:56:03,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:03,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007127415] [2023-01-28 06:56:03,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:03,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:03,405 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:56:03,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:03,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007127415] [2023-01-28 06:56:03,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007127415] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:03,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:03,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:56:03,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840319977] [2023-01-28 06:56:03,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:03,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:56:03,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:03,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:56:03,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:56:03,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 207 [2023-01-28 06:56:03,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 499 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have 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:56:03,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:03,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 207 [2023-01-28 06:56:03,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:03,793 INFO L130 PetriNetUnfolder]: 1528/2385 cut-off events. [2023-01-28 06:56:03,793 INFO L131 PetriNetUnfolder]: For 10285/10450 co-relation queries the response was YES. [2023-01-28 06:56:03,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10432 conditions, 2385 events. 1528/2385 cut-off events. For 10285/10450 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11509 event pairs, 297 based on Foata normal form. 88/2447 useless extension candidates. Maximal degree in co-relation 10404. Up to 1346 conditions per place. [2023-01-28 06:56:03,807 INFO L137 encePairwiseOnDemand]: 199/207 looper letters, 66 selfloop transitions, 18 changer transitions 17/106 dead transitions. [2023-01-28 06:56:03,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 106 transitions, 994 flow [2023-01-28 06:56:03,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:56:03,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:56:03,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 797 transitions. [2023-01-28 06:56:03,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48128019323671495 [2023-01-28 06:56:03,809 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 797 transitions. [2023-01-28 06:56:03,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 797 transitions. [2023-01-28 06:56:03,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:03,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 797 transitions. [2023-01-28 06:56:03,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 99.625) internal successors, (797), 8 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have 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:56:03,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:03,812 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:03,812 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 499 flow. Second operand 8 states and 797 transitions. [2023-01-28 06:56:03,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 106 transitions, 994 flow [2023-01-28 06:56:03,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 106 transitions, 964 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-01-28 06:56:03,825 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 586 flow [2023-01-28 06:56:03,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=586, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2023-01-28 06:56:03,825 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 34 predicate places. [2023-01-28 06:56:03,825 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 586 flow [2023-01-28 06:56:03,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have 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:56:03,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:03,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:03,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:56:03,826 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:56:03,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:03,826 INFO L85 PathProgramCache]: Analyzing trace with hash 931448430, now seen corresponding path program 1 times [2023-01-28 06:56:03,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:03,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572809233] [2023-01-28 06:56:03,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:03,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:03,945 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:56:03,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:03,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572809233] [2023-01-28 06:56:03,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572809233] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:03,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:03,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:56:03,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659734298] [2023-01-28 06:56:03,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:03,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:56:03,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:03,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:56:03,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:56:03,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 207 [2023-01-28 06:56:03,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 586 flow. Second operand has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:03,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:03,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 207 [2023-01-28 06:56:03,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:04,304 INFO L130 PetriNetUnfolder]: 2083/3249 cut-off events. [2023-01-28 06:56:04,304 INFO L131 PetriNetUnfolder]: For 19511/19646 co-relation queries the response was YES. [2023-01-28 06:56:04,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15709 conditions, 3249 events. 2083/3249 cut-off events. For 19511/19646 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 16537 event pairs, 331 based on Foata normal form. 80/3318 useless extension candidates. Maximal degree in co-relation 15675. Up to 1492 conditions per place. [2023-01-28 06:56:04,320 INFO L137 encePairwiseOnDemand]: 203/207 looper letters, 89 selfloop transitions, 3 changer transitions 12/111 dead transitions. [2023-01-28 06:56:04,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 111 transitions, 1258 flow [2023-01-28 06:56:04,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:56:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:56:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-01-28 06:56:04,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975845410628019 [2023-01-28 06:56:04,322 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-01-28 06:56:04,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-01-28 06:56:04,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:04,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-01-28 06:56:04,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have 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:56:04,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:04,325 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:04,325 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 586 flow. Second operand 5 states and 515 transitions. [2023-01-28 06:56:04,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 111 transitions, 1258 flow [2023-01-28 06:56:04,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 111 transitions, 1202 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-01-28 06:56:04,343 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 578 flow [2023-01-28 06:56:04,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=578, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2023-01-28 06:56:04,343 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 34 predicate places. [2023-01-28 06:56:04,344 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 578 flow [2023-01-28 06:56:04,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:04,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:04,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:04,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:56:04,344 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:56:04,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:04,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1624053140, now seen corresponding path program 2 times [2023-01-28 06:56:04,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:04,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468658363] [2023-01-28 06:56:04,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:04,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:04,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:04,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468658363] [2023-01-28 06:56:04,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468658363] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:04,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:04,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:56:04,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737350760] [2023-01-28 06:56:04,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:04,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:56:04,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:04,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:56:04,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:56:04,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 207 [2023-01-28 06:56:04,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 578 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have 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:56:04,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:04,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 207 [2023-01-28 06:56:04,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:04,706 INFO L130 PetriNetUnfolder]: 1334/2274 cut-off events. [2023-01-28 06:56:04,706 INFO L131 PetriNetUnfolder]: For 17225/17498 co-relation queries the response was YES. [2023-01-28 06:56:04,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10883 conditions, 2274 events. 1334/2274 cut-off events. For 17225/17498 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 12862 event pairs, 239 based on Foata normal form. 321/2554 useless extension candidates. Maximal degree in co-relation 10849. Up to 1236 conditions per place. [2023-01-28 06:56:04,717 INFO L137 encePairwiseOnDemand]: 201/207 looper letters, 94 selfloop transitions, 8 changer transitions 18/131 dead transitions. [2023-01-28 06:56:04,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 1474 flow [2023-01-28 06:56:04,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:56:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:56:04,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 517 transitions. [2023-01-28 06:56:04,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4995169082125604 [2023-01-28 06:56:04,719 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 517 transitions. [2023-01-28 06:56:04,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 517 transitions. [2023-01-28 06:56:04,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:04,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 517 transitions. [2023-01-28 06:56:04,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have 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:56:04,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:04,722 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:04,722 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 578 flow. Second operand 5 states and 517 transitions. [2023-01-28 06:56:04,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 1474 flow [2023-01-28 06:56:04,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 131 transitions, 1461 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-01-28 06:56:04,734 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 588 flow [2023-01-28 06:56:04,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=588, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2023-01-28 06:56:04,735 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2023-01-28 06:56:04,735 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 588 flow [2023-01-28 06:56:04,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have 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:56:04,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:04,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:04,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:56:04,735 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:56:04,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:04,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1838090043, now seen corresponding path program 1 times [2023-01-28 06:56:04,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:04,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717433202] [2023-01-28 06:56:04,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:04,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:04,850 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:56:04,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:04,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717433202] [2023-01-28 06:56:04,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717433202] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:04,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:04,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:56:04,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058433076] [2023-01-28 06:56:04,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:04,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:56:04,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:04,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:56:04,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:56:04,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 207 [2023-01-28 06:56:04,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 588 flow. Second operand has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have 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:56:04,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:04,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 207 [2023-01-28 06:56:04,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:05,092 INFO L130 PetriNetUnfolder]: 947/1697 cut-off events. [2023-01-28 06:56:05,092 INFO L131 PetriNetUnfolder]: For 14273/14569 co-relation queries the response was YES. [2023-01-28 06:56:05,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8873 conditions, 1697 events. 947/1697 cut-off events. For 14273/14569 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 9779 event pairs, 94 based on Foata normal form. 185/1856 useless extension candidates. Maximal degree in co-relation 8837. Up to 497 conditions per place. [2023-01-28 06:56:05,099 INFO L137 encePairwiseOnDemand]: 201/207 looper letters, 87 selfloop transitions, 14 changer transitions 42/154 dead transitions. [2023-01-28 06:56:05,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 154 transitions, 1757 flow [2023-01-28 06:56:05,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:56:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:56:05,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 724 transitions. [2023-01-28 06:56:05,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4996549344375431 [2023-01-28 06:56:05,101 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 724 transitions. [2023-01-28 06:56:05,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 724 transitions. [2023-01-28 06:56:05,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:05,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 724 transitions. [2023-01-28 06:56:05,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have 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:56:05,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have 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:56:05,104 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have 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:56:05,104 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 588 flow. Second operand 7 states and 724 transitions. [2023-01-28 06:56:05,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 154 transitions, 1757 flow [2023-01-28 06:56:05,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 154 transitions, 1683 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 06:56:05,117 INFO L231 Difference]: Finished difference. Result has 78 places, 65 transitions, 600 flow [2023-01-28 06:56:05,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=600, PETRI_PLACES=78, PETRI_TRANSITIONS=65} [2023-01-28 06:56:05,118 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 43 predicate places. [2023-01-28 06:56:05,118 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 65 transitions, 600 flow [2023-01-28 06:56:05,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have 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:56:05,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:05,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:05,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:56:05,119 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:56:05,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:05,119 INFO L85 PathProgramCache]: Analyzing trace with hash -847999566, now seen corresponding path program 1 times [2023-01-28 06:56:05,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:05,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121856154] [2023-01-28 06:56:05,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:05,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:05,274 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:56:05,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:05,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121856154] [2023-01-28 06:56:05,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121856154] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:05,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:05,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:56:05,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951750006] [2023-01-28 06:56:05,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:05,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:56:05,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:05,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:56:05,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:56:05,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 207 [2023-01-28 06:56:05,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 600 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have 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:56:05,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:05,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 207 [2023-01-28 06:56:05,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:05,504 INFO L130 PetriNetUnfolder]: 866/1560 cut-off events. [2023-01-28 06:56:05,504 INFO L131 PetriNetUnfolder]: For 13697/13985 co-relation queries the response was YES. [2023-01-28 06:56:05,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8764 conditions, 1560 events. 866/1560 cut-off events. For 13697/13985 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 9092 event pairs, 81 based on Foata normal form. 80/1616 useless extension candidates. Maximal degree in co-relation 8725. Up to 468 conditions per place. [2023-01-28 06:56:05,512 INFO L137 encePairwiseOnDemand]: 201/207 looper letters, 65 selfloop transitions, 17 changer transitions 63/153 dead transitions. [2023-01-28 06:56:05,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 153 transitions, 1736 flow [2023-01-28 06:56:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:56:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:56:05,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 908 transitions. [2023-01-28 06:56:05,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.487385936661299 [2023-01-28 06:56:05,514 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 908 transitions. [2023-01-28 06:56:05,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 908 transitions. [2023-01-28 06:56:05,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:05,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 908 transitions. [2023-01-28 06:56:05,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.88888888888889) internal successors, (908), 9 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have 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:56:05,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have 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:56:05,518 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have 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:56:05,518 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 600 flow. Second operand 9 states and 908 transitions. [2023-01-28 06:56:05,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 153 transitions, 1736 flow [2023-01-28 06:56:05,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 153 transitions, 1646 flow, removed 23 selfloop flow, removed 4 redundant places. [2023-01-28 06:56:05,540 INFO L231 Difference]: Finished difference. Result has 85 places, 53 transitions, 467 flow [2023-01-28 06:56:05,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=467, PETRI_PLACES=85, PETRI_TRANSITIONS=53} [2023-01-28 06:56:05,541 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 50 predicate places. [2023-01-28 06:56:05,541 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 53 transitions, 467 flow [2023-01-28 06:56:05,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have 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:56:05,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:05,541 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] [2023-01-28 06:56:05,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:56:05,542 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:56:05,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:05,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1629443632, now seen corresponding path program 1 times [2023-01-28 06:56:05,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:05,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521324599] [2023-01-28 06:56:05,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:05,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:05,941 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:56:05,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:05,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521324599] [2023-01-28 06:56:05,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521324599] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:05,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:05,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 06:56:05,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748123925] [2023-01-28 06:56:05,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:05,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 06:56:05,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:05,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 06:56:05,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-01-28 06:56:05,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 207 [2023-01-28 06:56:05,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 53 transitions, 467 flow. Second operand has 9 states, 9 states have (on average 82.55555555555556) internal successors, (743), 9 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have 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:56:05,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:05,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 207 [2023-01-28 06:56:05,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:06,442 INFO L130 PetriNetUnfolder]: 1310/2224 cut-off events. [2023-01-28 06:56:06,442 INFO L131 PetriNetUnfolder]: For 15553/15553 co-relation queries the response was YES. [2023-01-28 06:56:06,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12731 conditions, 2224 events. 1310/2224 cut-off events. For 15553/15553 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12110 event pairs, 170 based on Foata normal form. 1/2225 useless extension candidates. Maximal degree in co-relation 12690. Up to 1254 conditions per place. [2023-01-28 06:56:06,453 INFO L137 encePairwiseOnDemand]: 199/207 looper letters, 42 selfloop transitions, 3 changer transitions 107/152 dead transitions. [2023-01-28 06:56:06,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 152 transitions, 1629 flow [2023-01-28 06:56:06,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 06:56:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 06:56:06,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1050 transitions. [2023-01-28 06:56:06,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4227053140096618 [2023-01-28 06:56:06,456 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1050 transitions. [2023-01-28 06:56:06,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1050 transitions. [2023-01-28 06:56:06,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:06,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1050 transitions. [2023-01-28 06:56:06,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 87.5) internal successors, (1050), 12 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have 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:56:06,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 207.0) internal successors, (2691), 13 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have 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:56:06,460 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 207.0) internal successors, (2691), 13 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have 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:56:06,461 INFO L175 Difference]: Start difference. First operand has 85 places, 53 transitions, 467 flow. Second operand 12 states and 1050 transitions. [2023-01-28 06:56:06,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 152 transitions, 1629 flow [2023-01-28 06:56:06,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 152 transitions, 1305 flow, removed 97 selfloop flow, removed 16 redundant places. [2023-01-28 06:56:06,497 INFO L231 Difference]: Finished difference. Result has 83 places, 35 transitions, 237 flow [2023-01-28 06:56:06,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=237, PETRI_PLACES=83, PETRI_TRANSITIONS=35} [2023-01-28 06:56:06,498 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 48 predicate places. [2023-01-28 06:56:06,498 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 35 transitions, 237 flow [2023-01-28 06:56:06,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.55555555555556) internal successors, (743), 9 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have 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:56:06,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:06,498 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] [2023-01-28 06:56:06,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 06:56:06,499 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:56:06,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:06,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1706268188, now seen corresponding path program 2 times [2023-01-28 06:56:06,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:06,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888953094] [2023-01-28 06:56:06,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:06,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:56:06,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:56:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:56:06,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:56:06,605 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:56:06,605 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 06:56:06,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 06:56:06,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 06:56:06,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 06:56:06,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 06:56:06,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 06:56:06,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 06:56:06,607 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:06,612 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:56:06,612 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:56:06,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:56:06 BasicIcfg [2023-01-28 06:56:06,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:56:06,671 INFO L158 Benchmark]: Toolchain (without parser) took 13590.65ms. Allocated memory was 320.9MB in the beginning and 677.4MB in the end (delta: 356.5MB). Free memory was 285.6MB in the beginning and 521.0MB in the end (delta: -235.4MB). Peak memory consumption was 123.1MB. Max. memory is 16.0GB. [2023-01-28 06:56:06,671 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 255.9MB. Free memory was 213.4MB in the beginning and 213.3MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:56:06,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.81ms. Allocated memory is still 320.9MB. Free memory was 285.6MB in the beginning and 262.4MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 06:56:06,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.97ms. Allocated memory is still 320.9MB. Free memory was 262.4MB in the beginning and 259.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:56:06,672 INFO L158 Benchmark]: Boogie Preprocessor took 30.12ms. Allocated memory is still 320.9MB. Free memory was 259.4MB in the beginning and 257.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:56:06,672 INFO L158 Benchmark]: RCFGBuilder took 557.97ms. Allocated memory is still 320.9MB. Free memory was 257.6MB in the beginning and 288.4MB in the end (delta: -30.8MB). Peak memory consumption was 40.1MB. Max. memory is 16.0GB. [2023-01-28 06:56:06,672 INFO L158 Benchmark]: TraceAbstraction took 12513.56ms. Allocated memory was 320.9MB in the beginning and 677.4MB in the end (delta: 356.5MB). Free memory was 287.5MB in the beginning and 521.0MB in the end (delta: -233.5MB). Peak memory consumption was 122.8MB. Max. memory is 16.0GB. [2023-01-28 06:56:06,676 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 255.9MB. Free memory was 213.4MB in the beginning and 213.3MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 414.81ms. Allocated memory is still 320.9MB. Free memory was 285.6MB in the beginning and 262.4MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.97ms. Allocated memory is still 320.9MB. Free memory was 262.4MB in the beginning and 259.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.12ms. Allocated memory is still 320.9MB. Free memory was 259.4MB in the beginning and 257.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 557.97ms. Allocated memory is still 320.9MB. Free memory was 257.6MB in the beginning and 288.4MB in the end (delta: -30.8MB). Peak memory consumption was 40.1MB. Max. memory is 16.0GB. * TraceAbstraction took 12513.56ms. Allocated memory was 320.9MB in the beginning and 677.4MB in the end (delta: 356.5MB). Free memory was 287.5MB in the beginning and 521.0MB in the end (delta: -233.5MB). Peak memory consumption was 122.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 117 PlacesBefore, 35 PlacesAfterwards, 109 TransitionsBefore, 26 TransitionsAfterwards, 2082 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, 5852 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3042, independent: 2849, independent conditional: 0, independent unconditional: 2849, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1150, independent: 1119, independent conditional: 0, independent unconditional: 1119, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3042, independent: 1730, independent conditional: 0, independent unconditional: 1730, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1150, unknown conditional: 0, unknown unconditional: 1150] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 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_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L830] 0 pthread_t t1019; [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019, ((void *)0), P0, ((void *)0))=-3, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L832] 0 pthread_t t1020; [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020, ((void *)0), P1, ((void *)0))=-2, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L834] 0 pthread_t t1021; [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1021, ((void *)0), P2, ((void *)0))=-1, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L839] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L839] RET 0 assume_abort_if_not(main$tmp_guard0) [L841] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 [L863] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, 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: 831]: 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: 833]: 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: 835]: 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, 141 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: 12.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 499 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 499 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1798 IncrementalHoareTripleChecker+Invalid, 1875 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 32 mSDtfsCounter, 1798 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=11, InterpolantAutomatonStates: 90, 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, 3.9s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 1901 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:56:06,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...