/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/rfi000_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:58:29,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:58:29,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:58:29,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:58:29,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:58:29,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:58:29,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:58:29,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:58:29,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:58:29,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:58:29,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:58:29,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:58:29,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:58:29,709 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:58:29,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:58:29,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:58:29,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:58:29,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:58:29,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:58:29,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:58:29,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:58:29,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:58:29,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:58:29,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:58:29,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:58:29,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:58:29,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:58:29,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:58:29,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:58:29,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:58:29,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:58:29,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:58:29,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:58:29,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:58:29,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:58:29,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:58:29,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:58:29,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:58:29,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:58:29,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:58:29,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:58:29,728 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:58:29,744 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:58:29,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:58:29,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:58:29,745 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:58:29,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:58:29,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:58:29,746 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:58:29,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:58:29,746 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:58:29,746 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:58:29,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:58:29,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:58:29,747 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:58:29,747 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:58:29,747 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:58:29,748 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:58:29,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:58:29,748 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:58:29,748 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:58:29,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:58:29,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:58:29,749 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:58:29,749 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:58:29,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:58:29,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:58:29,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:58:29,749 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:58:29,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:58:29,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:58:29,750 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:58:29,750 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:58:29,750 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:58:29,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:58:29,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:58:29,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:58:29,959 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:58:29,960 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:58:29,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 06:58:30,977 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:58:31,235 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:58:31,236 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 06:58:31,257 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffda5029e/5189df3b50ce44e38e2a4cafaf1ea0ce/FLAG9946c3ee4 [2023-01-28 06:58:31,269 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffda5029e/5189df3b50ce44e38e2a4cafaf1ea0ce [2023-01-28 06:58:31,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:58:31,272 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:58:31,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:58:31,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:58:31,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:58:31,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:58:31" (1/1) ... [2023-01-28 06:58:31,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f2adfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:31, skipping insertion in model container [2023-01-28 06:58:31,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:58:31" (1/1) ... [2023-01-28 06:58:31,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:58:31,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:58:31,481 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/rfi000_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-28 06:58:31,647 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:58:31,654 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:58:31,665 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/rfi000_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-28 06:58:31,718 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:58:31,750 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:58:31,750 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:58:31,755 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:58:31,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:31 WrapperNode [2023-01-28 06:58:31,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:58:31,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:58:31,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:58:31,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:58:31,761 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:58:31" (1/1) ... [2023-01-28 06:58:31,786 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:58:31" (1/1) ... [2023-01-28 06:58:31,811 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2023-01-28 06:58:31,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:58:31,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:58:31,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:58:31,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:58:31,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:31" (1/1) ... [2023-01-28 06:58:31,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:31" (1/1) ... [2023-01-28 06:58:31,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:31" (1/1) ... [2023-01-28 06:58:31,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:31" (1/1) ... [2023-01-28 06:58:31,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:31" (1/1) ... [2023-01-28 06:58:31,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:31" (1/1) ... [2023-01-28 06:58:31,839 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:31" (1/1) ... [2023-01-28 06:58:31,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:31" (1/1) ... [2023-01-28 06:58:31,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:58:31,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:58:31,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:58:31,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:58:31,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:31" (1/1) ... [2023-01-28 06:58:31,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:58:31,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:58:31,897 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:58:31,899 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:58:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:58:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:58:31,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:58:31,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:58:31,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:58:31,931 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:58:31,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:58:31,932 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:58:31,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:58:31,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:58:31,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:58:31,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:58:31,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:58:31,934 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:58:32,095 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:58:32,097 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:58:32,404 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:58:32,494 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:58:32,494 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:58:32,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:58:32 BoogieIcfgContainer [2023-01-28 06:58:32,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:58:32,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:58:32,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:58:32,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:58:32,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:58:31" (1/3) ... [2023-01-28 06:58:32,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23cf5f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:58:32, skipping insertion in model container [2023-01-28 06:58:32,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:31" (2/3) ... [2023-01-28 06:58:32,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23cf5f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:58:32, skipping insertion in model container [2023-01-28 06:58:32,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:58:32" (3/3) ... [2023-01-28 06:58:32,501 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 06:58:32,512 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:58:32,512 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:58:32,512 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:58:32,539 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:58:32,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2023-01-28 06:58:32,584 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2023-01-28 06:58:32,584 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:58:32,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-01-28 06:58:32,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2023-01-28 06:58:32,590 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2023-01-28 06:58:32,592 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:58:32,598 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 182 flow [2023-01-28 06:58:32,600 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 182 flow [2023-01-28 06:58:32,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 182 flow [2023-01-28 06:58:32,613 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2023-01-28 06:58:32,614 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:58:32,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-01-28 06:58:32,615 INFO L119 LiptonReduction]: Number of co-enabled transitions 1174 [2023-01-28 06:58:35,479 INFO L134 LiptonReduction]: Checked pairs total: 3166 [2023-01-28 06:58:35,479 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-01-28 06:58:35,489 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:58:35,493 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;@77513eeb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:58:35,493 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 06:58:35,495 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-01-28 06:58:35,495 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:58:35,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:35,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 06:58:35,496 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:35,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:35,499 INFO L85 PathProgramCache]: Analyzing trace with hash 476963, now seen corresponding path program 1 times [2023-01-28 06:58:35,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:35,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026305853] [2023-01-28 06:58:35,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:35,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:35,724 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:58:35,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:35,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026305853] [2023-01-28 06:58:35,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026305853] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:35,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:35,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:58:35,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432917099] [2023-01-28 06:58:35,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:35,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:58:35,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:35,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:58:35,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:58:35,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 172 [2023-01-28 06:58:35,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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:58:35,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:35,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 172 [2023-01-28 06:58:35,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:35,880 INFO L130 PetriNetUnfolder]: 173/315 cut-off events. [2023-01-28 06:58:35,880 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 06:58:35,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 315 events. 173/315 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1204 event pairs, 60 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 621. Up to 250 conditions per place. [2023-01-28 06:58:35,883 INFO L137 encePairwiseOnDemand]: 169/172 looper letters, 23 selfloop transitions, 2 changer transitions 2/29 dead transitions. [2023-01-28 06:58:35,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 121 flow [2023-01-28 06:58:35,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:58:35,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:58:35,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2023-01-28 06:58:35,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49612403100775193 [2023-01-28 06:58:35,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 256 transitions. [2023-01-28 06:58:35,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 256 transitions. [2023-01-28 06:58:35,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:35,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 256 transitions. [2023-01-28 06:58:35,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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:58:35,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:35,900 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:35,901 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 256 transitions. [2023-01-28 06:58:35,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 121 flow [2023-01-28 06:58:35,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:35,903 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 42 flow [2023-01-28 06:58:35,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-01-28 06:58:35,906 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-01-28 06:58:35,907 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 42 flow [2023-01-28 06:58:35,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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:58:35,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:35,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:35,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:58:35,907 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:35,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:35,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1856191249, now seen corresponding path program 1 times [2023-01-28 06:58:35,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:35,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277942537] [2023-01-28 06:58:35,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:35,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:36,713 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:58:36,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:36,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277942537] [2023-01-28 06:58:36,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277942537] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:36,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:36,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:58:36,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741007529] [2023-01-28 06:58:36,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:36,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:58:36,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:36,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:58:36,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:58:36,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 172 [2023-01-28 06:58:36,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 0 states 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:58:36,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:36,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 172 [2023-01-28 06:58:36,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:36,841 INFO L130 PetriNetUnfolder]: 199/351 cut-off events. [2023-01-28 06:58:36,841 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2023-01-28 06:58:36,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 351 events. 199/351 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1185 event pairs, 75 based on Foata normal form. 19/370 useless extension candidates. Maximal degree in co-relation 735. Up to 212 conditions per place. [2023-01-28 06:58:36,843 INFO L137 encePairwiseOnDemand]: 164/172 looper letters, 22 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2023-01-28 06:58:36,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 126 flow [2023-01-28 06:58:36,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:58:36,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:58:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 287 transitions. [2023-01-28 06:58:36,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4171511627906977 [2023-01-28 06:58:36,846 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 287 transitions. [2023-01-28 06:58:36,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 287 transitions. [2023-01-28 06:58:36,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:36,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 287 transitions. [2023-01-28 06:58:36,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:58:36,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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:58:36,858 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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:58:36,859 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 42 flow. Second operand 4 states and 287 transitions. [2023-01-28 06:58:36,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 126 flow [2023-01-28 06:58:36,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:36,860 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 90 flow [2023-01-28 06:58:36,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2023-01-28 06:58:36,860 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2023-01-28 06:58:36,860 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 90 flow [2023-01-28 06:58:36,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 0 states 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:58:36,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:36,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:36,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:58:36,861 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:36,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:36,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1002104403, now seen corresponding path program 1 times [2023-01-28 06:58:36,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:36,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738489727] [2023-01-28 06:58:36,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:36,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:38,098 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:58:38,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:38,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738489727] [2023-01-28 06:58:38,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738489727] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:38,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:38,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:58:38,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609991476] [2023-01-28 06:58:38,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:38,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:58:38,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:38,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:58:38,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:58:38,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 172 [2023-01-28 06:58:38,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 90 flow. Second operand has 6 states, 6 states have (on average 63.666666666666664) internal successors, (382), 6 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:58:38,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:38,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 172 [2023-01-28 06:58:38,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:38,267 INFO L130 PetriNetUnfolder]: 225/394 cut-off events. [2023-01-28 06:58:38,267 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2023-01-28 06:58:38,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 394 events. 225/394 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1420 event pairs, 34 based on Foata normal form. 3/397 useless extension candidates. Maximal degree in co-relation 1103. Up to 294 conditions per place. [2023-01-28 06:58:38,275 INFO L137 encePairwiseOnDemand]: 161/172 looper letters, 30 selfloop transitions, 18 changer transitions 0/48 dead transitions. [2023-01-28 06:58:38,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 48 transitions, 270 flow [2023-01-28 06:58:38,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:58:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:58:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 354 transitions. [2023-01-28 06:58:38,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4116279069767442 [2023-01-28 06:58:38,278 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 354 transitions. [2023-01-28 06:58:38,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 354 transitions. [2023-01-28 06:58:38,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:38,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 354 transitions. [2023-01-28 06:58:38,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:38,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states 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:58:38,282 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states 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:58:38,282 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 90 flow. Second operand 5 states and 354 transitions. [2023-01-28 06:58:38,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 48 transitions, 270 flow [2023-01-28 06:58:38,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 48 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:58:38,286 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 229 flow [2023-01-28 06:58:38,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=35, PETRI_TRANSITIONS=35} [2023-01-28 06:58:38,287 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2023-01-28 06:58:38,289 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 35 transitions, 229 flow [2023-01-28 06:58:38,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.666666666666664) internal successors, (382), 6 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:58:38,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:38,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:38,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:58:38,291 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:38,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:38,291 INFO L85 PathProgramCache]: Analyzing trace with hash -929565810, now seen corresponding path program 1 times [2023-01-28 06:58:38,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:38,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145326733] [2023-01-28 06:58:38,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:38,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:38,829 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:58:38,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:38,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145326733] [2023-01-28 06:58:38,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145326733] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:38,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:38,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:58:38,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374976113] [2023-01-28 06:58:38,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:38,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:58:38,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:38,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:58:38,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:58:38,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 172 [2023-01-28 06:58:38,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 35 transitions, 229 flow. Second operand has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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:58:38,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:38,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 172 [2023-01-28 06:58:38,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:38,920 INFO L130 PetriNetUnfolder]: 217/381 cut-off events. [2023-01-28 06:58:38,920 INFO L131 PetriNetUnfolder]: For 469/469 co-relation queries the response was YES. [2023-01-28 06:58:38,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 381 events. 217/381 cut-off events. For 469/469 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1343 event pairs, 77 based on Foata normal form. 4/385 useless extension candidates. Maximal degree in co-relation 1456. Up to 199 conditions per place. [2023-01-28 06:58:38,922 INFO L137 encePairwiseOnDemand]: 165/172 looper letters, 36 selfloop transitions, 9 changer transitions 0/45 dead transitions. [2023-01-28 06:58:38,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 377 flow [2023-01-28 06:58:38,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:58:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:58:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 285 transitions. [2023-01-28 06:58:38,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41424418604651164 [2023-01-28 06:58:38,923 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 285 transitions. [2023-01-28 06:58:38,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 285 transitions. [2023-01-28 06:58:38,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:38,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 285 transitions. [2023-01-28 06:58:38,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 0 states have call successors, (0), 0 states 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:58:38,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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:58:38,926 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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:58:38,926 INFO L175 Difference]: Start difference. First operand has 35 places, 35 transitions, 229 flow. Second operand 4 states and 285 transitions. [2023-01-28 06:58:38,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 377 flow [2023-01-28 06:58:38,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 377 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:58:38,928 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 303 flow [2023-01-28 06:58:38,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=303, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2023-01-28 06:58:38,929 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 15 predicate places. [2023-01-28 06:58:38,929 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 303 flow [2023-01-28 06:58:38,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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:58:38,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:38,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:38,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:58:38,930 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:38,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:38,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1002757988, now seen corresponding path program 1 times [2023-01-28 06:58:38,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:38,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84952212] [2023-01-28 06:58:38,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:38,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:39,477 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:58:39,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:39,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84952212] [2023-01-28 06:58:39,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84952212] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:39,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:39,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:58:39,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139709061] [2023-01-28 06:58:39,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:39,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:58:39,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:39,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:58:39,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:58:39,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 172 [2023-01-28 06:58:39,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 303 flow. Second operand has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 0 states have call successors, (0), 0 states 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:58:39,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:39,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 172 [2023-01-28 06:58:39,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:39,585 INFO L130 PetriNetUnfolder]: 198/356 cut-off events. [2023-01-28 06:58:39,585 INFO L131 PetriNetUnfolder]: For 695/715 co-relation queries the response was YES. [2023-01-28 06:58:39,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1491 conditions, 356 events. 198/356 cut-off events. For 695/715 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1280 event pairs, 35 based on Foata normal form. 12/364 useless extension candidates. Maximal degree in co-relation 1468. Up to 289 conditions per place. [2023-01-28 06:58:39,587 INFO L137 encePairwiseOnDemand]: 166/172 looper letters, 36 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2023-01-28 06:58:39,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 460 flow [2023-01-28 06:58:39,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:58:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:58:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 315 transitions. [2023-01-28 06:58:39,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4578488372093023 [2023-01-28 06:58:39,589 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 315 transitions. [2023-01-28 06:58:39,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 315 transitions. [2023-01-28 06:58:39,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:39,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 315 transitions. [2023-01-28 06:58:39,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states 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:58:39,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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:58:39,592 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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:58:39,592 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 303 flow. Second operand 4 states and 315 transitions. [2023-01-28 06:58:39,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 460 flow [2023-01-28 06:58:39,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 440 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-01-28 06:58:39,599 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 330 flow [2023-01-28 06:58:39,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2023-01-28 06:58:39,601 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2023-01-28 06:58:39,601 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 330 flow [2023-01-28 06:58:39,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 0 states have call successors, (0), 0 states 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:58:39,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:39,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:39,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:58:39,602 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:39,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:39,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1248228985, now seen corresponding path program 1 times [2023-01-28 06:58:39,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:39,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309434925] [2023-01-28 06:58:39,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:39,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:40,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:58:40,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:40,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309434925] [2023-01-28 06:58:40,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309434925] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:40,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:40,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:58:40,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001995790] [2023-01-28 06:58:40,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:40,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:58:40,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:40,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:58:40,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:58:40,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 172 [2023-01-28 06:58:40,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 330 flow. Second operand has 7 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 0 states have call successors, (0), 0 states 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:58:40,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:40,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 172 [2023-01-28 06:58:40,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:40,612 INFO L130 PetriNetUnfolder]: 284/521 cut-off events. [2023-01-28 06:58:40,613 INFO L131 PetriNetUnfolder]: For 978/998 co-relation queries the response was YES. [2023-01-28 06:58:40,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2270 conditions, 521 events. 284/521 cut-off events. For 978/998 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2185 event pairs, 15 based on Foata normal form. 15/532 useless extension candidates. Maximal degree in co-relation 2247. Up to 268 conditions per place. [2023-01-28 06:58:40,616 INFO L137 encePairwiseOnDemand]: 164/172 looper letters, 57 selfloop transitions, 27 changer transitions 0/89 dead transitions. [2023-01-28 06:58:40,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 813 flow [2023-01-28 06:58:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:58:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:58:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 641 transitions. [2023-01-28 06:58:40,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4140826873385013 [2023-01-28 06:58:40,618 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 641 transitions. [2023-01-28 06:58:40,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 641 transitions. [2023-01-28 06:58:40,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:40,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 641 transitions. [2023-01-28 06:58:40,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 71.22222222222223) internal successors, (641), 9 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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:58:40,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states 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:58:40,621 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states 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:58:40,621 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 330 flow. Second operand 9 states and 641 transitions. [2023-01-28 06:58:40,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 813 flow [2023-01-28 06:58:40,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 806 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:58:40,625 INFO L231 Difference]: Finished difference. Result has 53 places, 57 transitions, 566 flow [2023-01-28 06:58:40,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=566, PETRI_PLACES=53, PETRI_TRANSITIONS=57} [2023-01-28 06:58:40,626 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 27 predicate places. [2023-01-28 06:58:40,626 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 57 transitions, 566 flow [2023-01-28 06:58:40,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 0 states have call successors, (0), 0 states 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:58:40,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:40,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:40,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:58:40,627 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:40,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:40,627 INFO L85 PathProgramCache]: Analyzing trace with hash -949720212, now seen corresponding path program 1 times [2023-01-28 06:58:40,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:40,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729004720] [2023-01-28 06:58:40,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:40,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:41,612 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:58:41,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:41,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729004720] [2023-01-28 06:58:41,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729004720] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:41,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:41,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:58:41,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795910949] [2023-01-28 06:58:41,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:41,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:58:41,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:41,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:58:41,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:58:41,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 172 [2023-01-28 06:58:41,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 57 transitions, 566 flow. Second operand has 6 states, 6 states have (on average 68.0) internal successors, (408), 6 states have internal predecessors, (408), 0 states have call successors, (0), 0 states 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:58:41,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:41,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 172 [2023-01-28 06:58:41,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:41,848 INFO L130 PetriNetUnfolder]: 284/524 cut-off events. [2023-01-28 06:58:41,848 INFO L131 PetriNetUnfolder]: For 1592/1606 co-relation queries the response was YES. [2023-01-28 06:58:41,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2613 conditions, 524 events. 284/524 cut-off events. For 1592/1606 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2207 event pairs, 59 based on Foata normal form. 12/533 useless extension candidates. Maximal degree in co-relation 2585. Up to 439 conditions per place. [2023-01-28 06:58:41,851 INFO L137 encePairwiseOnDemand]: 166/172 looper letters, 53 selfloop transitions, 15 changer transitions 0/73 dead transitions. [2023-01-28 06:58:41,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 803 flow [2023-01-28 06:58:41,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:58:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:58:41,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 299 transitions. [2023-01-28 06:58:41,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43459302325581395 [2023-01-28 06:58:41,853 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 299 transitions. [2023-01-28 06:58:41,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 299 transitions. [2023-01-28 06:58:41,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:41,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 299 transitions. [2023-01-28 06:58:41,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 74.75) internal successors, (299), 4 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:58:41,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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:58:41,855 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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:58:41,855 INFO L175 Difference]: Start difference. First operand has 53 places, 57 transitions, 566 flow. Second operand 4 states and 299 transitions. [2023-01-28 06:58:41,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 803 flow [2023-01-28 06:58:41,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 791 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:41,862 INFO L231 Difference]: Finished difference. Result has 56 places, 65 transitions, 687 flow [2023-01-28 06:58:41,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=687, PETRI_PLACES=56, PETRI_TRANSITIONS=65} [2023-01-28 06:58:41,862 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 30 predicate places. [2023-01-28 06:58:41,863 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 65 transitions, 687 flow [2023-01-28 06:58:41,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.0) internal successors, (408), 6 states have internal predecessors, (408), 0 states have call successors, (0), 0 states 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:58:41,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:41,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:41,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:58:41,863 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:41,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:41,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1018500935, now seen corresponding path program 2 times [2023-01-28 06:58:41,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:41,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276938945] [2023-01-28 06:58:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:41,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:42,461 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:58:42,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:42,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276938945] [2023-01-28 06:58:42,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276938945] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:42,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:42,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:58:42,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526077087] [2023-01-28 06:58:42,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:42,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:58:42,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:42,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:58:42,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:58:42,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 172 [2023-01-28 06:58:42,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 65 transitions, 687 flow. Second operand has 8 states, 8 states have (on average 67.5) internal successors, (540), 8 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:42,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:42,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 172 [2023-01-28 06:58:42,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:42,777 INFO L130 PetriNetUnfolder]: 315/588 cut-off events. [2023-01-28 06:58:42,777 INFO L131 PetriNetUnfolder]: For 2187/2206 co-relation queries the response was YES. [2023-01-28 06:58:42,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3183 conditions, 588 events. 315/588 cut-off events. For 2187/2206 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2639 event pairs, 47 based on Foata normal form. 12/596 useless extension candidates. Maximal degree in co-relation 3153. Up to 365 conditions per place. [2023-01-28 06:58:42,781 INFO L137 encePairwiseOnDemand]: 163/172 looper letters, 61 selfloop transitions, 52 changer transitions 0/118 dead transitions. [2023-01-28 06:58:42,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 118 transitions, 1406 flow [2023-01-28 06:58:42,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:58:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:58:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 580 transitions. [2023-01-28 06:58:42,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42151162790697677 [2023-01-28 06:58:42,783 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 580 transitions. [2023-01-28 06:58:42,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 580 transitions. [2023-01-28 06:58:42,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:42,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 580 transitions. [2023-01-28 06:58:42,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 72.5) internal successors, (580), 8 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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:58:42,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states 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:58:42,786 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states 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:58:42,786 INFO L175 Difference]: Start difference. First operand has 56 places, 65 transitions, 687 flow. Second operand 8 states and 580 transitions. [2023-01-28 06:58:42,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 118 transitions, 1406 flow [2023-01-28 06:58:42,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 118 transitions, 1395 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:58:42,795 INFO L231 Difference]: Finished difference. Result has 65 places, 100 transitions, 1295 flow [2023-01-28 06:58:42,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1295, PETRI_PLACES=65, PETRI_TRANSITIONS=100} [2023-01-28 06:58:42,797 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 39 predicate places. [2023-01-28 06:58:42,798 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 100 transitions, 1295 flow [2023-01-28 06:58:42,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 67.5) internal successors, (540), 8 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:42,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:42,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:42,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:58:42,798 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:42,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:42,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1020762695, now seen corresponding path program 3 times [2023-01-28 06:58:42,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:42,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450784613] [2023-01-28 06:58:42,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:42,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:43,676 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:58:43,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:43,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450784613] [2023-01-28 06:58:43,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450784613] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:43,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:43,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:58:43,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909207797] [2023-01-28 06:58:43,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:43,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:58:43,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:43,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:58:43,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:58:43,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 172 [2023-01-28 06:58:43,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 100 transitions, 1295 flow. Second operand has 8 states, 8 states have (on average 67.5) internal successors, (540), 8 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:43,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:43,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 172 [2023-01-28 06:58:43,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:44,018 INFO L130 PetriNetUnfolder]: 331/617 cut-off events. [2023-01-28 06:58:44,018 INFO L131 PetriNetUnfolder]: For 3359/3377 co-relation queries the response was YES. [2023-01-28 06:58:44,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3902 conditions, 617 events. 331/617 cut-off events. For 3359/3377 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2827 event pairs, 56 based on Foata normal form. 11/624 useless extension candidates. Maximal degree in co-relation 3868. Up to 450 conditions per place. [2023-01-28 06:58:44,022 INFO L137 encePairwiseOnDemand]: 163/172 looper letters, 78 selfloop transitions, 48 changer transitions 0/131 dead transitions. [2023-01-28 06:58:44,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 1844 flow [2023-01-28 06:58:44,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:58:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:58:44,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 579 transitions. [2023-01-28 06:58:44,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42078488372093026 [2023-01-28 06:58:44,025 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 579 transitions. [2023-01-28 06:58:44,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 579 transitions. [2023-01-28 06:58:44,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:44,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 579 transitions. [2023-01-28 06:58:44,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 72.375) internal successors, (579), 8 states have internal predecessors, (579), 0 states have call successors, (0), 0 states 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:58:44,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states 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:58:44,029 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states 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:58:44,029 INFO L175 Difference]: Start difference. First operand has 65 places, 100 transitions, 1295 flow. Second operand 8 states and 579 transitions. [2023-01-28 06:58:44,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 1844 flow [2023-01-28 06:58:44,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 131 transitions, 1798 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:44,041 INFO L231 Difference]: Finished difference. Result has 72 places, 115 transitions, 1635 flow [2023-01-28 06:58:44,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1635, PETRI_PLACES=72, PETRI_TRANSITIONS=115} [2023-01-28 06:58:44,042 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 46 predicate places. [2023-01-28 06:58:44,042 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 115 transitions, 1635 flow [2023-01-28 06:58:44,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 67.5) internal successors, (540), 8 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:44,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:44,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:44,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:58:44,042 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:44,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:44,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1019596475, now seen corresponding path program 4 times [2023-01-28 06:58:44,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:44,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689899885] [2023-01-28 06:58:44,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:44,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:44,520 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:58:44,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:44,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689899885] [2023-01-28 06:58:44,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689899885] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:44,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:44,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:58:44,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987751073] [2023-01-28 06:58:44,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:44,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:58:44,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:44,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:58:44,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:58:44,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 172 [2023-01-28 06:58:44,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 115 transitions, 1635 flow. Second operand has 8 states, 8 states have (on average 72.5) internal successors, (580), 8 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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:58:44,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:44,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 172 [2023-01-28 06:58:44,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:44,775 INFO L130 PetriNetUnfolder]: 354/658 cut-off events. [2023-01-28 06:58:44,775 INFO L131 PetriNetUnfolder]: For 4249/4267 co-relation queries the response was YES. [2023-01-28 06:58:44,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4502 conditions, 658 events. 354/658 cut-off events. For 4249/4267 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3070 event pairs, 64 based on Foata normal form. 11/665 useless extension candidates. Maximal degree in co-relation 4465. Up to 471 conditions per place. [2023-01-28 06:58:44,780 INFO L137 encePairwiseOnDemand]: 163/172 looper letters, 86 selfloop transitions, 62 changer transitions 0/153 dead transitions. [2023-01-28 06:58:44,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 153 transitions, 2362 flow [2023-01-28 06:58:44,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:58:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:58:44,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 623 transitions. [2023-01-28 06:58:44,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45276162790697677 [2023-01-28 06:58:44,783 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 623 transitions. [2023-01-28 06:58:44,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 623 transitions. [2023-01-28 06:58:44,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:44,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 623 transitions. [2023-01-28 06:58:44,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 77.875) internal successors, (623), 8 states have internal predecessors, (623), 0 states have call successors, (0), 0 states 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:58:44,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states 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:58:44,786 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states 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:58:44,787 INFO L175 Difference]: Start difference. First operand has 72 places, 115 transitions, 1635 flow. Second operand 8 states and 623 transitions. [2023-01-28 06:58:44,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 153 transitions, 2362 flow [2023-01-28 06:58:44,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 153 transitions, 2294 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-01-28 06:58:44,804 INFO L231 Difference]: Finished difference. Result has 80 places, 133 transitions, 2081 flow [2023-01-28 06:58:44,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=1579, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2081, PETRI_PLACES=80, PETRI_TRANSITIONS=133} [2023-01-28 06:58:44,805 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 54 predicate places. [2023-01-28 06:58:44,805 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 133 transitions, 2081 flow [2023-01-28 06:58:44,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 72.5) internal successors, (580), 8 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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:58:44,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:44,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:44,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:58:44,806 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:44,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:44,806 INFO L85 PathProgramCache]: Analyzing trace with hash -984811685, now seen corresponding path program 5 times [2023-01-28 06:58:44,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:44,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238236313] [2023-01-28 06:58:44,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:44,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:45,378 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:58:45,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:45,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238236313] [2023-01-28 06:58:45,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238236313] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:45,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:45,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:58:45,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716555890] [2023-01-28 06:58:45,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:45,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:58:45,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:45,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:58:45,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:58:45,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 172 [2023-01-28 06:58:45,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 133 transitions, 2081 flow. Second operand has 8 states, 8 states have (on average 67.5) internal successors, (540), 8 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:45,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:45,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 172 [2023-01-28 06:58:45,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:45,870 INFO L130 PetriNetUnfolder]: 448/854 cut-off events. [2023-01-28 06:58:45,870 INFO L131 PetriNetUnfolder]: For 6818/6843 co-relation queries the response was YES. [2023-01-28 06:58:45,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5938 conditions, 854 events. 448/854 cut-off events. For 6818/6843 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4408 event pairs, 90 based on Foata normal form. 24/874 useless extension candidates. Maximal degree in co-relation 5898. Up to 483 conditions per place. [2023-01-28 06:58:45,876 INFO L137 encePairwiseOnDemand]: 163/172 looper letters, 136 selfloop transitions, 54 changer transitions 0/195 dead transitions. [2023-01-28 06:58:45,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 195 transitions, 3153 flow [2023-01-28 06:58:45,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-28 06:58:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-28 06:58:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 932 transitions. [2023-01-28 06:58:45,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41681574239713776 [2023-01-28 06:58:45,879 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 932 transitions. [2023-01-28 06:58:45,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 932 transitions. [2023-01-28 06:58:45,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:45,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 932 transitions. [2023-01-28 06:58:45,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 71.6923076923077) internal successors, (932), 13 states have internal predecessors, (932), 0 states have call successors, (0), 0 states 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:58:45,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 172.0) internal successors, (2408), 14 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states 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:58:45,884 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 172.0) internal successors, (2408), 14 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states 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:58:45,884 INFO L175 Difference]: Start difference. First operand has 80 places, 133 transitions, 2081 flow. Second operand 13 states and 932 transitions. [2023-01-28 06:58:45,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 195 transitions, 3153 flow [2023-01-28 06:58:45,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 195 transitions, 3060 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-01-28 06:58:45,902 INFO L231 Difference]: Finished difference. Result has 93 places, 163 transitions, 2658 flow [2023-01-28 06:58:45,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=1994, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2658, PETRI_PLACES=93, PETRI_TRANSITIONS=163} [2023-01-28 06:58:45,903 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 67 predicate places. [2023-01-28 06:58:45,903 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 163 transitions, 2658 flow [2023-01-28 06:58:45,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 67.5) internal successors, (540), 8 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:45,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:45,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:45,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:58:45,904 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:45,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:45,904 INFO L85 PathProgramCache]: Analyzing trace with hash -982521095, now seen corresponding path program 6 times [2023-01-28 06:58:45,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:45,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011744948] [2023-01-28 06:58:45,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:45,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:46,713 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:58:46,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:46,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011744948] [2023-01-28 06:58:46,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011744948] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:46,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:46,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:58:46,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960567291] [2023-01-28 06:58:46,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:46,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:58:46,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:46,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:58:46,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:58:46,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 172 [2023-01-28 06:58:46,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 163 transitions, 2658 flow. Second operand has 8 states, 8 states have (on average 68.5) internal successors, (548), 8 states have internal predecessors, (548), 0 states have call successors, (0), 0 states 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:58:46,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:46,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 172 [2023-01-28 06:58:46,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:46,897 INFO L130 PetriNetUnfolder]: 433/829 cut-off events. [2023-01-28 06:58:46,897 INFO L131 PetriNetUnfolder]: For 8320/8347 co-relation queries the response was YES. [2023-01-28 06:58:46,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5986 conditions, 829 events. 433/829 cut-off events. For 8320/8347 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4270 event pairs, 93 based on Foata normal form. 32/857 useless extension candidates. Maximal degree in co-relation 5940. Up to 635 conditions per place. [2023-01-28 06:58:46,904 INFO L137 encePairwiseOnDemand]: 165/172 looper letters, 145 selfloop transitions, 35 changer transitions 0/185 dead transitions. [2023-01-28 06:58:46,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 185 transitions, 3275 flow [2023-01-28 06:58:46,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:58:46,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:58:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 373 transitions. [2023-01-28 06:58:46,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43372093023255814 [2023-01-28 06:58:46,906 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 373 transitions. [2023-01-28 06:58:46,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 373 transitions. [2023-01-28 06:58:46,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:46,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 373 transitions. [2023-01-28 06:58:46,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 74.6) internal successors, (373), 5 states have internal predecessors, (373), 0 states have call successors, (0), 0 states 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:58:46,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states 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:58:46,909 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states 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:58:46,909 INFO L175 Difference]: Start difference. First operand has 93 places, 163 transitions, 2658 flow. Second operand 5 states and 373 transitions. [2023-01-28 06:58:46,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 185 transitions, 3275 flow [2023-01-28 06:58:46,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 185 transitions, 3130 flow, removed 70 selfloop flow, removed 1 redundant places. [2023-01-28 06:58:46,931 INFO L231 Difference]: Finished difference. Result has 97 places, 169 transitions, 2731 flow [2023-01-28 06:58:46,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=2529, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2731, PETRI_PLACES=97, PETRI_TRANSITIONS=169} [2023-01-28 06:58:46,932 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 71 predicate places. [2023-01-28 06:58:46,932 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 169 transitions, 2731 flow [2023-01-28 06:58:46,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 68.5) internal successors, (548), 8 states have internal predecessors, (548), 0 states have call successors, (0), 0 states 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:58:46,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:46,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:46,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:58:46,933 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:46,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:46,933 INFO L85 PathProgramCache]: Analyzing trace with hash -469150277, now seen corresponding path program 1 times [2023-01-28 06:58:46,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:46,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963024481] [2023-01-28 06:58:46,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:46,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:47,842 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:58:47,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:47,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963024481] [2023-01-28 06:58:47,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963024481] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:47,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:47,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:58:47,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540514075] [2023-01-28 06:58:47,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:47,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:58:47,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:47,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:58:47,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:58:47,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 172 [2023-01-28 06:58:47,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 169 transitions, 2731 flow. Second operand has 8 states, 8 states have (on average 71.625) internal successors, (573), 8 states have internal predecessors, (573), 0 states have call successors, (0), 0 states 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:58:47,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:47,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 172 [2023-01-28 06:58:47,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:48,057 INFO L130 PetriNetUnfolder]: 450/866 cut-off events. [2023-01-28 06:58:48,058 INFO L131 PetriNetUnfolder]: For 9037/9081 co-relation queries the response was YES. [2023-01-28 06:58:48,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5974 conditions, 866 events. 450/866 cut-off events. For 9037/9081 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4568 event pairs, 78 based on Foata normal form. 58/915 useless extension candidates. Maximal degree in co-relation 5926. Up to 443 conditions per place. [2023-01-28 06:58:48,063 INFO L137 encePairwiseOnDemand]: 167/172 looper letters, 100 selfloop transitions, 38 changer transitions 43/186 dead transitions. [2023-01-28 06:58:48,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 186 transitions, 3230 flow [2023-01-28 06:58:48,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:58:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:58:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2023-01-28 06:58:48,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44883720930232557 [2023-01-28 06:58:48,064 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 386 transitions. [2023-01-28 06:58:48,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 386 transitions. [2023-01-28 06:58:48,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:48,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 386 transitions. [2023-01-28 06:58:48,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 77.2) internal successors, (386), 5 states have internal predecessors, (386), 0 states have call successors, (0), 0 states 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:58:48,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states 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:58:48,066 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states 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:58:48,067 INFO L175 Difference]: Start difference. First operand has 97 places, 169 transitions, 2731 flow. Second operand 5 states and 386 transitions. [2023-01-28 06:58:48,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 186 transitions, 3230 flow [2023-01-28 06:58:48,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 186 transitions, 3170 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-01-28 06:58:48,088 INFO L231 Difference]: Finished difference. Result has 101 places, 138 transitions, 2327 flow [2023-01-28 06:58:48,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=2671, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2327, PETRI_PLACES=101, PETRI_TRANSITIONS=138} [2023-01-28 06:58:48,089 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 75 predicate places. [2023-01-28 06:58:48,089 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 138 transitions, 2327 flow [2023-01-28 06:58:48,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 71.625) internal successors, (573), 8 states have internal predecessors, (573), 0 states have call successors, (0), 0 states 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:58:48,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:48,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:48,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 06:58:48,089 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:48,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:48,090 INFO L85 PathProgramCache]: Analyzing trace with hash -183162502, now seen corresponding path program 1 times [2023-01-28 06:58:48,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:48,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987714131] [2023-01-28 06:58:48,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:48,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:48,587 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:58:48,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:48,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987714131] [2023-01-28 06:58:48,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987714131] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:48,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:48,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:58:48,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15164498] [2023-01-28 06:58:48,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:48,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:58:48,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:48,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:58:48,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:58:48,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 172 [2023-01-28 06:58:48,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 138 transitions, 2327 flow. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states 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:58:48,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:48,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 172 [2023-01-28 06:58:48,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:48,738 INFO L130 PetriNetUnfolder]: 361/732 cut-off events. [2023-01-28 06:58:48,738 INFO L131 PetriNetUnfolder]: For 7875/7875 co-relation queries the response was YES. [2023-01-28 06:58:48,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5172 conditions, 732 events. 361/732 cut-off events. For 7875/7875 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3901 event pairs, 58 based on Foata normal form. 20/752 useless extension candidates. Maximal degree in co-relation 5121. Up to 429 conditions per place. [2023-01-28 06:58:48,742 INFO L137 encePairwiseOnDemand]: 166/172 looper letters, 34 selfloop transitions, 7 changer transitions 146/187 dead transitions. [2023-01-28 06:58:48,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 187 transitions, 3298 flow [2023-01-28 06:58:48,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:58:48,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:58:48,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 292 transitions. [2023-01-28 06:58:48,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42441860465116277 [2023-01-28 06:58:48,743 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 292 transitions. [2023-01-28 06:58:48,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 292 transitions. [2023-01-28 06:58:48,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:48,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 292 transitions. [2023-01-28 06:58:48,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states 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:58:48,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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:58:48,745 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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:58:48,745 INFO L175 Difference]: Start difference. First operand has 101 places, 138 transitions, 2327 flow. Second operand 4 states and 292 transitions. [2023-01-28 06:58:48,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 187 transitions, 3298 flow [2023-01-28 06:58:48,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 187 transitions, 3247 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-01-28 06:58:48,771 INFO L231 Difference]: Finished difference. Result has 100 places, 34 transitions, 415 flow [2023-01-28 06:58:48,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=2289, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=415, PETRI_PLACES=100, PETRI_TRANSITIONS=34} [2023-01-28 06:58:48,771 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 74 predicate places. [2023-01-28 06:58:48,771 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 34 transitions, 415 flow [2023-01-28 06:58:48,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states 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:58:48,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:48,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:48,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 06:58:48,772 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:48,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:48,772 INFO L85 PathProgramCache]: Analyzing trace with hash 572121220, now seen corresponding path program 2 times [2023-01-28 06:58:48,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:48,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698034465] [2023-01-28 06:58:48,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:48,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:48,966 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:58:48,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:48,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698034465] [2023-01-28 06:58:48,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698034465] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:48,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:48,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:58:48,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962018504] [2023-01-28 06:58:48,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:48,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:58:48,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:48,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:58:48,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:58:48,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 172 [2023-01-28 06:58:48,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 34 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 states 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:58:48,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:48,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 172 [2023-01-28 06:58:48,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:49,026 INFO L130 PetriNetUnfolder]: 35/101 cut-off events. [2023-01-28 06:58:49,026 INFO L131 PetriNetUnfolder]: For 1139/1141 co-relation queries the response was YES. [2023-01-28 06:58:49,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 101 events. 35/101 cut-off events. For 1139/1141 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 307 event pairs, 10 based on Foata normal form. 18/119 useless extension candidates. Maximal degree in co-relation 574. Up to 41 conditions per place. [2023-01-28 06:58:49,027 INFO L137 encePairwiseOnDemand]: 167/172 looper letters, 23 selfloop transitions, 4 changer transitions 1/30 dead transitions. [2023-01-28 06:58:49,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 30 transitions, 395 flow [2023-01-28 06:58:49,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:58:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:58:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 310 transitions. [2023-01-28 06:58:49,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45058139534883723 [2023-01-28 06:58:49,028 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 310 transitions. [2023-01-28 06:58:49,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 310 transitions. [2023-01-28 06:58:49,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:49,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 310 transitions. [2023-01-28 06:58:49,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states 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:58:49,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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:58:49,030 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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:58:49,030 INFO L175 Difference]: Start difference. First operand has 100 places, 34 transitions, 415 flow. Second operand 4 states and 310 transitions. [2023-01-28 06:58:49,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 30 transitions, 395 flow [2023-01-28 06:58:49,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 30 transitions, 243 flow, removed 40 selfloop flow, removed 35 redundant places. [2023-01-28 06:58:49,032 INFO L231 Difference]: Finished difference. Result has 48 places, 23 transitions, 161 flow [2023-01-28 06:58:49,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=48, PETRI_TRANSITIONS=23} [2023-01-28 06:58:49,033 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 22 predicate places. [2023-01-28 06:58:49,033 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 23 transitions, 161 flow [2023-01-28 06:58:49,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 states 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:58:49,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:49,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:49,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 06:58:49,033 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:49,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:49,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1083642294, now seen corresponding path program 1 times [2023-01-28 06:58:49,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:49,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036992790] [2023-01-28 06:58:49,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:49,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:49,360 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:58:49,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:49,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036992790] [2023-01-28 06:58:49,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036992790] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:49,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:49,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:58:49,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984911266] [2023-01-28 06:58:49,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:49,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:58:49,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:49,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:58:49,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:58:49,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 172 [2023-01-28 06:58:49,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 23 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 0 states have call successors, (0), 0 states 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:58:49,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:49,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 172 [2023-01-28 06:58:49,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:49,417 INFO L130 PetriNetUnfolder]: 10/49 cut-off events. [2023-01-28 06:58:49,417 INFO L131 PetriNetUnfolder]: For 205/206 co-relation queries the response was YES. [2023-01-28 06:58:49,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 49 events. 10/49 cut-off events. For 205/206 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 104 event pairs, 2 based on Foata normal form. 8/57 useless extension candidates. Maximal degree in co-relation 217. Up to 17 conditions per place. [2023-01-28 06:58:49,418 INFO L137 encePairwiseOnDemand]: 167/172 looper letters, 15 selfloop transitions, 6 changer transitions 1/24 dead transitions. [2023-01-28 06:58:49,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 24 transitions, 212 flow [2023-01-28 06:58:49,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:58:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:58:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 377 transitions. [2023-01-28 06:58:49,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4383720930232558 [2023-01-28 06:58:49,419 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 377 transitions. [2023-01-28 06:58:49,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 377 transitions. [2023-01-28 06:58:49,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:49,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 377 transitions. [2023-01-28 06:58:49,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 0 states have call successors, (0), 0 states 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:58:49,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states 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:58:49,421 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states 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:58:49,421 INFO L175 Difference]: Start difference. First operand has 48 places, 23 transitions, 161 flow. Second operand 5 states and 377 transitions. [2023-01-28 06:58:49,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 24 transitions, 212 flow [2023-01-28 06:58:49,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 24 transitions, 147 flow, removed 17 selfloop flow, removed 11 redundant places. [2023-01-28 06:58:49,422 INFO L231 Difference]: Finished difference. Result has 43 places, 21 transitions, 112 flow [2023-01-28 06:58:49,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=43, PETRI_TRANSITIONS=21} [2023-01-28 06:58:49,422 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2023-01-28 06:58:49,422 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 21 transitions, 112 flow [2023-01-28 06:58:49,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 0 states have call successors, (0), 0 states 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:58:49,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:49,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:49,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 06:58:49,423 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:49,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:49,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1008055723, now seen corresponding path program 1 times [2023-01-28 06:58:49,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:49,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130701421] [2023-01-28 06:58:49,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:49,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:58:49,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:58:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:58:49,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:58:49,489 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:58:49,490 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 06:58:49,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 06:58:49,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 06:58:49,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 06:58:49,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 06:58:49,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-28 06:58:49,491 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:49,495 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:58:49,495 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:58:49,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:58:49 BasicIcfg [2023-01-28 06:58:49,523 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:58:49,523 INFO L158 Benchmark]: Toolchain (without parser) took 18251.13ms. Allocated memory was 778.0MB in the beginning and 1.4GB in the end (delta: 572.5MB). Free memory was 725.0MB in the beginning and 606.5MB in the end (delta: 118.4MB). Peak memory consumption was 692.5MB. Max. memory is 16.0GB. [2023-01-28 06:58:49,523 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 444.6MB. Free memory is still 392.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:58:49,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.32ms. Allocated memory is still 778.0MB. Free memory was 724.6MB in the beginning and 699.8MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-28 06:58:49,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.34ms. Allocated memory is still 778.0MB. Free memory was 699.8MB in the beginning and 697.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:58:49,524 INFO L158 Benchmark]: Boogie Preprocessor took 46.01ms. Allocated memory is still 778.0MB. Free memory was 697.2MB in the beginning and 695.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:58:49,524 INFO L158 Benchmark]: RCFGBuilder took 637.41ms. Allocated memory is still 778.0MB. Free memory was 695.1MB in the beginning and 725.6MB in the end (delta: -30.6MB). Peak memory consumption was 40.8MB. Max. memory is 16.0GB. [2023-01-28 06:58:49,524 INFO L158 Benchmark]: TraceAbstraction took 17025.68ms. Allocated memory was 778.0MB in the beginning and 1.4GB in the end (delta: 572.5MB). Free memory was 724.6MB in the beginning and 606.5MB in the end (delta: 118.1MB). Peak memory consumption was 689.5MB. Max. memory is 16.0GB. [2023-01-28 06:58:49,525 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.15ms. Allocated memory is still 444.6MB. Free memory is still 392.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 482.32ms. Allocated memory is still 778.0MB. Free memory was 724.6MB in the beginning and 699.8MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.34ms. Allocated memory is still 778.0MB. Free memory was 699.8MB in the beginning and 697.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 46.01ms. Allocated memory is still 778.0MB. Free memory was 697.2MB in the beginning and 695.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 637.41ms. Allocated memory is still 778.0MB. Free memory was 695.1MB in the beginning and 725.6MB in the end (delta: -30.6MB). Peak memory consumption was 40.8MB. Max. memory is 16.0GB. * TraceAbstraction took 17025.68ms. Allocated memory was 778.0MB in the beginning and 1.4GB in the end (delta: 572.5MB). Free memory was 724.6MB in the beginning and 606.5MB in the end (delta: 118.1MB). Peak memory consumption was 689.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 93 PlacesBefore, 26 PlacesAfterwards, 88 TransitionsBefore, 19 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 82 TotalNumberOfCompositions, 3166 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1375, independent: 1234, independent conditional: 0, independent unconditional: 1234, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 679, independent: 641, independent conditional: 0, independent unconditional: 641, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1375, independent: 593, independent conditional: 0, independent unconditional: 593, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 679, unknown conditional: 0, unknown unconditional: 679] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L826] 0 pthread_t t1585; [L827] FCALL, FORK 0 pthread_create(&t1585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1585, ((void *)0), P0, ((void *)0))=-1, t1585={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L828] 0 pthread_t t1586; [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 2 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L829] FCALL, FORK 0 pthread_create(&t1586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1586, ((void *)0), P1, ((void *)0))=0, t1585={5:0}, t1586={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L788] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 2 y$flush_delayed = weak$$choice2 [L791] 2 y$mem_tmp = y [L792] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L793] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L794] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L795] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L796] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L798] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] 2 __unbuffered_p1_EBX = y [L800] 2 y = y$flush_delayed ? y$mem_tmp : y [L801] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L804] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1585={5:0}, t1586={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1585={5:0}, t1586={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 y$flush_delayed = weak$$choice2 [L845] 0 y$mem_tmp = y [L846] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L847] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L854] 0 y = y$flush_delayed ? y$mem_tmp : y [L855] 0 y$flush_delayed = (_Bool)0 [L857] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 827]: 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: 829]: 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 5 procedures, 110 locations, 5 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: 16.9s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 251 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 199 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1187 IncrementalHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 199 mSolverCounterUnsat, 19 mSDtfsCounter, 1187 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2731occurred in iteration=12, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 3636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 06:58:49,539 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...