/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:13:00,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:13:00,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:13:00,500 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:13:00,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:13:00,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:13:00,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:13:00,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:13:00,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:13:00,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:13:00,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:13:00,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:13:00,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:13:00,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:13:00,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:13:00,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:13:00,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:13:00,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:13:00,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:13:00,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:13:00,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:13:00,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:13:00,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:13:00,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:13:00,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:13:00,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:13:00,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:13:00,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:13:00,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:13:00,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:13:00,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:13:00,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:13:00,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:13:00,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:13:00,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:13:00,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:13:00,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:13:00,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:13:00,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:13:00,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:13:00,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:13:00,548 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-27 18:13:00,576 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:13:00,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:13:00,578 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:13:00,578 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:13:00,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:13:00,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:13:00,579 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:13:00,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:13:00,579 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:13:00,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:13:00,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:13:00,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:13:00,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:13:00,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:13:00,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:13:00,580 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:13:00,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:13:00,581 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:13:00,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:13:00,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:13:00,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:13:00,581 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:13:00,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:13:00,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:13:00,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:13:00,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:13:00,582 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:13:00,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:13:00,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:13:00,582 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:13:00,583 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:13:00,583 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 [2023-01-27 18:13:00,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:13:00,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:13:00,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:13:00,814 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:13:00,814 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:13:00,815 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-01-27 18:13:01,927 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:13:02,188 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:13:02,188 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-01-27 18:13:02,205 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98632a43a/bdef009325fe40aea9c40fa5671f141e/FLAG7016987e6 [2023-01-27 18:13:02,216 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98632a43a/bdef009325fe40aea9c40fa5671f141e [2023-01-27 18:13:02,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:13:02,220 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:13:02,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:13:02,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:13:02,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:13:02,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:13:02" (1/1) ... [2023-01-27 18:13:02,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c0474c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:02, skipping insertion in model container [2023-01-27 18:13:02,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:13:02" (1/1) ... [2023-01-27 18:13:02,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:13:02,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:13:02,395 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/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-01-27 18:13:02,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:13:02,582 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:13:02,592 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/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-01-27 18:13:02,642 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:13:02,663 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:13:02,664 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:13:02,669 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:13:02,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:02 WrapperNode [2023-01-27 18:13:02,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:13:02,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:13:02,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:13:02,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:13:02,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:02" (1/1) ... [2023-01-27 18:13:02,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:02" (1/1) ... [2023-01-27 18:13:02,723 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2023-01-27 18:13:02,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:13:02,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:13:02,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:13:02,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:13:02,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:02" (1/1) ... [2023-01-27 18:13:02,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:02" (1/1) ... [2023-01-27 18:13:02,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:02" (1/1) ... [2023-01-27 18:13:02,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:02" (1/1) ... [2023-01-27 18:13:02,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:02" (1/1) ... [2023-01-27 18:13:02,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:02" (1/1) ... [2023-01-27 18:13:02,744 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:02" (1/1) ... [2023-01-27 18:13:02,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:02" (1/1) ... [2023-01-27 18:13:02,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:13:02,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:13:02,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:13:02,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:13:02,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:02" (1/1) ... [2023-01-27 18:13:02,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:13:02,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:13:02,789 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-27 18:13:02,803 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-27 18:13:02,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:13:02,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:13:02,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:13:02,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:13:02,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:13:02,821 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:13:02,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:13:02,821 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:13:02,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:13:02,822 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:13:02,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:13:02,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:13:02,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:13:02,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:13:02,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:13:02,823 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:13:02,954 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:13:02,956 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:13:03,248 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:13:03,396 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:13:03,399 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:13:03,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:13:03 BoogieIcfgContainer [2023-01-27 18:13:03,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:13:03,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:13:03,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:13:03,405 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:13:03,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:13:02" (1/3) ... [2023-01-27 18:13:03,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7763bd98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:13:03, skipping insertion in model container [2023-01-27 18:13:03,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:13:02" (2/3) ... [2023-01-27 18:13:03,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7763bd98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:13:03, skipping insertion in model container [2023-01-27 18:13:03,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:13:03" (3/3) ... [2023-01-27 18:13:03,407 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-01-27 18:13:03,422 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:13:03,422 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:13:03,422 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:13:03,480 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:13:03,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2023-01-27 18:13:03,577 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2023-01-27 18:13:03,578 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:13:03,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-01-27 18:13:03,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2023-01-27 18:13:03,588 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2023-01-27 18:13:03,591 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:13:03,610 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2023-01-27 18:13:03,613 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2023-01-27 18:13:03,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2023-01-27 18:13:03,649 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2023-01-27 18:13:03,649 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:13:03,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-01-27 18:13:03,653 INFO L119 LiptonReduction]: Number of co-enabled transitions 1944 [2023-01-27 18:13:07,818 INFO L134 LiptonReduction]: Checked pairs total: 5133 [2023-01-27 18:13:07,818 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-01-27 18:13:07,834 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:13:07,840 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;@7b160be3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:13:07,840 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:13:07,843 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2023-01-27 18:13:07,844 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:13:07,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:07,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:07,845 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:13:07,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:07,849 INFO L85 PathProgramCache]: Analyzing trace with hash -25306967, now seen corresponding path program 1 times [2023-01-27 18:13:07,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:07,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466964591] [2023-01-27 18:13:07,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:07,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:08,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-27 18:13:08,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:08,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466964591] [2023-01-27 18:13:08,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466964591] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:08,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:08,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:13:08,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841510137] [2023-01-27 18:13:08,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:08,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:13:08,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:08,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:13:08,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:13:08,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 206 [2023-01-27 18:13:08,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:08,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:08,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 206 [2023-01-27 18:13:08,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:08,537 INFO L130 PetriNetUnfolder]: 511/910 cut-off events. [2023-01-27 18:13:08,537 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-01-27 18:13:08,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1729 conditions, 910 events. 511/910 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4702 event pairs, 112 based on Foata normal form. 0/858 useless extension candidates. Maximal degree in co-relation 1718. Up to 580 conditions per place. [2023-01-27 18:13:08,550 INFO L137 encePairwiseOnDemand]: 203/206 looper letters, 23 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2023-01-27 18:13:08,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 125 flow [2023-01-27 18:13:08,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:13:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:13:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-01-27 18:13:08,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161812297734628 [2023-01-27 18:13:08,571 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-01-27 18:13:08,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-01-27 18:13:08,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:08,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-01-27 18:13:08,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:08,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:08,587 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:08,589 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 319 transitions. [2023-01-27 18:13:08,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 125 flow [2023-01-27 18:13:08,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:13:08,594 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-01-27 18:13:08,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-01-27 18:13:08,600 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-01-27 18:13:08,601 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-01-27 18:13:08,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:08,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:08,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:08,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:13:08,602 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:13:08,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:08,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1449864535, now seen corresponding path program 1 times [2023-01-27 18:13:08,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:08,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063566343] [2023-01-27 18:13:08,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:08,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:09,664 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-27 18:13:09,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:09,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063566343] [2023-01-27 18:13:09,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063566343] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:09,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:09,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:13:09,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789971754] [2023-01-27 18:13:09,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:09,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:13:09,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:09,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:13:09,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:13:09,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 206 [2023-01-27 18:13:09,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:09,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:09,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 206 [2023-01-27 18:13:09,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:09,951 INFO L130 PetriNetUnfolder]: 1445/2202 cut-off events. [2023-01-27 18:13:09,951 INFO L131 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2023-01-27 18:13:09,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4586 conditions, 2202 events. 1445/2202 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10494 event pairs, 115 based on Foata normal form. 72/2274 useless extension candidates. Maximal degree in co-relation 4576. Up to 1639 conditions per place. [2023-01-27 18:13:09,964 INFO L137 encePairwiseOnDemand]: 196/206 looper letters, 38 selfloop transitions, 11 changer transitions 0/49 dead transitions. [2023-01-27 18:13:09,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 49 transitions, 216 flow [2023-01-27 18:13:09,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:13:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:13:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 383 transitions. [2023-01-27 18:13:09,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46480582524271846 [2023-01-27 18:13:09,966 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 383 transitions. [2023-01-27 18:13:09,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 383 transitions. [2023-01-27 18:13:09,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:09,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 383 transitions. [2023-01-27 18:13:09,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:09,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:09,970 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:09,971 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 4 states and 383 transitions. [2023-01-27 18:13:09,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 49 transitions, 216 flow [2023-01-27 18:13:09,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:13:09,972 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 118 flow [2023-01-27 18:13:09,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2023-01-27 18:13:09,973 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2023-01-27 18:13:09,973 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 118 flow [2023-01-27 18:13:09,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:09,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:09,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:09,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:13:09,974 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:13:09,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:09,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1996126538, now seen corresponding path program 1 times [2023-01-27 18:13:09,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:09,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867535523] [2023-01-27 18:13:09,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:09,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:10,207 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-27 18:13:10,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:10,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867535523] [2023-01-27 18:13:10,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867535523] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:10,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:10,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:13:10,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165389796] [2023-01-27 18:13:10,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:10,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:13:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:10,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:13:10,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:13:10,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 206 [2023-01-27 18:13:10,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:10,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:10,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 206 [2023-01-27 18:13:10,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:10,421 INFO L130 PetriNetUnfolder]: 890/1432 cut-off events. [2023-01-27 18:13:10,421 INFO L131 PetriNetUnfolder]: For 593/597 co-relation queries the response was YES. [2023-01-27 18:13:10,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3929 conditions, 1432 events. 890/1432 cut-off events. For 593/597 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6912 event pairs, 258 based on Foata normal form. 29/1445 useless extension candidates. Maximal degree in co-relation 3917. Up to 861 conditions per place. [2023-01-27 18:13:10,431 INFO L137 encePairwiseOnDemand]: 203/206 looper letters, 33 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2023-01-27 18:13:10,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 230 flow [2023-01-27 18:13:10,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:13:10,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:13:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-01-27 18:13:10,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080906148867314 [2023-01-27 18:13:10,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-01-27 18:13:10,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-01-27 18:13:10,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:10,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-01-27 18:13:10,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:10,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:10,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:10,436 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 118 flow. Second operand 3 states and 314 transitions. [2023-01-27 18:13:10,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 230 flow [2023-01-27 18:13:10,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 230 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 18:13:10,439 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 129 flow [2023-01-27 18:13:10,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2023-01-27 18:13:10,440 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-01-27 18:13:10,443 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 129 flow [2023-01-27 18:13:10,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:10,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:10,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:10,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:13:10,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:13:10,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:10,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1514062025, now seen corresponding path program 1 times [2023-01-27 18:13:10,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:10,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611253483] [2023-01-27 18:13:10,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:10,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:10,902 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-27 18:13:10,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:10,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611253483] [2023-01-27 18:13:10,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611253483] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:10,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:10,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:13:10,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461738005] [2023-01-27 18:13:10,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:10,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:13:10,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:10,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:13:10,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:13:10,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 206 [2023-01-27 18:13:10,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:10,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:10,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 206 [2023-01-27 18:13:10,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:11,136 INFO L130 PetriNetUnfolder]: 1000/1658 cut-off events. [2023-01-27 18:13:11,136 INFO L131 PetriNetUnfolder]: For 818/826 co-relation queries the response was YES. [2023-01-27 18:13:11,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4622 conditions, 1658 events. 1000/1658 cut-off events. For 818/826 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8243 event pairs, 254 based on Foata normal form. 17/1666 useless extension candidates. Maximal degree in co-relation 4607. Up to 1161 conditions per place. [2023-01-27 18:13:11,145 INFO L137 encePairwiseOnDemand]: 201/206 looper letters, 41 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2023-01-27 18:13:11,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 54 transitions, 311 flow [2023-01-27 18:13:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:13:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:13:11,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 399 transitions. [2023-01-27 18:13:11,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4842233009708738 [2023-01-27 18:13:11,147 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 399 transitions. [2023-01-27 18:13:11,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 399 transitions. [2023-01-27 18:13:11,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:11,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 399 transitions. [2023-01-27 18:13:11,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:11,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:11,151 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:11,151 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 129 flow. Second operand 4 states and 399 transitions. [2023-01-27 18:13:11,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 54 transitions, 311 flow [2023-01-27 18:13:11,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 305 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:13:11,155 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 180 flow [2023-01-27 18:13:11,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2023-01-27 18:13:11,156 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-01-27 18:13:11,156 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 180 flow [2023-01-27 18:13:11,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:11,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:11,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:11,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:13:11,157 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:13:11,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:11,158 INFO L85 PathProgramCache]: Analyzing trace with hash 495513099, now seen corresponding path program 1 times [2023-01-27 18:13:11,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:11,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338155623] [2023-01-27 18:13:11,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:11,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:11,518 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-27 18:13:11,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:11,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338155623] [2023-01-27 18:13:11,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338155623] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:11,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:11,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:13:11,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912376156] [2023-01-27 18:13:11,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:11,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:13:11,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:11,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:13:11,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:13:11,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 206 [2023-01-27 18:13:11,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:11,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:11,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 206 [2023-01-27 18:13:11,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:11,806 INFO L130 PetriNetUnfolder]: 1107/1802 cut-off events. [2023-01-27 18:13:11,807 INFO L131 PetriNetUnfolder]: For 1388/1433 co-relation queries the response was YES. [2023-01-27 18:13:11,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5464 conditions, 1802 events. 1107/1802 cut-off events. For 1388/1433 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9060 event pairs, 177 based on Foata normal form. 17/1788 useless extension candidates. Maximal degree in co-relation 5447. Up to 1209 conditions per place. [2023-01-27 18:13:11,817 INFO L137 encePairwiseOnDemand]: 199/206 looper letters, 43 selfloop transitions, 18 changer transitions 0/67 dead transitions. [2023-01-27 18:13:11,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 67 transitions, 422 flow [2023-01-27 18:13:11,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:13:11,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:13:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2023-01-27 18:13:11,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4912621359223301 [2023-01-27 18:13:11,819 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 506 transitions. [2023-01-27 18:13:11,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 506 transitions. [2023-01-27 18:13:11,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:11,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 506 transitions. [2023-01-27 18:13:11,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:11,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:11,823 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:11,823 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 180 flow. Second operand 5 states and 506 transitions. [2023-01-27 18:13:11,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 67 transitions, 422 flow [2023-01-27 18:13:11,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 67 transitions, 422 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 18:13:11,827 INFO L231 Difference]: Finished difference. Result has 45 places, 48 transitions, 315 flow [2023-01-27 18:13:11,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=315, PETRI_PLACES=45, PETRI_TRANSITIONS=48} [2023-01-27 18:13:11,828 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2023-01-27 18:13:11,828 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 48 transitions, 315 flow [2023-01-27 18:13:11,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:11,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:11,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:11,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:13:11,829 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:13:11,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:11,830 INFO L85 PathProgramCache]: Analyzing trace with hash 405075249, now seen corresponding path program 2 times [2023-01-27 18:13:11,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:11,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903432909] [2023-01-27 18:13:11,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:11,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:12,323 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-27 18:13:12,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:12,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903432909] [2023-01-27 18:13:12,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903432909] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:12,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:12,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:13:12,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003892625] [2023-01-27 18:13:12,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:12,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:13:12,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:12,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:13:12,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:13:12,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 206 [2023-01-27 18:13:12,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 48 transitions, 315 flow. Second operand has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:12,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:12,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 206 [2023-01-27 18:13:12,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:12,622 INFO L130 PetriNetUnfolder]: 1131/1844 cut-off events. [2023-01-27 18:13:12,623 INFO L131 PetriNetUnfolder]: For 3535/3592 co-relation queries the response was YES. [2023-01-27 18:13:12,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6746 conditions, 1844 events. 1131/1844 cut-off events. For 3535/3592 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9343 event pairs, 177 based on Foata normal form. 27/1840 useless extension candidates. Maximal degree in co-relation 6725. Up to 1211 conditions per place. [2023-01-27 18:13:12,635 INFO L137 encePairwiseOnDemand]: 199/206 looper letters, 45 selfloop transitions, 20 changer transitions 0/71 dead transitions. [2023-01-27 18:13:12,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 71 transitions, 553 flow [2023-01-27 18:13:12,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:13:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:13:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-01-27 18:13:12,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48640776699029126 [2023-01-27 18:13:12,638 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-01-27 18:13:12,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-01-27 18:13:12,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:12,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-01-27 18:13:12,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:12,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:12,643 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:12,643 INFO L175 Difference]: Start difference. First operand has 45 places, 48 transitions, 315 flow. Second operand 5 states and 501 transitions. [2023-01-27 18:13:12,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 71 transitions, 553 flow [2023-01-27 18:13:12,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 534 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-01-27 18:13:12,652 INFO L231 Difference]: Finished difference. Result has 49 places, 52 transitions, 390 flow [2023-01-27 18:13:12,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=390, PETRI_PLACES=49, PETRI_TRANSITIONS=52} [2023-01-27 18:13:12,654 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2023-01-27 18:13:12,655 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 52 transitions, 390 flow [2023-01-27 18:13:12,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:12,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:12,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:12,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:13:12,655 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:13:12,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:12,656 INFO L85 PathProgramCache]: Analyzing trace with hash 406140099, now seen corresponding path program 3 times [2023-01-27 18:13:12,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:12,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106396468] [2023-01-27 18:13:12,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:12,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:13,971 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-27 18:13:13,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:13,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106396468] [2023-01-27 18:13:13,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106396468] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:13,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:13,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:13:13,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600307788] [2023-01-27 18:13:13,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:13,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:13:13,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:13,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:13:13,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:13:13,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 206 [2023-01-27 18:13:13,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 52 transitions, 390 flow. Second operand has 7 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:13,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:13,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 206 [2023-01-27 18:13:13,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:14,435 INFO L130 PetriNetUnfolder]: 1553/2372 cut-off events. [2023-01-27 18:13:14,436 INFO L131 PetriNetUnfolder]: For 4655/4655 co-relation queries the response was YES. [2023-01-27 18:13:14,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9055 conditions, 2372 events. 1553/2372 cut-off events. For 4655/4655 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10913 event pairs, 100 based on Foata normal form. 8/2380 useless extension candidates. Maximal degree in co-relation 9032. Up to 1457 conditions per place. [2023-01-27 18:13:14,453 INFO L137 encePairwiseOnDemand]: 195/206 looper letters, 61 selfloop transitions, 47 changer transitions 0/108 dead transitions. [2023-01-27 18:13:14,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 108 transitions, 895 flow [2023-01-27 18:13:14,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:13:14,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:13:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 652 transitions. [2023-01-27 18:13:14,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4521497919556172 [2023-01-27 18:13:14,457 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 652 transitions. [2023-01-27 18:13:14,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 652 transitions. [2023-01-27 18:13:14,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:14,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 652 transitions. [2023-01-27 18:13:14,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:14,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:14,461 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:14,461 INFO L175 Difference]: Start difference. First operand has 49 places, 52 transitions, 390 flow. Second operand 7 states and 652 transitions. [2023-01-27 18:13:14,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 108 transitions, 895 flow [2023-01-27 18:13:14,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 108 transitions, 847 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-01-27 18:13:14,471 INFO L231 Difference]: Finished difference. Result has 56 places, 77 transitions, 730 flow [2023-01-27 18:13:14,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=730, PETRI_PLACES=56, PETRI_TRANSITIONS=77} [2023-01-27 18:13:14,472 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2023-01-27 18:13:14,472 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 77 transitions, 730 flow [2023-01-27 18:13:14,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:14,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:14,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:14,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:13:14,473 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:13:14,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:14,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1512222893, now seen corresponding path program 4 times [2023-01-27 18:13:14,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:14,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768757134] [2023-01-27 18:13:14,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:14,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:14,897 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-27 18:13:14,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:14,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768757134] [2023-01-27 18:13:14,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768757134] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:14,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:14,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:13:14,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342130555] [2023-01-27 18:13:14,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:14,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:13:14,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:14,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:13:14,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:13:14,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 206 [2023-01-27 18:13:14,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 77 transitions, 730 flow. Second operand has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:14,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:14,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 206 [2023-01-27 18:13:14,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:15,228 INFO L130 PetriNetUnfolder]: 1313/2130 cut-off events. [2023-01-27 18:13:15,228 INFO L131 PetriNetUnfolder]: For 11139/11246 co-relation queries the response was YES. [2023-01-27 18:13:15,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9766 conditions, 2130 events. 1313/2130 cut-off events. For 11139/11246 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11037 event pairs, 184 based on Foata normal form. 121/2242 useless extension candidates. Maximal degree in co-relation 9739. Up to 1322 conditions per place. [2023-01-27 18:13:15,256 INFO L137 encePairwiseOnDemand]: 199/206 looper letters, 53 selfloop transitions, 33 changer transitions 0/98 dead transitions. [2023-01-27 18:13:15,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 98 transitions, 1029 flow [2023-01-27 18:13:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:13:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:13:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 594 transitions. [2023-01-27 18:13:15,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48058252427184467 [2023-01-27 18:13:15,259 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 594 transitions. [2023-01-27 18:13:15,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 594 transitions. [2023-01-27 18:13:15,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:15,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 594 transitions. [2023-01-27 18:13:15,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:15,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:15,263 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:15,263 INFO L175 Difference]: Start difference. First operand has 56 places, 77 transitions, 730 flow. Second operand 6 states and 594 transitions. [2023-01-27 18:13:15,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 98 transitions, 1029 flow [2023-01-27 18:13:15,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 98 transitions, 973 flow, removed 28 selfloop flow, removed 0 redundant places. [2023-01-27 18:13:15,292 INFO L231 Difference]: Finished difference. Result has 62 places, 84 transitions, 863 flow [2023-01-27 18:13:15,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=863, PETRI_PLACES=62, PETRI_TRANSITIONS=84} [2023-01-27 18:13:15,295 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 29 predicate places. [2023-01-27 18:13:15,295 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 84 transitions, 863 flow [2023-01-27 18:13:15,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:15,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:15,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:15,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:13:15,296 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:13:15,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:15,296 INFO L85 PathProgramCache]: Analyzing trace with hash 464146059, now seen corresponding path program 5 times [2023-01-27 18:13:15,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:15,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732084019] [2023-01-27 18:13:15,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:15,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:15,736 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-27 18:13:15,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:15,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732084019] [2023-01-27 18:13:15,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732084019] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:15,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:15,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:13:15,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460451928] [2023-01-27 18:13:15,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:15,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:13:15,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:15,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:13:15,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:13:15,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 206 [2023-01-27 18:13:15,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 84 transitions, 863 flow. Second operand has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:15,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:15,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 206 [2023-01-27 18:13:15,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:16,057 INFO L130 PetriNetUnfolder]: 1301/2118 cut-off events. [2023-01-27 18:13:16,057 INFO L131 PetriNetUnfolder]: For 12891/13121 co-relation queries the response was YES. [2023-01-27 18:13:16,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10386 conditions, 2118 events. 1301/2118 cut-off events. For 12891/13121 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11023 event pairs, 178 based on Foata normal form. 244/2351 useless extension candidates. Maximal degree in co-relation 10356. Up to 1229 conditions per place. [2023-01-27 18:13:16,075 INFO L137 encePairwiseOnDemand]: 200/206 looper letters, 50 selfloop transitions, 40 changer transitions 0/102 dead transitions. [2023-01-27 18:13:16,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 102 transitions, 1139 flow [2023-01-27 18:13:16,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:13:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:13:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 593 transitions. [2023-01-27 18:13:16,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797734627831715 [2023-01-27 18:13:16,078 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 593 transitions. [2023-01-27 18:13:16,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 593 transitions. [2023-01-27 18:13:16,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:16,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 593 transitions. [2023-01-27 18:13:16,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:16,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:16,082 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:16,083 INFO L175 Difference]: Start difference. First operand has 62 places, 84 transitions, 863 flow. Second operand 6 states and 593 transitions. [2023-01-27 18:13:16,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 102 transitions, 1139 flow [2023-01-27 18:13:16,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 102 transitions, 1107 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-01-27 18:13:16,108 INFO L231 Difference]: Finished difference. Result has 65 places, 88 transitions, 1004 flow [2023-01-27 18:13:16,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1004, PETRI_PLACES=65, PETRI_TRANSITIONS=88} [2023-01-27 18:13:16,109 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 32 predicate places. [2023-01-27 18:13:16,109 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 88 transitions, 1004 flow [2023-01-27 18:13:16,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:16,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:16,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:16,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:13:16,111 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:13:16,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:16,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2091372964, now seen corresponding path program 1 times [2023-01-27 18:13:16,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:16,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774056043] [2023-01-27 18:13:16,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:16,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:16,837 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-27 18:13:16,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:16,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774056043] [2023-01-27 18:13:16,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774056043] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:16,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:16,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:13:16,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285041542] [2023-01-27 18:13:16,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:16,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:13:16,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:16,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:13:16,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:13:16,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 206 [2023-01-27 18:13:16,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 88 transitions, 1004 flow. Second operand has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:16,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:16,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 206 [2023-01-27 18:13:16,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:17,210 INFO L130 PetriNetUnfolder]: 1442/2359 cut-off events. [2023-01-27 18:13:17,210 INFO L131 PetriNetUnfolder]: For 16200/16531 co-relation queries the response was YES. [2023-01-27 18:13:17,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12149 conditions, 2359 events. 1442/2359 cut-off events. For 16200/16531 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 12786 event pairs, 197 based on Foata normal form. 156/2495 useless extension candidates. Maximal degree in co-relation 12118. Up to 1466 conditions per place. [2023-01-27 18:13:17,233 INFO L137 encePairwiseOnDemand]: 200/206 looper letters, 70 selfloop transitions, 27 changer transitions 0/109 dead transitions. [2023-01-27 18:13:17,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 109 transitions, 1327 flow [2023-01-27 18:13:17,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:13:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:13:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-01-27 18:13:17,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48640776699029126 [2023-01-27 18:13:17,235 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-01-27 18:13:17,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-01-27 18:13:17,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:17,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-01-27 18:13:17,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:17,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:17,300 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:17,300 INFO L175 Difference]: Start difference. First operand has 65 places, 88 transitions, 1004 flow. Second operand 5 states and 501 transitions. [2023-01-27 18:13:17,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 109 transitions, 1327 flow [2023-01-27 18:13:17,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 109 transitions, 1253 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-01-27 18:13:17,324 INFO L231 Difference]: Finished difference. Result has 66 places, 90 transitions, 1044 flow [2023-01-27 18:13:17,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1044, PETRI_PLACES=66, PETRI_TRANSITIONS=90} [2023-01-27 18:13:17,325 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 33 predicate places. [2023-01-27 18:13:17,325 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 90 transitions, 1044 flow [2023-01-27 18:13:17,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:17,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:17,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:17,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:13:17,326 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:13:17,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:17,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1818965814, now seen corresponding path program 2 times [2023-01-27 18:13:17,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:17,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138194140] [2023-01-27 18:13:17,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:17,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:17,925 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-27 18:13:17,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:17,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138194140] [2023-01-27 18:13:17,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138194140] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:17,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:17,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:13:17,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323084726] [2023-01-27 18:13:17,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:17,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:13:17,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:17,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:13:17,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:13:17,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 206 [2023-01-27 18:13:17,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 90 transitions, 1044 flow. Second operand has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:17,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:17,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 206 [2023-01-27 18:13:17,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:18,434 INFO L130 PetriNetUnfolder]: 2045/3146 cut-off events. [2023-01-27 18:13:18,434 INFO L131 PetriNetUnfolder]: For 15277/15277 co-relation queries the response was YES. [2023-01-27 18:13:18,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15331 conditions, 3146 events. 2045/3146 cut-off events. For 15277/15277 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 15650 event pairs, 344 based on Foata normal form. 16/3162 useless extension candidates. Maximal degree in co-relation 15299. Up to 2261 conditions per place. [2023-01-27 18:13:18,456 INFO L137 encePairwiseOnDemand]: 197/206 looper letters, 104 selfloop transitions, 36 changer transitions 0/140 dead transitions. [2023-01-27 18:13:18,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 140 transitions, 1658 flow [2023-01-27 18:13:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:13:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:13:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 646 transitions. [2023-01-27 18:13:18,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44798890429958393 [2023-01-27 18:13:18,459 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 646 transitions. [2023-01-27 18:13:18,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 646 transitions. [2023-01-27 18:13:18,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:18,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 646 transitions. [2023-01-27 18:13:18,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:18,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:18,465 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:18,465 INFO L175 Difference]: Start difference. First operand has 66 places, 90 transitions, 1044 flow. Second operand 7 states and 646 transitions. [2023-01-27 18:13:18,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 140 transitions, 1658 flow [2023-01-27 18:13:18,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 140 transitions, 1612 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-01-27 18:13:18,489 INFO L231 Difference]: Finished difference. Result has 71 places, 100 transitions, 1216 flow [2023-01-27 18:13:18,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1216, PETRI_PLACES=71, PETRI_TRANSITIONS=100} [2023-01-27 18:13:18,490 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 38 predicate places. [2023-01-27 18:13:18,490 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 100 transitions, 1216 flow [2023-01-27 18:13:18,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:18,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:18,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:18,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:13:18,491 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:13:18,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:18,491 INFO L85 PathProgramCache]: Analyzing trace with hash 118489274, now seen corresponding path program 3 times [2023-01-27 18:13:18,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:18,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146432179] [2023-01-27 18:13:18,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:18,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:19,063 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-27 18:13:19,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:19,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146432179] [2023-01-27 18:13:19,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146432179] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:19,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:19,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:13:19,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357295908] [2023-01-27 18:13:19,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:19,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:13:19,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:19,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:13:19,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:13:19,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 206 [2023-01-27 18:13:19,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 100 transitions, 1216 flow. Second operand has 7 states, 7 states have (on average 90.85714285714286) internal successors, (636), 7 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:19,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:19,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 206 [2023-01-27 18:13:19,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:19,475 INFO L130 PetriNetUnfolder]: 1511/2487 cut-off events. [2023-01-27 18:13:19,476 INFO L131 PetriNetUnfolder]: For 17773/18124 co-relation queries the response was YES. [2023-01-27 18:13:19,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12812 conditions, 2487 events. 1511/2487 cut-off events. For 17773/18124 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 13950 event pairs, 212 based on Foata normal form. 166/2613 useless extension candidates. Maximal degree in co-relation 12779. Up to 1240 conditions per place. [2023-01-27 18:13:19,528 INFO L137 encePairwiseOnDemand]: 201/206 looper letters, 79 selfloop transitions, 33 changer transitions 0/127 dead transitions. [2023-01-27 18:13:19,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 127 transitions, 1637 flow [2023-01-27 18:13:19,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:13:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:13:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2023-01-27 18:13:19,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4728155339805825 [2023-01-27 18:13:19,533 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2023-01-27 18:13:19,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2023-01-27 18:13:19,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:19,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2023-01-27 18:13:19,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:19,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:19,536 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:19,536 INFO L175 Difference]: Start difference. First operand has 71 places, 100 transitions, 1216 flow. Second operand 5 states and 487 transitions. [2023-01-27 18:13:19,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 127 transitions, 1637 flow [2023-01-27 18:13:19,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 127 transitions, 1585 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-27 18:13:19,565 INFO L231 Difference]: Finished difference. Result has 73 places, 100 transitions, 1262 flow [2023-01-27 18:13:19,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1262, PETRI_PLACES=73, PETRI_TRANSITIONS=100} [2023-01-27 18:13:19,566 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2023-01-27 18:13:19,566 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 100 transitions, 1262 flow [2023-01-27 18:13:19,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.85714285714286) internal successors, (636), 7 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:19,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:19,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:19,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:13:19,567 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:13:19,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:19,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1759710244, now seen corresponding path program 1 times [2023-01-27 18:13:19,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:19,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253210267] [2023-01-27 18:13:19,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:19,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:19,764 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-27 18:13:19,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:19,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253210267] [2023-01-27 18:13:19,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253210267] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:19,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:19,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:13:19,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455186078] [2023-01-27 18:13:19,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:19,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:13:19,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:19,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:13:19,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:13:19,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 206 [2023-01-27 18:13:19,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 100 transitions, 1262 flow. Second operand has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 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-27 18:13:19,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:19,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 206 [2023-01-27 18:13:19,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:20,080 INFO L130 PetriNetUnfolder]: 1064/1838 cut-off events. [2023-01-27 18:13:20,081 INFO L131 PetriNetUnfolder]: For 21864/22421 co-relation queries the response was YES. [2023-01-27 18:13:20,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9882 conditions, 1838 events. 1064/1838 cut-off events. For 21864/22421 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 11024 event pairs, 160 based on Foata normal form. 645/2418 useless extension candidates. Maximal degree in co-relation 9848. Up to 1023 conditions per place. [2023-01-27 18:13:20,098 INFO L137 encePairwiseOnDemand]: 200/206 looper letters, 141 selfloop transitions, 7 changer transitions 48/215 dead transitions. [2023-01-27 18:13:20,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 215 transitions, 3257 flow [2023-01-27 18:13:20,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:13:20,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:13:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2023-01-27 18:13:20,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4786407766990291 [2023-01-27 18:13:20,100 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 493 transitions. [2023-01-27 18:13:20,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 493 transitions. [2023-01-27 18:13:20,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:20,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 493 transitions. [2023-01-27 18:13:20,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:20,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:20,104 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:20,104 INFO L175 Difference]: Start difference. First operand has 73 places, 100 transitions, 1262 flow. Second operand 5 states and 493 transitions. [2023-01-27 18:13:20,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 215 transitions, 3257 flow [2023-01-27 18:13:20,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 215 transitions, 3049 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-01-27 18:13:20,129 INFO L231 Difference]: Finished difference. Result has 76 places, 98 transitions, 1153 flow [2023-01-27 18:13:20,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1153, PETRI_PLACES=76, PETRI_TRANSITIONS=98} [2023-01-27 18:13:20,130 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 43 predicate places. [2023-01-27 18:13:20,131 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 98 transitions, 1153 flow [2023-01-27 18:13:20,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 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-27 18:13:20,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:20,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:20,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:13:20,132 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:13:20,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1028346844, now seen corresponding path program 1 times [2023-01-27 18:13:20,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:20,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455532923] [2023-01-27 18:13:20,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:20,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:20,295 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-27 18:13:20,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:20,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455532923] [2023-01-27 18:13:20,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455532923] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:20,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:20,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:13:20,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659259070] [2023-01-27 18:13:20,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:20,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:13:20,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:20,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:13:20,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:13:20,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 206 [2023-01-27 18:13:20,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 98 transitions, 1153 flow. Second operand has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:20,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:20,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 206 [2023-01-27 18:13:20,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:20,561 INFO L130 PetriNetUnfolder]: 750/1389 cut-off events. [2023-01-27 18:13:20,561 INFO L131 PetriNetUnfolder]: For 17251/17925 co-relation queries the response was YES. [2023-01-27 18:13:20,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8032 conditions, 1389 events. 750/1389 cut-off events. For 17251/17925 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 8470 event pairs, 64 based on Foata normal form. 596/1943 useless extension candidates. Maximal degree in co-relation 7995. Up to 615 conditions per place. [2023-01-27 18:13:20,571 INFO L137 encePairwiseOnDemand]: 200/206 looper letters, 146 selfloop transitions, 13 changer transitions 58/235 dead transitions. [2023-01-27 18:13:20,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 235 transitions, 3396 flow [2023-01-27 18:13:20,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:13:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:13:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 689 transitions. [2023-01-27 18:13:20,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4778085991678225 [2023-01-27 18:13:20,574 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 689 transitions. [2023-01-27 18:13:20,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 689 transitions. [2023-01-27 18:13:20,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:20,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 689 transitions. [2023-01-27 18:13:20,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:20,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:20,578 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:20,578 INFO L175 Difference]: Start difference. First operand has 76 places, 98 transitions, 1153 flow. Second operand 7 states and 689 transitions. [2023-01-27 18:13:20,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 235 transitions, 3396 flow [2023-01-27 18:13:20,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 235 transitions, 3235 flow, removed 16 selfloop flow, removed 7 redundant places. [2023-01-27 18:13:20,598 INFO L231 Difference]: Finished difference. Result has 78 places, 87 transitions, 985 flow [2023-01-27 18:13:20,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=985, PETRI_PLACES=78, PETRI_TRANSITIONS=87} [2023-01-27 18:13:20,599 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 45 predicate places. [2023-01-27 18:13:20,600 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 87 transitions, 985 flow [2023-01-27 18:13:20,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:20,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:20,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:20,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-27 18:13:20,600 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:13:20,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:20,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1444148294, now seen corresponding path program 1 times [2023-01-27 18:13:20,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:20,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125944890] [2023-01-27 18:13:20,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:20,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:21,227 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-27 18:13:21,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:21,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125944890] [2023-01-27 18:13:21,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125944890] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:21,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:21,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:13:21,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112960350] [2023-01-27 18:13:21,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:21,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:13:21,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:21,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:13:21,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:13:21,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 206 [2023-01-27 18:13:21,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 87 transitions, 985 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:21,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:21,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 206 [2023-01-27 18:13:21,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:21,765 INFO L130 PetriNetUnfolder]: 1537/2668 cut-off events. [2023-01-27 18:13:21,765 INFO L131 PetriNetUnfolder]: For 18474/18474 co-relation queries the response was YES. [2023-01-27 18:13:21,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15840 conditions, 2668 events. 1537/2668 cut-off events. For 18474/18474 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 15750 event pairs, 145 based on Foata normal form. 8/2676 useless extension candidates. Maximal degree in co-relation 15802. Up to 1159 conditions per place. [2023-01-27 18:13:21,780 INFO L137 encePairwiseOnDemand]: 195/206 looper letters, 74 selfloop transitions, 19 changer transitions 104/197 dead transitions. [2023-01-27 18:13:21,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 197 transitions, 2520 flow [2023-01-27 18:13:21,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:13:21,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:13:21,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 555 transitions. [2023-01-27 18:13:21,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44902912621359226 [2023-01-27 18:13:21,783 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 555 transitions. [2023-01-27 18:13:21,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 555 transitions. [2023-01-27 18:13:21,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:21,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 555 transitions. [2023-01-27 18:13:21,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:21,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:21,787 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:21,787 INFO L175 Difference]: Start difference. First operand has 78 places, 87 transitions, 985 flow. Second operand 6 states and 555 transitions. [2023-01-27 18:13:21,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 197 transitions, 2520 flow [2023-01-27 18:13:21,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 197 transitions, 2411 flow, removed 40 selfloop flow, removed 2 redundant places. [2023-01-27 18:13:21,852 INFO L231 Difference]: Finished difference. Result has 83 places, 60 transitions, 723 flow [2023-01-27 18:13:21,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=723, PETRI_PLACES=83, PETRI_TRANSITIONS=60} [2023-01-27 18:13:21,854 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 50 predicate places. [2023-01-27 18:13:21,854 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 60 transitions, 723 flow [2023-01-27 18:13:21,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:21,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:21,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:21,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-27 18:13:21,855 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:13:21,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:21,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1366176434, now seen corresponding path program 2 times [2023-01-27 18:13:21,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:21,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40127792] [2023-01-27 18:13:21,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:21,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:13:22,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:22,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40127792] [2023-01-27 18:13:22,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40127792] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:22,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:22,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:13:22,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703502702] [2023-01-27 18:13:22,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:22,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:13:22,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:22,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:13:22,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:13:22,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 206 [2023-01-27 18:13:22,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 60 transitions, 723 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:22,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:22,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 206 [2023-01-27 18:13:22,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:22,130 INFO L130 PetriNetUnfolder]: 280/618 cut-off events. [2023-01-27 18:13:22,131 INFO L131 PetriNetUnfolder]: For 5721/5757 co-relation queries the response was YES. [2023-01-27 18:13:22,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3811 conditions, 618 events. 280/618 cut-off events. For 5721/5757 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3294 event pairs, 87 based on Foata normal form. 39/648 useless extension candidates. Maximal degree in co-relation 3770. Up to 302 conditions per place. [2023-01-27 18:13:22,135 INFO L137 encePairwiseOnDemand]: 203/206 looper letters, 47 selfloop transitions, 4 changer transitions 23/80 dead transitions. [2023-01-27 18:13:22,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 80 transitions, 1065 flow [2023-01-27 18:13:22,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:13:22,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:13:22,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-01-27 18:13:22,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080906148867314 [2023-01-27 18:13:22,137 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-01-27 18:13:22,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-01-27 18:13:22,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:22,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-01-27 18:13:22,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:22,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:22,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:22,141 INFO L175 Difference]: Start difference. First operand has 83 places, 60 transitions, 723 flow. Second operand 3 states and 314 transitions. [2023-01-27 18:13:22,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 80 transitions, 1065 flow [2023-01-27 18:13:22,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 80 transitions, 939 flow, removed 42 selfloop flow, removed 9 redundant places. [2023-01-27 18:13:22,155 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 478 flow [2023-01-27 18:13:22,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2023-01-27 18:13:22,156 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 39 predicate places. [2023-01-27 18:13:22,156 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 478 flow [2023-01-27 18:13:22,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:22,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:22,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:22,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-27 18:13:22,156 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:13:22,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash 924458938, now seen corresponding path program 1 times [2023-01-27 18:13:22,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:22,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685730484] [2023-01-27 18:13:22,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:22,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:13:22,387 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-27 18:13:22,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:13:22,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685730484] [2023-01-27 18:13:22,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685730484] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:13:22,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:13:22,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:13:22,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050795485] [2023-01-27 18:13:22,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:13:22,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:13:22,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:13:22,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:13:22,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:13:22,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 206 [2023-01-27 18:13:22,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 478 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:22,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:13:22,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 206 [2023-01-27 18:13:22,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:13:22,504 INFO L130 PetriNetUnfolder]: 158/391 cut-off events. [2023-01-27 18:13:22,505 INFO L131 PetriNetUnfolder]: For 2452/2495 co-relation queries the response was YES. [2023-01-27 18:13:22,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1961 conditions, 391 events. 158/391 cut-off events. For 2452/2495 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2078 event pairs, 30 based on Foata normal form. 77/464 useless extension candidates. Maximal degree in co-relation 1924. Up to 119 conditions per place. [2023-01-27 18:13:22,507 INFO L137 encePairwiseOnDemand]: 200/206 looper letters, 32 selfloop transitions, 10 changer transitions 32/79 dead transitions. [2023-01-27 18:13:22,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 79 transitions, 916 flow [2023-01-27 18:13:22,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:13:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:13:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 667 transitions. [2023-01-27 18:13:22,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46255201109570043 [2023-01-27 18:13:22,510 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 667 transitions. [2023-01-27 18:13:22,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 667 transitions. [2023-01-27 18:13:22,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:13:22,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 667 transitions. [2023-01-27 18:13:22,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:22,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:22,514 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:22,514 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 478 flow. Second operand 7 states and 667 transitions. [2023-01-27 18:13:22,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 79 transitions, 916 flow [2023-01-27 18:13:22,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 79 transitions, 768 flow, removed 29 selfloop flow, removed 8 redundant places. [2023-01-27 18:13:22,520 INFO L231 Difference]: Finished difference. Result has 73 places, 33 transitions, 263 flow [2023-01-27 18:13:22,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=263, PETRI_PLACES=73, PETRI_TRANSITIONS=33} [2023-01-27 18:13:22,521 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2023-01-27 18:13:22,521 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 33 transitions, 263 flow [2023-01-27 18:13:22,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:13:22,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:13:22,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:22,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-27 18:13:22,522 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:13:22,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:13:22,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1290246957, now seen corresponding path program 1 times [2023-01-27 18:13:22,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:13:22,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110100525] [2023-01-27 18:13:22,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:13:22,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:13:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:13:22,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:13:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:13:22,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:13:22,636 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:13:22,637 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:13:22,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:13:22,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:13:22,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:13:22,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:13:22,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:13:22,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-27 18:13:22,642 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:13:22,647 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:13:22,647 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:13:22,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:13:22 BasicIcfg [2023-01-27 18:13:22,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:13:22,723 INFO L158 Benchmark]: Toolchain (without parser) took 20503.83ms. Allocated memory was 367.0MB in the beginning and 805.3MB in the end (delta: 438.3MB). Free memory was 325.9MB in the beginning and 443.0MB in the end (delta: -117.1MB). Peak memory consumption was 321.8MB. Max. memory is 16.0GB. [2023-01-27 18:13:22,724 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:13:22,724 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.35ms. Allocated memory is still 367.0MB. Free memory was 325.6MB in the beginning and 302.8MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:13:22,724 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.80ms. Allocated memory is still 367.0MB. Free memory was 302.8MB in the beginning and 300.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:13:22,724 INFO L158 Benchmark]: Boogie Preprocessor took 24.48ms. Allocated memory is still 367.0MB. Free memory was 300.1MB in the beginning and 298.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:13:22,727 INFO L158 Benchmark]: RCFGBuilder took 651.58ms. Allocated memory is still 367.0MB. Free memory was 298.3MB in the beginning and 329.9MB in the end (delta: -31.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-01-27 18:13:22,728 INFO L158 Benchmark]: TraceAbstraction took 19320.19ms. Allocated memory was 367.0MB in the beginning and 805.3MB in the end (delta: 438.3MB). Free memory was 329.1MB in the beginning and 443.0MB in the end (delta: -113.9MB). Peak memory consumption was 323.9MB. Max. memory is 16.0GB. [2023-01-27 18:13:22,729 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.13ms. Allocated memory is still 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 448.35ms. Allocated memory is still 367.0MB. Free memory was 325.6MB in the beginning and 302.8MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.80ms. Allocated memory is still 367.0MB. Free memory was 302.8MB in the beginning and 300.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.48ms. Allocated memory is still 367.0MB. Free memory was 300.1MB in the beginning and 298.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 651.58ms. Allocated memory is still 367.0MB. Free memory was 298.3MB in the beginning and 329.9MB in the end (delta: -31.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 19320.19ms. Allocated memory was 367.0MB in the beginning and 805.3MB in the end (delta: 438.3MB). Free memory was 329.1MB in the beginning and 443.0MB in the end (delta: -113.9MB). Peak memory consumption was 323.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 115 PlacesBefore, 33 PlacesAfterwards, 107 TransitionsBefore, 23 TransitionsAfterwards, 1944 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 96 TotalNumberOfCompositions, 5133 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2300, independent: 2117, independent conditional: 0, independent unconditional: 2117, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1107, independent: 1068, independent conditional: 0, independent unconditional: 1068, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2300, independent: 1049, independent conditional: 0, independent unconditional: 1049, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 1107, unknown conditional: 0, unknown unconditional: 1107] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1196; [L824] FCALL, FORK 0 pthread_create(&t1196, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1196, ((void *)0), P0, ((void *)0))=-3, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t1197; [L826] FCALL, FORK 0 pthread_create(&t1197, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1197, ((void *)0), P1, ((void *)0))=-2, t1196={5:0}, t1197={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t1198; [L828] FCALL, FORK 0 pthread_create(&t1198, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1198, ((void *)0), P2, ((void *)0))=-1, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L784] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L784] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L766] 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) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 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 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 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) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 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 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 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) [L846] 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)) [L847] 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)) [L848] 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)) [L849] 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)) [L850] 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)) [L851] 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)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 824]: 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: 828]: 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: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.1s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 387 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 387 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1342 IncrementalHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 43 mSDtfsCounter, 1342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1262occurred in iteration=12, InterpolantAutomatonStates: 88, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 1972 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-27 18:13:22,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...