/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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:58:16,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:58:16,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:58:16,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:58:16,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:58:16,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:58:16,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:58:16,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:58:16,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:58:16,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:58:16,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:58:16,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:58:16,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:58:16,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:58:16,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:58:16,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:58:16,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:58:16,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:58:16,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:58:16,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:58:16,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:58:16,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:58:16,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:58:16,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:58:16,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:58:16,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:58:16,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:58:16,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:58:16,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:58:16,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:58:16,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:58:16,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:58:16,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:58:16,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:58:16,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:58:16,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:58:16,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:58:16,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:58:16,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:58:16,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:58:16,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:58:16,366 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:16,411 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:58:16,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:58:16,412 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:58:16,412 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:58:16,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:58:16,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:58:16,413 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:58:16,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:58:16,413 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:58:16,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:58:16,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:58:16,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:58:16,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:58:16,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:58:16,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:58:16,413 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:58:16,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:58:16,414 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:58:16,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:58:16,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:58:16,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:58:16,414 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:58:16,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:58:16,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:58:16,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:58:16,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:58:16,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:58:16,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:58:16,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:58:16,415 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:58:16,415 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:58:16,415 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:16,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:58:16,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:58:16,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:58:16,642 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:58:16,643 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:58:16,644 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-01-28 06:58:17,674 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:58:17,843 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:58:17,843 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-01-28 06:58:17,853 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dbd03a1b/adb6782b6bfb43eda795dad14ee2abcb/FLAGc5a97fd50 [2023-01-28 06:58:17,863 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dbd03a1b/adb6782b6bfb43eda795dad14ee2abcb [2023-01-28 06:58:17,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:58:17,866 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:58:17,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:58:17,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:58:17,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:58:17,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:58:17" (1/1) ... [2023-01-28 06:58:17,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d0cb7b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:17, skipping insertion in model container [2023-01-28 06:58:17,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:58:17" (1/1) ... [2023-01-28 06:58:17,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:58:17,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:58:18,038 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-01-28 06:58:18,178 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:58:18,188 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:58:18,197 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-01-28 06:58:18,223 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:58:18,245 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:58:18,245 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:58:18,250 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:58:18,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:18 WrapperNode [2023-01-28 06:58:18,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:58:18,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:58:18,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:58:18,251 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:58:18,256 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:18" (1/1) ... [2023-01-28 06:58:18,280 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:18" (1/1) ... [2023-01-28 06:58:18,297 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-01-28 06:58:18,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:58:18,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:58:18,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:58:18,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:58:18,304 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:18" (1/1) ... [2023-01-28 06:58:18,305 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:18" (1/1) ... [2023-01-28 06:58:18,307 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:18" (1/1) ... [2023-01-28 06:58:18,307 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:18" (1/1) ... [2023-01-28 06:58:18,312 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:18" (1/1) ... [2023-01-28 06:58:18,313 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:18" (1/1) ... [2023-01-28 06:58:18,314 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:18" (1/1) ... [2023-01-28 06:58:18,315 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:18" (1/1) ... [2023-01-28 06:58:18,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:58:18,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:58:18,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:58:18,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:58:18,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:18" (1/1) ... [2023-01-28 06:58:18,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:58:18,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:58:18,350 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:18,389 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:18,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:58:18,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:58:18,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:58:18,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:58:18,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:58:18,402 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:58:18,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:58:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:58:18,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:58:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:58:18,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:58:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:58:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:58:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:58:18,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:58:18,405 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:18,535 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:58:18,537 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:58:18,758 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:58:18,867 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:58:18,867 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:58:18,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:58:18 BoogieIcfgContainer [2023-01-28 06:58:18,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:58:18,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:58:18,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:58:18,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:58:18,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:58:17" (1/3) ... [2023-01-28 06:58:18,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1051599e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:58:18, skipping insertion in model container [2023-01-28 06:58:18,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:18" (2/3) ... [2023-01-28 06:58:18,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1051599e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:58:18, skipping insertion in model container [2023-01-28 06:58:18,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:58:18" (3/3) ... [2023-01-28 06:58:18,875 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-01-28 06:58:18,886 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:58:18,887 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:58:18,887 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:58:18,935 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:58:18,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2023-01-28 06:58:19,019 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2023-01-28 06:58:19,019 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:58:19,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-28 06:58:19,023 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2023-01-28 06:58:19,028 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2023-01-28 06:58:19,043 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:58:19,070 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2023-01-28 06:58:19,072 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2023-01-28 06:58:19,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2023-01-28 06:58:19,104 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2023-01-28 06:58:19,104 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:58:19,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-28 06:58:19,106 INFO L119 LiptonReduction]: Number of co-enabled transitions 1776 [2023-01-28 06:58:22,131 INFO L134 LiptonReduction]: Checked pairs total: 4571 [2023-01-28 06:58:22,132 INFO L136 LiptonReduction]: Total number of compositions: 89 [2023-01-28 06:58:22,146 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:58:22,152 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;@7ea6b337, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:58:22,153 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 06:58:22,156 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2023-01-28 06:58:22,156 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:58:22,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:22,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:22,157 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:22,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:22,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1774848592, now seen corresponding path program 1 times [2023-01-28 06:58:22,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:22,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693965872] [2023-01-28 06:58:22,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:22,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:22,433 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:22,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:22,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693965872] [2023-01-28 06:58:22,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693965872] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:22,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:22,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:58:22,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615669602] [2023-01-28 06:58:22,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:22,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:58:22,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:22,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:58:22,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:58:22,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 195 [2023-01-28 06:58:22,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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:22,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:22,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 195 [2023-01-28 06:58:22,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:22,653 INFO L130 PetriNetUnfolder]: 719/1175 cut-off events. [2023-01-28 06:58:22,654 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-01-28 06:58:22,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 1175 events. 719/1175 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6024 event pairs, 146 based on Foata normal form. 48/1123 useless extension candidates. Maximal degree in co-relation 2287. Up to 826 conditions per place. [2023-01-28 06:58:22,663 INFO L137 encePairwiseOnDemand]: 191/195 looper letters, 25 selfloop transitions, 2 changer transitions 4/34 dead transitions. [2023-01-28 06:58:22,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 139 flow [2023-01-28 06:58:22,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:58:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:58:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-01-28 06:58:22,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.535042735042735 [2023-01-28 06:58:22,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-01-28 06:58:22,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-01-28 06:58:22,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:22,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-01-28 06:58:22,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states 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:22,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states 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:22,690 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states 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:22,691 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 313 transitions. [2023-01-28 06:58:22,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 139 flow [2023-01-28 06:58:22,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 136 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 06:58:22,694 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-01-28 06:58:22,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-01-28 06:58:22,698 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-28 06:58:22,699 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-01-28 06:58:22,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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:22,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:22,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:22,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:58:22,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:22,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:22,701 INFO L85 PathProgramCache]: Analyzing trace with hash -826344673, now seen corresponding path program 1 times [2023-01-28 06:58:22,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:22,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546889029] [2023-01-28 06:58:22,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:22,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:23,247 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:23,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:23,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546889029] [2023-01-28 06:58:23,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546889029] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:23,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:23,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:58:23,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71565337] [2023-01-28 06:58:23,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:23,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:58:23,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:23,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:58:23,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:58:23,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 195 [2023-01-28 06:58:23,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states 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:23,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:23,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 195 [2023-01-28 06:58:23,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:23,618 INFO L130 PetriNetUnfolder]: 1734/2653 cut-off events. [2023-01-28 06:58:23,618 INFO L131 PetriNetUnfolder]: For 164/164 co-relation queries the response was YES. [2023-01-28 06:58:23,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5542 conditions, 2653 events. 1734/2653 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13153 event pairs, 158 based on Foata normal form. 148/2801 useless extension candidates. Maximal degree in co-relation 5532. Up to 1664 conditions per place. [2023-01-28 06:58:23,629 INFO L137 encePairwiseOnDemand]: 185/195 looper letters, 38 selfloop transitions, 10 changer transitions 29/77 dead transitions. [2023-01-28 06:58:23,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 77 transitions, 334 flow [2023-01-28 06:58:23,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:58:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:58:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 619 transitions. [2023-01-28 06:58:23,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4534798534798535 [2023-01-28 06:58:23,631 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 619 transitions. [2023-01-28 06:58:23,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 619 transitions. [2023-01-28 06:58:23,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:23,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 619 transitions. [2023-01-28 06:58:23,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.42857142857143) internal successors, (619), 7 states have internal predecessors, (619), 0 states have call successors, (0), 0 states 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:23,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states 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:23,635 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states 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:23,635 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 7 states and 619 transitions. [2023-01-28 06:58:23,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 77 transitions, 334 flow [2023-01-28 06:58:23,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 77 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:23,637 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 125 flow [2023-01-28 06:58:23,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=125, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-01-28 06:58:23,638 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2023-01-28 06:58:23,638 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 125 flow [2023-01-28 06:58:23,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states 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:23,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:23,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:23,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:58:23,639 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:23,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:23,639 INFO L85 PathProgramCache]: Analyzing trace with hash 153095469, now seen corresponding path program 1 times [2023-01-28 06:58:23,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:23,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624843276] [2023-01-28 06:58:23,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:23,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:23,974 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:23,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:23,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624843276] [2023-01-28 06:58:23,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624843276] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:23,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:23,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:58:23,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955597511] [2023-01-28 06:58:23,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:23,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:58:23,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:23,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:58:23,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:58:23,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 195 [2023-01-28 06:58:23,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:23,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:23,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 195 [2023-01-28 06:58:23,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:24,189 INFO L130 PetriNetUnfolder]: 1336/2150 cut-off events. [2023-01-28 06:58:24,190 INFO L131 PetriNetUnfolder]: For 1922/1954 co-relation queries the response was YES. [2023-01-28 06:58:24,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6382 conditions, 2150 events. 1336/2150 cut-off events. For 1922/1954 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11134 event pairs, 445 based on Foata normal form. 107/2242 useless extension candidates. Maximal degree in co-relation 6367. Up to 1632 conditions per place. [2023-01-28 06:58:24,202 INFO L137 encePairwiseOnDemand]: 190/195 looper letters, 34 selfloop transitions, 4 changer transitions 19/61 dead transitions. [2023-01-28 06:58:24,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 61 transitions, 361 flow [2023-01-28 06:58:24,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:58:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:58:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2023-01-28 06:58:24,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2023-01-28 06:58:24,204 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 475 transitions. [2023-01-28 06:58:24,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 475 transitions. [2023-01-28 06:58:24,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:24,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 475 transitions. [2023-01-28 06:58:24,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:24,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states 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:24,207 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states 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:24,207 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 125 flow. Second operand 5 states and 475 transitions. [2023-01-28 06:58:24,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 61 transitions, 361 flow [2023-01-28 06:58:24,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 61 transitions, 357 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:24,217 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 164 flow [2023-01-28 06:58:24,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2023-01-28 06:58:24,218 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-01-28 06:58:24,220 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 164 flow [2023-01-28 06:58:24,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:24,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:24,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:24,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:58:24,221 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:24,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:24,221 INFO L85 PathProgramCache]: Analyzing trace with hash 484283713, now seen corresponding path program 1 times [2023-01-28 06:58:24,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:24,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469108096] [2023-01-28 06:58:24,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:24,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:24,627 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:24,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:24,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469108096] [2023-01-28 06:58:24,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469108096] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:24,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:24,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:58:24,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245937725] [2023-01-28 06:58:24,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:24,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:58:24,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:24,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:58:24,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:58:24,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 195 [2023-01-28 06:58:24,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:24,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:24,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 195 [2023-01-28 06:58:24,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:24,921 INFO L130 PetriNetUnfolder]: 1406/2219 cut-off events. [2023-01-28 06:58:24,921 INFO L131 PetriNetUnfolder]: For 2663/2701 co-relation queries the response was YES. [2023-01-28 06:58:24,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7204 conditions, 2219 events. 1406/2219 cut-off events. For 2663/2701 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 11493 event pairs, 720 based on Foata normal form. 91/2270 useless extension candidates. Maximal degree in co-relation 7186. Up to 1560 conditions per place. [2023-01-28 06:58:24,931 INFO L137 encePairwiseOnDemand]: 189/195 looper letters, 36 selfloop transitions, 7 changer transitions 20/67 dead transitions. [2023-01-28 06:58:24,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 67 transitions, 466 flow [2023-01-28 06:58:24,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:58:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:58:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2023-01-28 06:58:24,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4752136752136752 [2023-01-28 06:58:24,933 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 556 transitions. [2023-01-28 06:58:24,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 556 transitions. [2023-01-28 06:58:24,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:24,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 556 transitions. [2023-01-28 06:58:24,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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:24,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states 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:24,940 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states 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:24,940 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 164 flow. Second operand 6 states and 556 transitions. [2023-01-28 06:58:24,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 67 transitions, 466 flow [2023-01-28 06:58:24,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 67 transitions, 456 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:24,946 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 220 flow [2023-01-28 06:58:24,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-01-28 06:58:24,948 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2023-01-28 06:58:24,948 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 220 flow [2023-01-28 06:58:24,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:24,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:24,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:24,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:58:24,948 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:24,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:24,949 INFO L85 PathProgramCache]: Analyzing trace with hash 447312121, now seen corresponding path program 1 times [2023-01-28 06:58:24,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:24,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892904874] [2023-01-28 06:58:24,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:24,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:25,492 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:25,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:25,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892904874] [2023-01-28 06:58:25,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892904874] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:25,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:25,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:58:25,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308986204] [2023-01-28 06:58:25,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:25,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:58:25,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:25,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:58:25,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:58:25,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 195 [2023-01-28 06:58:25,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 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:25,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:25,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 195 [2023-01-28 06:58:25,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:25,952 INFO L130 PetriNetUnfolder]: 1603/2498 cut-off events. [2023-01-28 06:58:25,952 INFO L131 PetriNetUnfolder]: For 5138/5138 co-relation queries the response was YES. [2023-01-28 06:58:25,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9103 conditions, 2498 events. 1603/2498 cut-off events. For 5138/5138 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12085 event pairs, 261 based on Foata normal form. 120/2618 useless extension candidates. Maximal degree in co-relation 9082. Up to 1377 conditions per place. [2023-01-28 06:58:25,969 INFO L137 encePairwiseOnDemand]: 184/195 looper letters, 56 selfloop transitions, 22 changer transitions 36/114 dead transitions. [2023-01-28 06:58:25,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 114 transitions, 868 flow [2023-01-28 06:58:25,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:58:25,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:58:25,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 702 transitions. [2023-01-28 06:58:25,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2023-01-28 06:58:25,972 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 702 transitions. [2023-01-28 06:58:25,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 702 transitions. [2023-01-28 06:58:25,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:25,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 702 transitions. [2023-01-28 06:58:25,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 87.75) internal successors, (702), 8 states have internal predecessors, (702), 0 states have call successors, (0), 0 states 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:25,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states 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:25,977 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states 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:25,977 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 220 flow. Second operand 8 states and 702 transitions. [2023-01-28 06:58:25,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 114 transitions, 868 flow [2023-01-28 06:58:25,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 114 transitions, 843 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-28 06:58:25,986 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 429 flow [2023-01-28 06:58:25,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=429, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2023-01-28 06:58:25,988 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2023-01-28 06:58:25,988 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 429 flow [2023-01-28 06:58:25,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 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:25,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:25,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:25,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:58:25,989 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:25,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2127818838, now seen corresponding path program 1 times [2023-01-28 06:58:25,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:25,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468727193] [2023-01-28 06:58:25,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:25,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:26,564 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:26,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:26,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468727193] [2023-01-28 06:58:26,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468727193] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:26,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:26,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:58:26,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230900726] [2023-01-28 06:58:26,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:26,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:58:26,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:26,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:58:26,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:58:26,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 195 [2023-01-28 06:58:26,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 429 flow. Second operand has 7 states, 7 states have (on average 85.85714285714286) internal successors, (601), 7 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:26,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:26,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 195 [2023-01-28 06:58:26,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:26,899 INFO L130 PetriNetUnfolder]: 1344/2190 cut-off events. [2023-01-28 06:58:26,899 INFO L131 PetriNetUnfolder]: For 8301/8392 co-relation queries the response was YES. [2023-01-28 06:58:26,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9212 conditions, 2190 events. 1344/2190 cut-off events. For 8301/8392 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11469 event pairs, 133 based on Foata normal form. 114/2286 useless extension candidates. Maximal degree in co-relation 9186. Up to 849 conditions per place. [2023-01-28 06:58:26,912 INFO L137 encePairwiseOnDemand]: 189/195 looper letters, 55 selfloop transitions, 14 changer transitions 17/94 dead transitions. [2023-01-28 06:58:26,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 94 transitions, 845 flow [2023-01-28 06:58:26,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:58:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:58:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 817 transitions. [2023-01-28 06:58:26,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4655270655270655 [2023-01-28 06:58:26,914 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 817 transitions. [2023-01-28 06:58:26,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 817 transitions. [2023-01-28 06:58:26,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:26,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 817 transitions. [2023-01-28 06:58:26,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 0 states have call successors, (0), 0 states 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:26,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states 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:26,918 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states 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:26,918 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 429 flow. Second operand 9 states and 817 transitions. [2023-01-28 06:58:26,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 94 transitions, 845 flow [2023-01-28 06:58:26,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 94 transitions, 803 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-01-28 06:58:26,931 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 451 flow [2023-01-28 06:58:26,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=451, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2023-01-28 06:58:26,933 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 28 predicate places. [2023-01-28 06:58:26,933 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 451 flow [2023-01-28 06:58:26,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.85714285714286) internal successors, (601), 7 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:26,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:26,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:26,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:58:26,934 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:26,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:26,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1582345394, now seen corresponding path program 1 times [2023-01-28 06:58:26,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:26,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488493611] [2023-01-28 06:58:26,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:26,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:27,087 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:27,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:27,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488493611] [2023-01-28 06:58:27,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488493611] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:27,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:27,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:58:27,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307419401] [2023-01-28 06:58:27,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:27,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:58:27,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:27,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:58:27,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:58:27,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 195 [2023-01-28 06:58:27,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 451 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states 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:27,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:27,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 195 [2023-01-28 06:58:27,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:27,359 INFO L130 PetriNetUnfolder]: 874/1498 cut-off events. [2023-01-28 06:58:27,359 INFO L131 PetriNetUnfolder]: For 8521/8866 co-relation queries the response was YES. [2023-01-28 06:58:27,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6586 conditions, 1498 events. 874/1498 cut-off events. For 8521/8866 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8189 event pairs, 162 based on Foata normal form. 375/1851 useless extension candidates. Maximal degree in co-relation 6554. Up to 921 conditions per place. [2023-01-28 06:58:27,370 INFO L137 encePairwiseOnDemand]: 189/195 looper letters, 81 selfloop transitions, 7 changer transitions 30/129 dead transitions. [2023-01-28 06:58:27,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 129 transitions, 1442 flow [2023-01-28 06:58:27,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:58:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:58:27,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2023-01-28 06:58:27,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48615384615384616 [2023-01-28 06:58:27,372 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 474 transitions. [2023-01-28 06:58:27,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 474 transitions. [2023-01-28 06:58:27,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:27,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 474 transitions. [2023-01-28 06:58:27,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.8) internal successors, (474), 5 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:27,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states 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:27,374 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states 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:27,375 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 451 flow. Second operand 5 states and 474 transitions. [2023-01-28 06:58:27,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 129 transitions, 1442 flow [2023-01-28 06:58:27,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 129 transitions, 1387 flow, removed 22 selfloop flow, removed 7 redundant places. [2023-01-28 06:58:27,382 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 492 flow [2023-01-28 06:58:27,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=492, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2023-01-28 06:58:27,382 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2023-01-28 06:58:27,382 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 492 flow [2023-01-28 06:58:27,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states 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:27,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:27,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:27,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:58:27,383 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:27,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:27,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1772105776, now seen corresponding path program 1 times [2023-01-28 06:58:27,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:27,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160756891] [2023-01-28 06:58:27,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:27,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:27,543 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:27,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:27,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160756891] [2023-01-28 06:58:27,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160756891] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:27,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:27,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:58:27,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323201831] [2023-01-28 06:58:27,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:27,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:58:27,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:27,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:58:27,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:58:27,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 195 [2023-01-28 06:58:27,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 492 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states 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:27,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:27,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 195 [2023-01-28 06:58:27,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:27,716 INFO L130 PetriNetUnfolder]: 604/1091 cut-off events. [2023-01-28 06:58:27,716 INFO L131 PetriNetUnfolder]: For 6329/6747 co-relation queries the response was YES. [2023-01-28 06:58:27,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5417 conditions, 1091 events. 604/1091 cut-off events. For 6329/6747 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6021 event pairs, 50 based on Foata normal form. 357/1433 useless extension candidates. Maximal degree in co-relation 5387. Up to 432 conditions per place. [2023-01-28 06:58:27,725 INFO L137 encePairwiseOnDemand]: 189/195 looper letters, 89 selfloop transitions, 13 changer transitions 44/157 dead transitions. [2023-01-28 06:58:27,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 157 transitions, 1752 flow [2023-01-28 06:58:27,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:58:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:58:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 662 transitions. [2023-01-28 06:58:27,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484981684981685 [2023-01-28 06:58:27,727 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 662 transitions. [2023-01-28 06:58:27,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 662 transitions. [2023-01-28 06:58:27,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:27,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 662 transitions. [2023-01-28 06:58:27,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 0 states have call successors, (0), 0 states 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:27,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states 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:27,731 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states 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:27,731 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 492 flow. Second operand 7 states and 662 transitions. [2023-01-28 06:58:27,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 157 transitions, 1752 flow [2023-01-28 06:58:27,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 157 transitions, 1739 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:27,743 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 551 flow [2023-01-28 06:58:27,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=551, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2023-01-28 06:58:27,744 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 32 predicate places. [2023-01-28 06:58:27,744 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 551 flow [2023-01-28 06:58:27,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states 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:27,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:27,745 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:27,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:58:27,745 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:27,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:27,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1697590619, now seen corresponding path program 1 times [2023-01-28 06:58:27,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:27,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818149092] [2023-01-28 06:58:27,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:27,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:28,090 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:28,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:28,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818149092] [2023-01-28 06:58:28,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818149092] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:28,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:28,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:58:28,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812707516] [2023-01-28 06:58:28,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:28,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:58:28,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:28,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:58:28,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:58:28,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 195 [2023-01-28 06:58:28,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 551 flow. Second operand has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:28,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:28,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 195 [2023-01-28 06:58:28,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:28,456 INFO L130 PetriNetUnfolder]: 1062/1973 cut-off events. [2023-01-28 06:58:28,456 INFO L131 PetriNetUnfolder]: For 10871/10871 co-relation queries the response was YES. [2023-01-28 06:58:28,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10881 conditions, 1973 events. 1062/1973 cut-off events. For 10871/10871 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11730 event pairs, 98 based on Foata normal form. 13/1986 useless extension candidates. Maximal degree in co-relation 10848. Up to 761 conditions per place. [2023-01-28 06:58:28,463 INFO L137 encePairwiseOnDemand]: 184/195 looper letters, 66 selfloop transitions, 16 changer transitions 89/171 dead transitions. [2023-01-28 06:58:28,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 171 transitions, 1906 flow [2023-01-28 06:58:28,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:58:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:58:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 602 transitions. [2023-01-28 06:58:28,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.441025641025641 [2023-01-28 06:58:28,465 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 602 transitions. [2023-01-28 06:58:28,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 602 transitions. [2023-01-28 06:58:28,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:28,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 602 transitions. [2023-01-28 06:58:28,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 0 states have call successors, (0), 0 states 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:28,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states 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:28,468 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states 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:28,468 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 551 flow. Second operand 7 states and 602 transitions. [2023-01-28 06:58:28,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 171 transitions, 1906 flow [2023-01-28 06:58:28,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 171 transitions, 1797 flow, removed 40 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:28,498 INFO L231 Difference]: Finished difference. Result has 75 places, 51 transitions, 529 flow [2023-01-28 06:58:28,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=529, PETRI_PLACES=75, PETRI_TRANSITIONS=51} [2023-01-28 06:58:28,498 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 41 predicate places. [2023-01-28 06:58:28,498 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 51 transitions, 529 flow [2023-01-28 06:58:28,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:28,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:28,499 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:28,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:58:28,499 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:28,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:28,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1698519933, now seen corresponding path program 2 times [2023-01-28 06:58:28,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:28,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66638661] [2023-01-28 06:58:28,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:28,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:58:28,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:28,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66638661] [2023-01-28 06:58:28,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66638661] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:28,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:28,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:58:28,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758416802] [2023-01-28 06:58:28,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:28,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:58:28,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:28,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:58:28,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:58:28,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 195 [2023-01-28 06:58:28,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 51 transitions, 529 flow. Second operand has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 0 states have call successors, (0), 0 states 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:28,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:28,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 195 [2023-01-28 06:58:28,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:28,943 INFO L130 PetriNetUnfolder]: 353/734 cut-off events. [2023-01-28 06:58:28,943 INFO L131 PetriNetUnfolder]: For 4710/4710 co-relation queries the response was YES. [2023-01-28 06:58:28,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4088 conditions, 734 events. 353/734 cut-off events. For 4710/4710 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3657 event pairs, 99 based on Foata normal form. 14/748 useless extension candidates. Maximal degree in co-relation 4049. Up to 362 conditions per place. [2023-01-28 06:58:28,946 INFO L137 encePairwiseOnDemand]: 189/195 looper letters, 47 selfloop transitions, 9 changer transitions 29/85 dead transitions. [2023-01-28 06:58:28,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 85 transitions, 995 flow [2023-01-28 06:58:28,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:58:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:58:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 512 transitions. [2023-01-28 06:58:28,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4376068376068376 [2023-01-28 06:58:28,947 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 512 transitions. [2023-01-28 06:58:28,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 512 transitions. [2023-01-28 06:58:28,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:28,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 512 transitions. [2023-01-28 06:58:28,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:28,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states 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:28,950 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states 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:28,950 INFO L175 Difference]: Start difference. First operand has 75 places, 51 transitions, 529 flow. Second operand 6 states and 512 transitions. [2023-01-28 06:58:28,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 85 transitions, 995 flow [2023-01-28 06:58:28,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 85 transitions, 918 flow, removed 26 selfloop flow, removed 8 redundant places. [2023-01-28 06:58:28,960 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 435 flow [2023-01-28 06:58:28,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=435, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2023-01-28 06:58:28,961 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2023-01-28 06:58:28,961 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 46 transitions, 435 flow [2023-01-28 06:58:28,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 0 states have call successors, (0), 0 states 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:28,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:28,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:28,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:58:28,962 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:28,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:28,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1987004076, now seen corresponding path program 1 times [2023-01-28 06:58:28,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:28,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651262349] [2023-01-28 06:58:28,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:28,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:29,148 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:29,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:29,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651262349] [2023-01-28 06:58:29,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651262349] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:29,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:29,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:58:29,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548368260] [2023-01-28 06:58:29,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:29,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:58:29,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:29,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:58:29,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:58:29,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 195 [2023-01-28 06:58:29,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 46 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states 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:29,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:29,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 195 [2023-01-28 06:58:29,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:29,234 INFO L130 PetriNetUnfolder]: 144/346 cut-off events. [2023-01-28 06:58:29,234 INFO L131 PetriNetUnfolder]: For 1664/1697 co-relation queries the response was YES. [2023-01-28 06:58:29,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1654 conditions, 346 events. 144/346 cut-off events. For 1664/1697 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1686 event pairs, 19 based on Foata normal form. 60/399 useless extension candidates. Maximal degree in co-relation 1621. Up to 109 conditions per place. [2023-01-28 06:58:29,236 INFO L137 encePairwiseOnDemand]: 189/195 looper letters, 23 selfloop transitions, 10 changer transitions 43/79 dead transitions. [2023-01-28 06:58:29,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 79 transitions, 865 flow [2023-01-28 06:58:29,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:58:29,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:58:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 642 transitions. [2023-01-28 06:58:29,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4703296703296703 [2023-01-28 06:58:29,237 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 642 transitions. [2023-01-28 06:58:29,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 642 transitions. [2023-01-28 06:58:29,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:29,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 642 transitions. [2023-01-28 06:58:29,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states 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:29,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states 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:29,240 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states 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:29,240 INFO L175 Difference]: Start difference. First operand has 69 places, 46 transitions, 435 flow. Second operand 7 states and 642 transitions. [2023-01-28 06:58:29,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 79 transitions, 865 flow [2023-01-28 06:58:29,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 772 flow, removed 29 selfloop flow, removed 8 redundant places. [2023-01-28 06:58:29,244 INFO L231 Difference]: Finished difference. Result has 68 places, 29 transitions, 232 flow [2023-01-28 06:58:29,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=232, PETRI_PLACES=68, PETRI_TRANSITIONS=29} [2023-01-28 06:58:29,245 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2023-01-28 06:58:29,245 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 29 transitions, 232 flow [2023-01-28 06:58:29,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states 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:29,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:29,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:29,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:58:29,245 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:29,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:29,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1400357473, now seen corresponding path program 1 times [2023-01-28 06:58:29,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:29,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122337283] [2023-01-28 06:58:29,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:29,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:58:29,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:58:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:58:29,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:58:29,337 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:58:29,338 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 06:58:29,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 06:58:29,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 06:58:29,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 06:58:29,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 06:58:29,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 06:58:29,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:58:29,340 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:29,343 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:58:29,344 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:58:29,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:58:29 BasicIcfg [2023-01-28 06:58:29,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:58:29,403 INFO L158 Benchmark]: Toolchain (without parser) took 11536.91ms. Allocated memory was 383.8MB in the beginning and 677.4MB in the end (delta: 293.6MB). Free memory was 351.8MB in the beginning and 420.3MB in the end (delta: -68.5MB). Peak memory consumption was 227.0MB. Max. memory is 16.0GB. [2023-01-28 06:58:29,403 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 213.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:58:29,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.91ms. Allocated memory is still 383.8MB. Free memory was 351.6MB in the beginning and 328.5MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 06:58:29,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.84ms. Allocated memory is still 383.8MB. Free memory was 328.5MB in the beginning and 325.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 06:58:29,403 INFO L158 Benchmark]: Boogie Preprocessor took 18.92ms. Allocated memory is still 383.8MB. Free memory was 325.9MB in the beginning and 324.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:58:29,403 INFO L158 Benchmark]: RCFGBuilder took 551.59ms. Allocated memory is still 383.8MB. Free memory was 324.3MB in the beginning and 291.3MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-01-28 06:58:29,404 INFO L158 Benchmark]: TraceAbstraction took 10531.66ms. Allocated memory was 383.8MB in the beginning and 677.4MB in the end (delta: 293.6MB). Free memory was 290.2MB in the beginning and 420.3MB in the end (delta: -130.0MB). Peak memory consumption was 164.1MB. Max. memory is 16.0GB. [2023-01-28 06:58:29,404 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 255.9MB. Free memory is still 213.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 383.91ms. Allocated memory is still 383.8MB. Free memory was 351.6MB in the beginning and 328.5MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 46.84ms. Allocated memory is still 383.8MB. Free memory was 328.5MB in the beginning and 325.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 18.92ms. Allocated memory is still 383.8MB. Free memory was 325.9MB in the beginning and 324.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 551.59ms. Allocated memory is still 383.8MB. Free memory was 324.3MB in the beginning and 291.3MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 10531.66ms. Allocated memory was 383.8MB in the beginning and 677.4MB in the end (delta: 293.6MB). Free memory was 290.2MB in the beginning and 420.3MB in the end (delta: -130.0MB). Peak memory consumption was 164.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 111 PlacesBefore, 34 PlacesAfterwards, 103 TransitionsBefore, 25 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 4571 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1921, independent: 1748, independent conditional: 0, independent unconditional: 1748, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 961, independent: 930, independent conditional: 0, independent unconditional: 930, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1921, independent: 818, independent conditional: 0, independent unconditional: 818, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 961, unknown conditional: 0, unknown unconditional: 961] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [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$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=-2, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=-1, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L762] 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) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 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 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 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) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 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) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 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)) [L840] 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)) [L841] 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)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 818]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 346 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 346 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1056 IncrementalHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 32 mSDtfsCounter, 1056 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=551occurred in iteration=8, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 1219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:29,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...