/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:58:40,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:58:40,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:58:40,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:58:40,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:58:40,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:58:40,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:58:40,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:58:40,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:58:40,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:58:40,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:58:40,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:58:40,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:58:40,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:58:40,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:58:40,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:58:40,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:58:40,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:58:40,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:58:40,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:58:40,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:58:40,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:58:40,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:58:40,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:58:40,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:58:40,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:58:40,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:58:40,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:58:40,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:58:40,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:58:40,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:58:40,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:58:40,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:58:40,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:58:40,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:58:40,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:58:40,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:58:40,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:58:40,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:58:40,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:58:40,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:58:40,733 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 06:58:40,758 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:58:40,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:58:40,759 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:58:40,759 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:58:40,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:58:40,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:58:40,760 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:58:40,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:58:40,760 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:58:40,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:58:40,760 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:58:40,760 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:58:40,760 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:58:40,760 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:58:40,760 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:58:40,760 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:58:40,761 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:58:40,761 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:58:40,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:58:40,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:58:40,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:58:40,761 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:58:40,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:58:40,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:58:40,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:58:40,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:58:40,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:58:40,762 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:58:40,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:58:40,762 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:58:40,762 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:58:40,762 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 06:58:40,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:58:40,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:58:40,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:58:40,968 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:58:40,971 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:58:40,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-01-28 06:58:41,976 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:58:42,144 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:58:42,144 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-01-28 06:58:42,154 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e6ccc66e/353b6d5e1d2f479999c2ccd2fd4c982c/FLAG256353428 [2023-01-28 06:58:42,164 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e6ccc66e/353b6d5e1d2f479999c2ccd2fd4c982c [2023-01-28 06:58:42,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:58:42,167 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:58:42,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:58:42,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:58:42,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:58:42,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:58:42" (1/1) ... [2023-01-28 06:58:42,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e88e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:42, skipping insertion in model container [2023-01-28 06:58:42,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:58:42" (1/1) ... [2023-01-28 06:58:42,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:58:42,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:58:42,299 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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-01-28 06:58:42,393 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:58:42,400 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:58:42,407 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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-01-28 06:58:42,434 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:58:42,451 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:58:42,451 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:58:42,456 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:58:42,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:42 WrapperNode [2023-01-28 06:58:42,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:58:42,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:58:42,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:58:42,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:58:42,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:42" (1/1) ... [2023-01-28 06:58:42,470 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:42" (1/1) ... [2023-01-28 06:58:42,503 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2023-01-28 06:58:42,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:58:42,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:58:42,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:58:42,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:58:42,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:42" (1/1) ... [2023-01-28 06:58:42,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:42" (1/1) ... [2023-01-28 06:58:42,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:42" (1/1) ... [2023-01-28 06:58:42,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:42" (1/1) ... [2023-01-28 06:58:42,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:42" (1/1) ... [2023-01-28 06:58:42,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:42" (1/1) ... [2023-01-28 06:58:42,529 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:42" (1/1) ... [2023-01-28 06:58:42,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:42" (1/1) ... [2023-01-28 06:58:42,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:58:42,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:58:42,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:58:42,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:58:42,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:42" (1/1) ... [2023-01-28 06:58:42,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:58:42,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:58:42,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 06:58:42,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 06:58:42,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:58:42,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:58:42,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:58:42,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:58:42,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:58:42,619 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:58:42,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:58:42,620 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:58:42,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:58:42,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:58:42,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:58:42,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:58:42,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:58:42,621 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 06:58:42,713 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:58:42,714 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:58:42,969 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:58:43,061 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:58:43,061 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:58:43,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:58:43 BoogieIcfgContainer [2023-01-28 06:58:43,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:58:43,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:58:43,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:58:43,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:58:43,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:58:42" (1/3) ... [2023-01-28 06:58:43,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afa68e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:58:43, skipping insertion in model container [2023-01-28 06:58:43,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:42" (2/3) ... [2023-01-28 06:58:43,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afa68e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:58:43, skipping insertion in model container [2023-01-28 06:58:43,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:58:43" (3/3) ... [2023-01-28 06:58:43,068 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-01-28 06:58:43,083 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:58:43,083 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:58:43,083 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:58:43,133 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:58:43,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2023-01-28 06:58:43,203 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2023-01-28 06:58:43,203 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:58:43,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-01-28 06:58:43,208 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2023-01-28 06:58:43,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2023-01-28 06:58:43,216 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:58:43,225 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2023-01-28 06:58:43,227 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2023-01-28 06:58:43,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2023-01-28 06:58:43,247 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2023-01-28 06:58:43,247 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:58:43,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-01-28 06:58:43,248 INFO L119 LiptonReduction]: Number of co-enabled transitions 1156 [2023-01-28 06:58:45,332 INFO L134 LiptonReduction]: Checked pairs total: 3436 [2023-01-28 06:58:45,333 INFO L136 LiptonReduction]: Total number of compositions: 80 [2023-01-28 06:58:45,346 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:58:45,369 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;@2a481ca5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:58:45,369 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 06:58:45,372 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-01-28 06:58:45,373 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:58:45,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:45,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 06:58:45,374 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:45,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:45,378 INFO L85 PathProgramCache]: Analyzing trace with hash 393576756, now seen corresponding path program 1 times [2023-01-28 06:58:45,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:45,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135132989] [2023-01-28 06:58:45,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:45,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:58:45,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:45,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135132989] [2023-01-28 06:58:45,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135132989] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:45,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:45,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:58:45,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716265243] [2023-01-28 06:58:45,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:45,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:58:45,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:45,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:58:45,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:58:45,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 171 [2023-01-28 06:58:45,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:45,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:45,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 171 [2023-01-28 06:58:45,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:45,737 INFO L130 PetriNetUnfolder]: 159/338 cut-off events. [2023-01-28 06:58:45,737 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 06:58:45,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 338 events. 159/338 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1573 event pairs, 24 based on Foata normal form. 16/321 useless extension candidates. Maximal degree in co-relation 622. Up to 220 conditions per place. [2023-01-28 06:58:45,740 INFO L137 encePairwiseOnDemand]: 167/171 looper letters, 19 selfloop transitions, 2 changer transitions 4/28 dead transitions. [2023-01-28 06:58:45,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 28 transitions, 112 flow [2023-01-28 06:58:45,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:58:45,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:58:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2023-01-28 06:58:45,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5165692007797271 [2023-01-28 06:58:45,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 265 transitions. [2023-01-28 06:58:45,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 265 transitions. [2023-01-28 06:58:45,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:45,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 265 transitions. [2023-01-28 06:58:45,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:45,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:45,756 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:45,757 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 265 transitions. [2023-01-28 06:58:45,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 28 transitions, 112 flow [2023-01-28 06:58:45,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 28 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:45,760 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2023-01-28 06:58:45,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-01-28 06:58:45,763 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2023-01-28 06:58:45,763 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2023-01-28 06:58:45,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:45,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:45,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:45,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:58:45,764 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:45,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:45,764 INFO L85 PathProgramCache]: Analyzing trace with hash -214138189, now seen corresponding path program 1 times [2023-01-28 06:58:45,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:45,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107128082] [2023-01-28 06:58:45,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:45,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:58:46,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:46,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107128082] [2023-01-28 06:58:46,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107128082] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:46,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:46,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:58:46,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222146930] [2023-01-28 06:58:46,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:46,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:58:46,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:46,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:58:46,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:58:46,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 171 [2023-01-28 06:58:46,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:46,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:46,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 171 [2023-01-28 06:58:46,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:46,487 INFO L130 PetriNetUnfolder]: 217/388 cut-off events. [2023-01-28 06:58:46,487 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-01-28 06:58:46,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 388 events. 217/388 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1413 event pairs, 68 based on Foata normal form. 30/418 useless extension candidates. Maximal degree in co-relation 802. Up to 251 conditions per place. [2023-01-28 06:58:46,489 INFO L137 encePairwiseOnDemand]: 167/171 looper letters, 21 selfloop transitions, 2 changer transitions 14/37 dead transitions. [2023-01-28 06:58:46,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 37 transitions, 158 flow [2023-01-28 06:58:46,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:58:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:58:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 369 transitions. [2023-01-28 06:58:46,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43157894736842106 [2023-01-28 06:58:46,492 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 369 transitions. [2023-01-28 06:58:46,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 369 transitions. [2023-01-28 06:58:46,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:46,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 369 transitions. [2023-01-28 06:58:46,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:46,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:46,495 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:46,495 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 5 states and 369 transitions. [2023-01-28 06:58:46,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 37 transitions, 158 flow [2023-01-28 06:58:46,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:46,496 INFO L231 Difference]: Finished difference. Result has 29 places, 17 transitions, 50 flow [2023-01-28 06:58:46,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=50, PETRI_PLACES=29, PETRI_TRANSITIONS=17} [2023-01-28 06:58:46,497 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2023-01-28 06:58:46,497 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 17 transitions, 50 flow [2023-01-28 06:58:46,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:46,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:46,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:46,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:58:46,498 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:46,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:46,498 INFO L85 PathProgramCache]: Analyzing trace with hash -13532060, now seen corresponding path program 1 times [2023-01-28 06:58:46,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:46,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335110731] [2023-01-28 06:58:46,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:46,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:58:46,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:46,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335110731] [2023-01-28 06:58:46,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335110731] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:46,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:46,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:58:46,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029860995] [2023-01-28 06:58:46,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:46,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:58:46,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:46,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:58:46,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:58:46,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 171 [2023-01-28 06:58:46,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 17 transitions, 50 flow. Second operand has 7 states, 7 states have (on average 68.28571428571429) internal successors, (478), 7 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:46,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:46,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 171 [2023-01-28 06:58:46,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:46,972 INFO L130 PetriNetUnfolder]: 133/278 cut-off events. [2023-01-28 06:58:46,972 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2023-01-28 06:58:46,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 278 events. 133/278 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1115 event pairs, 37 based on Foata normal form. 15/293 useless extension candidates. Maximal degree in co-relation 604. Up to 182 conditions per place. [2023-01-28 06:58:46,974 INFO L137 encePairwiseOnDemand]: 164/171 looper letters, 26 selfloop transitions, 8 changer transitions 13/49 dead transitions. [2023-01-28 06:58:46,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 49 transitions, 216 flow [2023-01-28 06:58:46,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:58:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:58:46,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 586 transitions. [2023-01-28 06:58:46,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4283625730994152 [2023-01-28 06:58:46,975 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 586 transitions. [2023-01-28 06:58:46,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 586 transitions. [2023-01-28 06:58:46,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:46,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 586 transitions. [2023-01-28 06:58:46,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 73.25) internal successors, (586), 8 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:46,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 171.0) internal successors, (1539), 9 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:46,979 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 171.0) internal successors, (1539), 9 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:46,979 INFO L175 Difference]: Start difference. First operand has 29 places, 17 transitions, 50 flow. Second operand 8 states and 586 transitions. [2023-01-28 06:58:46,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 49 transitions, 216 flow [2023-01-28 06:58:46,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 49 transitions, 208 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 06:58:46,981 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 100 flow [2023-01-28 06:58:46,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-01-28 06:58:46,982 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2023-01-28 06:58:46,982 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 100 flow [2023-01-28 06:58:46,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.28571428571429) internal successors, (478), 7 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:46,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:46,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:46,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:58:46,983 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:46,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:46,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1317134639, now seen corresponding path program 1 times [2023-01-28 06:58:46,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:46,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48838572] [2023-01-28 06:58:46,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:46,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:47,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:58:47,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:47,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48838572] [2023-01-28 06:58:47,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48838572] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:47,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:47,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:58:47,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062871984] [2023-01-28 06:58:47,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:47,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:58:47,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:47,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:58:47,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:58:47,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 171 [2023-01-28 06:58:47,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 100 flow. Second operand has 7 states, 7 states have (on average 67.57142857142857) internal successors, (473), 7 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:47,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:47,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 171 [2023-01-28 06:58:47,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:47,496 INFO L130 PetriNetUnfolder]: 129/270 cut-off events. [2023-01-28 06:58:47,496 INFO L131 PetriNetUnfolder]: For 269/275 co-relation queries the response was YES. [2023-01-28 06:58:47,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 270 events. 129/270 cut-off events. For 269/275 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1053 event pairs, 24 based on Foata normal form. 9/279 useless extension candidates. Maximal degree in co-relation 746. Up to 181 conditions per place. [2023-01-28 06:58:47,498 INFO L137 encePairwiseOnDemand]: 162/171 looper letters, 29 selfloop transitions, 13 changer transitions 7/51 dead transitions. [2023-01-28 06:58:47,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 51 transitions, 291 flow [2023-01-28 06:58:47,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:58:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:58:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 573 transitions. [2023-01-28 06:58:47,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41885964912280704 [2023-01-28 06:58:47,500 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 573 transitions. [2023-01-28 06:58:47,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 573 transitions. [2023-01-28 06:58:47,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:47,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 573 transitions. [2023-01-28 06:58:47,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 71.625) internal successors, (573), 8 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:47,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 171.0) internal successors, (1539), 9 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:47,504 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 171.0) internal successors, (1539), 9 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:47,504 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 100 flow. Second operand 8 states and 573 transitions. [2023-01-28 06:58:47,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 51 transitions, 291 flow [2023-01-28 06:58:47,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 51 transitions, 287 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:47,506 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 190 flow [2023-01-28 06:58:47,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=190, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-01-28 06:58:47,507 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 15 predicate places. [2023-01-28 06:58:47,507 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 190 flow [2023-01-28 06:58:47,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.57142857142857) internal successors, (473), 7 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:47,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:47,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:47,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:58:47,507 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:47,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash 567904127, now seen corresponding path program 2 times [2023-01-28 06:58:47,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:47,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994030873] [2023-01-28 06:58:47,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:47,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:47,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:58:47,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:47,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994030873] [2023-01-28 06:58:47,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994030873] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:47,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:47,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:58:47,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909118478] [2023-01-28 06:58:47,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:47,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:58:47,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:47,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:58:47,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:58:47,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 171 [2023-01-28 06:58:47,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 67.71428571428571) internal successors, (474), 7 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:47,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:47,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 171 [2023-01-28 06:58:47,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:48,170 INFO L130 PetriNetUnfolder]: 201/362 cut-off events. [2023-01-28 06:58:48,170 INFO L131 PetriNetUnfolder]: For 702/702 co-relation queries the response was YES. [2023-01-28 06:58:48,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 362 events. 201/362 cut-off events. For 702/702 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1288 event pairs, 44 based on Foata normal form. 12/374 useless extension candidates. Maximal degree in co-relation 1325. Up to 273 conditions per place. [2023-01-28 06:58:48,173 INFO L137 encePairwiseOnDemand]: 162/171 looper letters, 38 selfloop transitions, 21 changer transitions 9/68 dead transitions. [2023-01-28 06:58:48,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 509 flow [2023-01-28 06:58:48,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 06:58:48,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 06:58:48,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 721 transitions. [2023-01-28 06:58:48,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4216374269005848 [2023-01-28 06:58:48,175 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 721 transitions. [2023-01-28 06:58:48,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 721 transitions. [2023-01-28 06:58:48,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:48,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 721 transitions. [2023-01-28 06:58:48,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 72.1) internal successors, (721), 10 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:48,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 171.0) internal successors, (1881), 11 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:48,192 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 171.0) internal successors, (1881), 11 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:48,192 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 190 flow. Second operand 10 states and 721 transitions. [2023-01-28 06:58:48,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 509 flow [2023-01-28 06:58:48,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 490 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:48,196 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 324 flow [2023-01-28 06:58:48,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=324, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-01-28 06:58:48,196 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 25 predicate places. [2023-01-28 06:58:48,196 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 324 flow [2023-01-28 06:58:48,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.71428571428571) internal successors, (474), 7 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:48,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:48,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:48,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:58:48,197 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:48,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:48,198 INFO L85 PathProgramCache]: Analyzing trace with hash 595148477, now seen corresponding path program 3 times [2023-01-28 06:58:48,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:48,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946012825] [2023-01-28 06:58:48,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:48,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:58:48,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:48,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946012825] [2023-01-28 06:58:48,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946012825] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:48,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:48,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:58:48,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950203292] [2023-01-28 06:58:48,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:48,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:58:48,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:48,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:58:48,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:58:48,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 171 [2023-01-28 06:58:48,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 72.57142857142857) internal successors, (508), 7 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:48,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:48,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 171 [2023-01-28 06:58:48,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:48,595 INFO L130 PetriNetUnfolder]: 137/276 cut-off events. [2023-01-28 06:58:48,596 INFO L131 PetriNetUnfolder]: For 992/998 co-relation queries the response was YES. [2023-01-28 06:58:48,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 276 events. 137/276 cut-off events. For 992/998 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1062 event pairs, 42 based on Foata normal form. 11/287 useless extension candidates. Maximal degree in co-relation 1160. Up to 187 conditions per place. [2023-01-28 06:58:48,598 INFO L137 encePairwiseOnDemand]: 163/171 looper letters, 31 selfloop transitions, 18 changer transitions 5/57 dead transitions. [2023-01-28 06:58:48,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 535 flow [2023-01-28 06:58:48,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:58:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:58:48,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 462 transitions. [2023-01-28 06:58:48,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4502923976608187 [2023-01-28 06:58:48,599 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 462 transitions. [2023-01-28 06:58:48,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 462 transitions. [2023-01-28 06:58:48,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:48,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 462 transitions. [2023-01-28 06:58:48,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 77.0) internal successors, (462), 6 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:48,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:48,602 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:48,602 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 324 flow. Second operand 6 states and 462 transitions. [2023-01-28 06:58:48,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 535 flow [2023-01-28 06:58:48,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 472 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-01-28 06:58:48,605 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 364 flow [2023-01-28 06:58:48,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-01-28 06:58:48,606 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 26 predicate places. [2023-01-28 06:58:48,606 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 364 flow [2023-01-28 06:58:48,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 72.57142857142857) internal successors, (508), 7 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:48,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:48,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:48,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:58:48,606 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:48,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:48,607 INFO L85 PathProgramCache]: Analyzing trace with hash 204831843, now seen corresponding path program 1 times [2023-01-28 06:58:48,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:48,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578227428] [2023-01-28 06:58:48,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:48,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:48,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:58:48,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:48,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578227428] [2023-01-28 06:58:48,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578227428] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:48,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:48,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:58:48,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278477701] [2023-01-28 06:58:48,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:48,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:58:48,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:48,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:58:48,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:58:48,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 171 [2023-01-28 06:58:48,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:48,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:48,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 171 [2023-01-28 06:58:48,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:48,796 INFO L130 PetriNetUnfolder]: 65/160 cut-off events. [2023-01-28 06:58:48,796 INFO L131 PetriNetUnfolder]: For 793/801 co-relation queries the response was YES. [2023-01-28 06:58:48,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 160 events. 65/160 cut-off events. For 793/801 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 597 event pairs, 17 based on Foata normal form. 32/191 useless extension candidates. Maximal degree in co-relation 651. Up to 71 conditions per place. [2023-01-28 06:58:48,797 INFO L137 encePairwiseOnDemand]: 166/171 looper letters, 32 selfloop transitions, 6 changer transitions 17/61 dead transitions. [2023-01-28 06:58:48,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 549 flow [2023-01-28 06:58:48,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:58:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:58:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2023-01-28 06:58:48,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4760233918128655 [2023-01-28 06:58:48,799 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 407 transitions. [2023-01-28 06:58:48,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 407 transitions. [2023-01-28 06:58:48,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:48,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 407 transitions. [2023-01-28 06:58:48,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:48,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:48,801 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:48,801 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 364 flow. Second operand 5 states and 407 transitions. [2023-01-28 06:58:48,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 549 flow [2023-01-28 06:58:48,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 61 transitions, 437 flow, removed 24 selfloop flow, removed 11 redundant places. [2023-01-28 06:58:48,803 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 214 flow [2023-01-28 06:58:48,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2023-01-28 06:58:48,804 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 20 predicate places. [2023-01-28 06:58:48,804 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 214 flow [2023-01-28 06:58:48,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:48,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:48,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:48,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:58:48,804 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:48,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:48,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1251919722, now seen corresponding path program 1 times [2023-01-28 06:58:48,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:48,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960378261] [2023-01-28 06:58:48,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:48,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:48,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:58:48,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:48,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960378261] [2023-01-28 06:58:48,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960378261] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:48,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:48,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:58:48,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679605123] [2023-01-28 06:58:48,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:48,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:58:48,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:48,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:58:48,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:58:48,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 171 [2023-01-28 06:58:48,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:48,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:48,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 171 [2023-01-28 06:58:48,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:49,017 INFO L130 PetriNetUnfolder]: 43/113 cut-off events. [2023-01-28 06:58:49,017 INFO L131 PetriNetUnfolder]: For 354/363 co-relation queries the response was YES. [2023-01-28 06:58:49,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 113 events. 43/113 cut-off events. For 354/363 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 388 event pairs, 6 based on Foata normal form. 16/128 useless extension candidates. Maximal degree in co-relation 423. Up to 32 conditions per place. [2023-01-28 06:58:49,018 INFO L137 encePairwiseOnDemand]: 166/171 looper letters, 30 selfloop transitions, 9 changer transitions 15/60 dead transitions. [2023-01-28 06:58:49,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 468 flow [2023-01-28 06:58:49,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:58:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:58:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 555 transitions. [2023-01-28 06:58:49,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46365914786967416 [2023-01-28 06:58:49,020 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 555 transitions. [2023-01-28 06:58:49,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 555 transitions. [2023-01-28 06:58:49,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:49,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 555 transitions. [2023-01-28 06:58:49,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 79.28571428571429) internal successors, (555), 7 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-28 06:58:49,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:49,024 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:49,024 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 214 flow. Second operand 7 states and 555 transitions. [2023-01-28 06:58:49,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 468 flow [2023-01-28 06:58:49,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 441 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:49,026 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 235 flow [2023-01-28 06:58:49,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2023-01-28 06:58:49,028 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 27 predicate places. [2023-01-28 06:58:49,028 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 235 flow [2023-01-28 06:58:49,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:49,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:49,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:49,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:58:49,029 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:49,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:49,029 INFO L85 PathProgramCache]: Analyzing trace with hash -442071753, now seen corresponding path program 1 times [2023-01-28 06:58:49,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:49,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004127479] [2023-01-28 06:58:49,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:49,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:49,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:58:49,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:49,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004127479] [2023-01-28 06:58:49,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004127479] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:49,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:49,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:58:49,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135795717] [2023-01-28 06:58:49,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:49,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:58:49,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:49,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:58:49,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:58:49,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 171 [2023-01-28 06:58:49,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 66.83333333333333) internal successors, (401), 6 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:49,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:49,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 171 [2023-01-28 06:58:49,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:49,584 INFO L130 PetriNetUnfolder]: 95/208 cut-off events. [2023-01-28 06:58:49,584 INFO L131 PetriNetUnfolder]: For 545/545 co-relation queries the response was YES. [2023-01-28 06:58:49,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 208 events. 95/208 cut-off events. For 545/545 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 736 event pairs, 6 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 848. Up to 113 conditions per place. [2023-01-28 06:58:49,585 INFO L137 encePairwiseOnDemand]: 164/171 looper letters, 22 selfloop transitions, 3 changer transitions 44/69 dead transitions. [2023-01-28 06:58:49,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 585 flow [2023-01-28 06:58:49,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:58:49,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:58:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 490 transitions. [2023-01-28 06:58:49,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4093567251461988 [2023-01-28 06:58:49,587 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 490 transitions. [2023-01-28 06:58:49,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 490 transitions. [2023-01-28 06:58:49,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:49,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 490 transitions. [2023-01-28 06:58:49,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:49,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:49,589 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:49,589 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 235 flow. Second operand 7 states and 490 transitions. [2023-01-28 06:58:49,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 585 flow [2023-01-28 06:58:49,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 520 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-01-28 06:58:49,592 INFO L231 Difference]: Finished difference. Result has 56 places, 23 transitions, 134 flow [2023-01-28 06:58:49,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=23} [2023-01-28 06:58:49,592 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 29 predicate places. [2023-01-28 06:58:49,593 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 23 transitions, 134 flow [2023-01-28 06:58:49,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.83333333333333) internal successors, (401), 6 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:49,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:49,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:49,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:58:49,593 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:58:49,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1890217341, now seen corresponding path program 2 times [2023-01-28 06:58:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:49,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546128263] [2023-01-28 06:58:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:58:49,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:58:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:58:49,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:58:49,684 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:58:49,684 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 06:58:49,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 06:58:49,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 06:58:49,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 06:58:49,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 06:58:49,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:58:49,686 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2023-01-28 06:58:49,690 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:58:49,690 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:58:49,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:58:49 BasicIcfg [2023-01-28 06:58:49,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:58:49,759 INFO L158 Benchmark]: Toolchain (without parser) took 7591.81ms. Allocated memory was 352.3MB in the beginning and 601.9MB in the end (delta: 249.6MB). Free memory was 291.4MB in the beginning and 555.0MB in the end (delta: -263.6MB). Peak memory consumption was 304.5MB. Max. memory is 16.0GB. [2023-01-28 06:58:49,759 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 352.3MB. Free memory is still 300.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:58:49,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.63ms. Allocated memory is still 352.3MB. Free memory was 291.1MB in the beginning and 268.7MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 06:58:49,759 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.86ms. Allocated memory was 352.3MB in the beginning and 492.8MB in the end (delta: 140.5MB). Free memory was 268.7MB in the beginning and 459.4MB in the end (delta: -190.7MB). Peak memory consumption was 8.8MB. Max. memory is 16.0GB. [2023-01-28 06:58:49,759 INFO L158 Benchmark]: Boogie Preprocessor took 27.18ms. Allocated memory is still 492.8MB. Free memory was 459.4MB in the beginning and 457.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:58:49,759 INFO L158 Benchmark]: RCFGBuilder took 530.60ms. Allocated memory is still 492.8MB. Free memory was 457.3MB in the beginning and 423.7MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-01-28 06:58:49,760 INFO L158 Benchmark]: TraceAbstraction took 6694.22ms. Allocated memory was 492.8MB in the beginning and 601.9MB in the end (delta: 109.1MB). Free memory was 423.7MB in the beginning and 555.0MB in the end (delta: -131.3MB). Peak memory consumption was 295.7MB. Max. memory is 16.0GB. [2023-01-28 06:58:49,761 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.12ms. Allocated memory is still 352.3MB. Free memory is still 300.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 288.63ms. Allocated memory is still 352.3MB. Free memory was 291.1MB in the beginning and 268.7MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 46.86ms. Allocated memory was 352.3MB in the beginning and 492.8MB in the end (delta: 140.5MB). Free memory was 268.7MB in the beginning and 459.4MB in the end (delta: -190.7MB). Peak memory consumption was 8.8MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.18ms. Allocated memory is still 492.8MB. Free memory was 459.4MB in the beginning and 457.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 530.60ms. Allocated memory is still 492.8MB. Free memory was 457.3MB in the beginning and 423.7MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 6694.22ms. Allocated memory was 492.8MB in the beginning and 601.9MB in the end (delta: 109.1MB). Free memory was 423.7MB in the beginning and 555.0MB in the end (delta: -131.3MB). Peak memory consumption was 295.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 94 PlacesBefore, 27 PlacesAfterwards, 89 TransitionsBefore, 21 TransitionsAfterwards, 1156 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, 3436 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1277, independent: 1118, independent conditional: 0, independent unconditional: 1118, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 637, independent: 614, independent conditional: 0, independent unconditional: 614, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1277, independent: 504, independent conditional: 0, independent unconditional: 504, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 637, unknown conditional: 0, unknown unconditional: 637] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1603; [L803] FCALL, FORK 0 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1603, ((void *)0), P0, ((void *)0))=0, t1603={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L804] 0 pthread_t t1604; [L805] FCALL, FORK 0 pthread_create(&t1604, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1604, ((void *)0), P1, ((void *)0))=1, t1603={5:0}, t1604={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L774] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L777] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] 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) [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] 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 [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 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) [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] 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 [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] 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) [L823] 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)) [L824] 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)) [L825] 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)) [L826] 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)) [L827] 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)) [L828] 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)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, 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: 805]: 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: 803]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 111 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 168 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 763 IncrementalHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 21 mSDtfsCounter, 763 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=6, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 1085 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 06:58:49,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...