/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 BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:38:50,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:38:50,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:38:50,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:38:50,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:38:50,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:38:50,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:38:50,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:38:50,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:38:50,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:38:50,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:38:50,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:38:50,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:38:50,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:38:50,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:38:50,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:38:50,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:38:50,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:38:50,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:38:50,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:38:50,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:38:50,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:38:50,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:38:50,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:38:50,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:38:50,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:38:50,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:38:50,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:38:50,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:38:50,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:38:50,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:38:50,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:38:50,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:38:50,416 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:38:50,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:38:50,417 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:38:50,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:38:50,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:38:50,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:38:50,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:38:50,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:38:50,421 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 00:38:50,451 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:38:50,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:38:50,452 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:38:50,452 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:38:50,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:38:50,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:38:50,453 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:38:50,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:38:50,453 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:38:50,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:38:50,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:38:50,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:38:50,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:38:50,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:38:50,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:38:50,454 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:38:50,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:38:50,454 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:38:50,454 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:38:50,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:38:50,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:38:50,455 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:38:50,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:38:50,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:38:50,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:38:50,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:38:50,455 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:38:50,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:38:50,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:38:50,455 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:38:50,455 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:38:50,456 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 -> BEFORE [2023-01-28 00:38:50,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:38:50,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:38:50,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:38:50,663 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:38:50,663 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:38:50,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 00:38:51,805 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:38:52,033 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:38:52,034 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 00:38:52,051 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3968d1d6/72c097074bde42b89efcf8c227cecc7a/FLAG18ce49c24 [2023-01-28 00:38:52,063 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3968d1d6/72c097074bde42b89efcf8c227cecc7a [2023-01-28 00:38:52,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:38:52,065 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:38:52,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:38:52,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:38:52,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:38:52,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:38:52" (1/1) ... [2023-01-28 00:38:52,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d32e0d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:52, skipping insertion in model container [2023-01-28 00:38:52,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:38:52" (1/1) ... [2023-01-28 00:38:52,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:38:52,119 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:38:52,263 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/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-28 00:38:52,487 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:38:52,496 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:38:52,506 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/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-28 00:38:52,575 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:38:52,600 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:38:52,600 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:38:52,608 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:38:52,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:52 WrapperNode [2023-01-28 00:38:52,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:38:52,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:38:52,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:38:52,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:38:52,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:52" (1/1) ... [2023-01-28 00:38:52,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:52" (1/1) ... [2023-01-28 00:38:52,685 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-01-28 00:38:52,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:38:52,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:38:52,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:38:52,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:38:52,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:52" (1/1) ... [2023-01-28 00:38:52,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:52" (1/1) ... [2023-01-28 00:38:52,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:52" (1/1) ... [2023-01-28 00:38:52,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:52" (1/1) ... [2023-01-28 00:38:52,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:52" (1/1) ... [2023-01-28 00:38:52,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:52" (1/1) ... [2023-01-28 00:38:52,719 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:52" (1/1) ... [2023-01-28 00:38:52,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:52" (1/1) ... [2023-01-28 00:38:52,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:38:52,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:38:52,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:38:52,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:38:52,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:52" (1/1) ... [2023-01-28 00:38:52,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:38:52,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:38:52,779 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 00:38:52,790 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 00:38:52,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:38:52,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:38:52,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:38:52,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:38:52,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:38:52,817 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:38:52,817 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:38:52,821 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:38:52,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:38:52,823 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:38:52,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:38:52,823 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 00:38:52,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 00:38:52,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:38:52,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:38:52,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:38:52,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:38:52,825 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 00:38:52,978 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:38:52,980 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:38:53,353 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:38:53,510 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:38:53,510 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:38:53,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:38:53 BoogieIcfgContainer [2023-01-28 00:38:53,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:38:53,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:38:53,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:38:53,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:38:53,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:38:52" (1/3) ... [2023-01-28 00:38:53,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1fce00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:38:53, skipping insertion in model container [2023-01-28 00:38:53,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:52" (2/3) ... [2023-01-28 00:38:53,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1fce00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:38:53, skipping insertion in model container [2023-01-28 00:38:53,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:38:53" (3/3) ... [2023-01-28 00:38:53,519 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 00:38:53,535 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:38:53,535 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:38:53,535 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:38:53,610 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:38:53,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2023-01-28 00:38:53,714 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-01-28 00:38:53,714 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:38:53,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-28 00:38:53,718 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2023-01-28 00:38:53,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-01-28 00:38:53,732 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:38:53,744 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-01-28 00:38:53,746 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-01-28 00:38:53,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-01-28 00:38:53,769 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-01-28 00:38:53,769 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:38:53,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-28 00:38:53,772 INFO L119 LiptonReduction]: Number of co-enabled transitions 3300 [2023-01-28 00:38:57,665 INFO L134 LiptonReduction]: Checked pairs total: 10097 [2023-01-28 00:38:57,665 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-01-28 00:38:57,677 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:38:57,682 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;@4effaca3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:38:57,683 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-28 00:38:57,685 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 00:38:57,685 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:38:57,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:38:57,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 00:38:57,686 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:38:57,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:38:57,690 INFO L85 PathProgramCache]: Analyzing trace with hash 552505, now seen corresponding path program 1 times [2023-01-28 00:38:57,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:38:57,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833994624] [2023-01-28 00:38:57,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:38:57,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:38:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:38:58,025 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 00:38:58,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:38:58,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833994624] [2023-01-28 00:38:58,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833994624] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:38:58,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:38:58,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:38:58,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264179401] [2023-01-28 00:38:58,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:38:58,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:38:58,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:38:58,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:38:58,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:38:58,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 241 [2023-01-28 00:38:58,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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 00:38:58,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:38:58,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 241 [2023-01-28 00:38:58,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:38:58,884 INFO L130 PetriNetUnfolder]: 4903/6743 cut-off events. [2023-01-28 00:38:58,885 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2023-01-28 00:38:58,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13591 conditions, 6743 events. 4903/6743 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 33838 event pairs, 2535 based on Foata normal form. 0/6401 useless extension candidates. Maximal degree in co-relation 13579. Up to 5335 conditions per place. [2023-01-28 00:38:58,923 INFO L137 encePairwiseOnDemand]: 237/241 looper letters, 41 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-01-28 00:38:58,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 211 flow [2023-01-28 00:38:58,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:38:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:38:58,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-01-28 00:38:58,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5477178423236515 [2023-01-28 00:38:58,935 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-01-28 00:38:58,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-01-28 00:38:58,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:38:58,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-01-28 00:38:58,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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 00:38:58,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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 00:38:58,946 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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 00:38:58,947 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 396 transitions. [2023-01-28 00:38:58,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 211 flow [2023-01-28 00:38:58,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 00:38:58,952 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2023-01-28 00:38:58,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-01-28 00:38:58,957 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-01-28 00:38:58,957 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2023-01-28 00:38:58,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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 00:38:58,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:38:58,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:38:58,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:38:58,958 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:38:58,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:38:58,959 INFO L85 PathProgramCache]: Analyzing trace with hash -502598528, now seen corresponding path program 1 times [2023-01-28 00:38:58,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:38:58,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945375807] [2023-01-28 00:38:58,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:38:58,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:38:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:38:59,292 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 00:38:59,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:38:59,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945375807] [2023-01-28 00:38:59,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945375807] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:38:59,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:38:59,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:38:59,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639442630] [2023-01-28 00:38:59,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:38:59,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:38:59,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:38:59,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:38:59,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:38:59,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 241 [2023-01-28 00:38:59,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states 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 00:38:59,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:38:59,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 241 [2023-01-28 00:38:59,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:00,064 INFO L130 PetriNetUnfolder]: 5847/7943 cut-off events. [2023-01-28 00:39:00,064 INFO L131 PetriNetUnfolder]: For 521/521 co-relation queries the response was YES. [2023-01-28 00:39:00,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16607 conditions, 7943 events. 5847/7943 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 39253 event pairs, 1383 based on Foata normal form. 32/7966 useless extension candidates. Maximal degree in co-relation 16597. Up to 7393 conditions per place. [2023-01-28 00:39:00,112 INFO L137 encePairwiseOnDemand]: 237/241 looper letters, 36 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-01-28 00:39:00,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 178 flow [2023-01-28 00:39:00,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:39:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:39:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-01-28 00:39:00,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5200553250345782 [2023-01-28 00:39:00,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-01-28 00:39:00,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-01-28 00:39:00,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:00,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-01-28 00:39:00,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states 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 00:39:00,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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 00:39:00,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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 00:39:00,122 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 376 transitions. [2023-01-28 00:39:00,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 178 flow [2023-01-28 00:39:00,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:39:00,124 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 85 flow [2023-01-28 00:39:00,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-01-28 00:39:00,125 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-01-28 00:39:00,125 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 85 flow [2023-01-28 00:39:00,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states 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 00:39:00,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:00,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:00,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:39:00,126 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:00,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:00,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1599312791, now seen corresponding path program 1 times [2023-01-28 00:39:00,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:00,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852337301] [2023-01-28 00:39:00,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:00,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:00,423 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 00:39:00,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:00,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852337301] [2023-01-28 00:39:00,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852337301] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:00,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:00,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:39:00,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735247314] [2023-01-28 00:39:00,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:00,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:39:00,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:00,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:39:00,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:39:00,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 241 [2023-01-28 00:39:00,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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 00:39:00,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:00,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 241 [2023-01-28 00:39:00,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:02,671 INFO L130 PetriNetUnfolder]: 19083/25899 cut-off events. [2023-01-28 00:39:02,671 INFO L131 PetriNetUnfolder]: For 3072/3072 co-relation queries the response was YES. [2023-01-28 00:39:02,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55730 conditions, 25899 events. 19083/25899 cut-off events. For 3072/3072 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 142716 event pairs, 1704 based on Foata normal form. 740/26639 useless extension candidates. Maximal degree in co-relation 55719. Up to 15559 conditions per place. [2023-01-28 00:39:02,795 INFO L137 encePairwiseOnDemand]: 231/241 looper letters, 66 selfloop transitions, 13 changer transitions 0/79 dead transitions. [2023-01-28 00:39:02,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 79 transitions, 369 flow [2023-01-28 00:39:02,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:39:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:39:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-01-28 00:39:02,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051867219917012 [2023-01-28 00:39:02,798 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-01-28 00:39:02,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-01-28 00:39:02,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:02,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-01-28 00:39:02,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:02,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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 00:39:02,801 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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 00:39:02,802 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 85 flow. Second operand 4 states and 487 transitions. [2023-01-28 00:39:02,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 79 transitions, 369 flow [2023-01-28 00:39:02,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 79 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:39:02,805 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 190 flow [2023-01-28 00:39:02,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-01-28 00:39:02,807 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2023-01-28 00:39:02,809 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 190 flow [2023-01-28 00:39:02,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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 00:39:02,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:02,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:02,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:39:02,810 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:02,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:02,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2025780680, now seen corresponding path program 1 times [2023-01-28 00:39:02,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:02,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69781135] [2023-01-28 00:39:02,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:02,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:03,012 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 00:39:03,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:03,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69781135] [2023-01-28 00:39:03,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69781135] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:03,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:03,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:39:03,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598713267] [2023-01-28 00:39:03,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:03,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:39:03,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:03,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:39:03,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:39:03,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 241 [2023-01-28 00:39:03,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:03,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:03,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 241 [2023-01-28 00:39:03,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:04,953 INFO L130 PetriNetUnfolder]: 18222/24736 cut-off events. [2023-01-28 00:39:04,953 INFO L131 PetriNetUnfolder]: For 18091/18091 co-relation queries the response was YES. [2023-01-28 00:39:04,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65921 conditions, 24736 events. 18222/24736 cut-off events. For 18091/18091 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 127735 event pairs, 4702 based on Foata normal form. 215/24951 useless extension candidates. Maximal degree in co-relation 65906. Up to 10589 conditions per place. [2023-01-28 00:39:05,063 INFO L137 encePairwiseOnDemand]: 232/241 looper letters, 68 selfloop transitions, 13 changer transitions 0/81 dead transitions. [2023-01-28 00:39:05,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 484 flow [2023-01-28 00:39:05,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:39:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:39:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-01-28 00:39:05,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927385892116183 [2023-01-28 00:39:05,066 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-01-28 00:39:05,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-01-28 00:39:05,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:05,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-01-28 00:39:05,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 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 00:39:05,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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 00:39:05,070 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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 00:39:05,070 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 190 flow. Second operand 4 states and 475 transitions. [2023-01-28 00:39:05,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 484 flow [2023-01-28 00:39:05,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 81 transitions, 484 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 00:39:05,077 INFO L231 Difference]: Finished difference. Result has 52 places, 52 transitions, 316 flow [2023-01-28 00:39:05,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=316, PETRI_PLACES=52, PETRI_TRANSITIONS=52} [2023-01-28 00:39:05,078 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2023-01-28 00:39:05,078 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 316 flow [2023-01-28 00:39:05,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:39:05,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:05,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:05,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:39:05,079 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:05,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:05,079 INFO L85 PathProgramCache]: Analyzing trace with hash -988761192, now seen corresponding path program 1 times [2023-01-28 00:39:05,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:05,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992119325] [2023-01-28 00:39:05,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:05,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:05,219 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 00:39:05,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:05,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992119325] [2023-01-28 00:39:05,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992119325] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:05,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:05,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:39:05,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498595190] [2023-01-28 00:39:05,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:05,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:39:05,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:05,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:39:05,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:39:05,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 241 [2023-01-28 00:39:05,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states 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 00:39:05,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:05,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 241 [2023-01-28 00:39:05,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:06,927 INFO L130 PetriNetUnfolder]: 12417/17960 cut-off events. [2023-01-28 00:39:06,927 INFO L131 PetriNetUnfolder]: For 25553/26287 co-relation queries the response was YES. [2023-01-28 00:39:06,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50631 conditions, 17960 events. 12417/17960 cut-off events. For 25553/26287 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 111434 event pairs, 3656 based on Foata normal form. 376/17710 useless extension candidates. Maximal degree in co-relation 50611. Up to 11434 conditions per place. [2023-01-28 00:39:07,224 INFO L137 encePairwiseOnDemand]: 238/241 looper letters, 52 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2023-01-28 00:39:07,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 72 transitions, 504 flow [2023-01-28 00:39:07,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:39:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:39:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-01-28 00:39:07,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311203319502075 [2023-01-28 00:39:07,229 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-01-28 00:39:07,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-01-28 00:39:07,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:07,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-01-28 00:39:07,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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 00:39:07,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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 00:39:07,234 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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 00:39:07,234 INFO L175 Difference]: Start difference. First operand has 52 places, 52 transitions, 316 flow. Second operand 3 states and 384 transitions. [2023-01-28 00:39:07,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 72 transitions, 504 flow [2023-01-28 00:39:07,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 72 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:39:07,247 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 327 flow [2023-01-28 00:39:07,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2023-01-28 00:39:07,250 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2023-01-28 00:39:07,250 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 327 flow [2023-01-28 00:39:07,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states 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 00:39:07,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:07,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:07,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:39:07,252 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:07,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:07,253 INFO L85 PathProgramCache]: Analyzing trace with hash 199604137, now seen corresponding path program 1 times [2023-01-28 00:39:07,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:07,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028416101] [2023-01-28 00:39:07,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:07,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:07,486 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 00:39:07,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:07,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028416101] [2023-01-28 00:39:07,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028416101] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:07,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:07,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:39:07,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097699274] [2023-01-28 00:39:07,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:07,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:39:07,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:07,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:39:07,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:39:07,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-01-28 00:39:07,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 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 00:39:07,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:07,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-01-28 00:39:07,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:08,987 INFO L130 PetriNetUnfolder]: 10415/15561 cut-off events. [2023-01-28 00:39:08,988 INFO L131 PetriNetUnfolder]: For 18811/20493 co-relation queries the response was YES. [2023-01-28 00:39:09,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42401 conditions, 15561 events. 10415/15561 cut-off events. For 18811/20493 co-relation queries the response was YES. Maximal size of possible extension queue 833. Compared 101837 event pairs, 1801 based on Foata normal form. 1369/16425 useless extension candidates. Maximal degree in co-relation 42379. Up to 9203 conditions per place. [2023-01-28 00:39:09,070 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 96 selfloop transitions, 10 changer transitions 0/125 dead transitions. [2023-01-28 00:39:09,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 125 transitions, 895 flow [2023-01-28 00:39:09,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:39:09,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:39:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2023-01-28 00:39:09,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5037344398340249 [2023-01-28 00:39:09,073 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 607 transitions. [2023-01-28 00:39:09,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 607 transitions. [2023-01-28 00:39:09,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:09,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 607 transitions. [2023-01-28 00:39:09,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states 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 00:39:09,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states 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 00:39:09,078 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states 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 00:39:09,078 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 327 flow. Second operand 5 states and 607 transitions. [2023-01-28 00:39:09,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 125 transitions, 895 flow [2023-01-28 00:39:09,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 125 transitions, 874 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-01-28 00:39:09,088 INFO L231 Difference]: Finished difference. Result has 58 places, 61 transitions, 387 flow [2023-01-28 00:39:09,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=387, PETRI_PLACES=58, PETRI_TRANSITIONS=61} [2023-01-28 00:39:09,090 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2023-01-28 00:39:09,090 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 61 transitions, 387 flow [2023-01-28 00:39:09,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 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 00:39:09,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:09,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:09,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:39:09,091 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:09,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:09,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1737666356, now seen corresponding path program 1 times [2023-01-28 00:39:09,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:09,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561961929] [2023-01-28 00:39:09,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:09,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:09,328 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 00:39:09,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:09,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561961929] [2023-01-28 00:39:09,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561961929] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:09,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:09,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:39:09,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534663129] [2023-01-28 00:39:09,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:09,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:39:09,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:09,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:39:09,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:39:09,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-01-28 00:39:09,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 387 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states 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 00:39:09,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:09,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-01-28 00:39:09,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:10,684 INFO L130 PetriNetUnfolder]: 8458/13000 cut-off events. [2023-01-28 00:39:10,685 INFO L131 PetriNetUnfolder]: For 18638/19824 co-relation queries the response was YES. [2023-01-28 00:39:10,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43096 conditions, 13000 events. 8458/13000 cut-off events. For 18638/19824 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 87179 event pairs, 1025 based on Foata normal form. 912/13492 useless extension candidates. Maximal degree in co-relation 43072. Up to 3862 conditions per place. [2023-01-28 00:39:10,756 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 134 selfloop transitions, 19 changer transitions 0/172 dead transitions. [2023-01-28 00:39:10,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 172 transitions, 1293 flow [2023-01-28 00:39:10,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:39:10,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:39:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 852 transitions. [2023-01-28 00:39:10,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050385299347955 [2023-01-28 00:39:10,760 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 852 transitions. [2023-01-28 00:39:10,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 852 transitions. [2023-01-28 00:39:10,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:10,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 852 transitions. [2023-01-28 00:39:10,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states 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 00:39:10,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states 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 00:39:10,765 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states 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 00:39:10,765 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 387 flow. Second operand 7 states and 852 transitions. [2023-01-28 00:39:10,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 172 transitions, 1293 flow [2023-01-28 00:39:10,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 172 transitions, 1288 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:39:10,823 INFO L231 Difference]: Finished difference. Result has 66 places, 70 transitions, 516 flow [2023-01-28 00:39:10,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=516, PETRI_PLACES=66, PETRI_TRANSITIONS=70} [2023-01-28 00:39:10,824 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 22 predicate places. [2023-01-28 00:39:10,824 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 516 flow [2023-01-28 00:39:10,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states 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 00:39:10,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:10,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:10,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:39:10,825 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:10,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:10,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1691158552, now seen corresponding path program 1 times [2023-01-28 00:39:10,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:10,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844670181] [2023-01-28 00:39:10,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:10,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:11,126 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 00:39:11,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:11,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844670181] [2023-01-28 00:39:11,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844670181] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:11,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:11,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:39:11,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694445507] [2023-01-28 00:39:11,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:11,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:39:11,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:11,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:39:11,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:39:11,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 241 [2023-01-28 00:39:11,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 516 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states 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 00:39:11,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:11,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 241 [2023-01-28 00:39:11,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:13,096 INFO L130 PetriNetUnfolder]: 17461/25199 cut-off events. [2023-01-28 00:39:13,096 INFO L131 PetriNetUnfolder]: For 79849/79849 co-relation queries the response was YES. [2023-01-28 00:39:13,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102891 conditions, 25199 events. 17461/25199 cut-off events. For 79849/79849 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 154736 event pairs, 1223 based on Foata normal form. 66/25265 useless extension candidates. Maximal degree in co-relation 102863. Up to 8320 conditions per place. [2023-01-28 00:39:13,167 INFO L137 encePairwiseOnDemand]: 230/241 looper letters, 114 selfloop transitions, 43 changer transitions 74/231 dead transitions. [2023-01-28 00:39:13,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 231 transitions, 2157 flow [2023-01-28 00:39:13,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:39:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:39:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2023-01-28 00:39:13,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49446749654218536 [2023-01-28 00:39:13,170 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 715 transitions. [2023-01-28 00:39:13,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions. [2023-01-28 00:39:13,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:13,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions. [2023-01-28 00:39:13,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states 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 00:39:13,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states 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 00:39:13,175 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states 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 00:39:13,175 INFO L175 Difference]: Start difference. First operand has 66 places, 70 transitions, 516 flow. Second operand 6 states and 715 transitions. [2023-01-28 00:39:13,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 231 transitions, 2157 flow [2023-01-28 00:39:14,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 231 transitions, 1937 flow, removed 77 selfloop flow, removed 3 redundant places. [2023-01-28 00:39:14,034 INFO L231 Difference]: Finished difference. Result has 73 places, 84 transitions, 787 flow [2023-01-28 00:39:14,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=787, PETRI_PLACES=73, PETRI_TRANSITIONS=84} [2023-01-28 00:39:14,035 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2023-01-28 00:39:14,035 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 84 transitions, 787 flow [2023-01-28 00:39:14,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states 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 00:39:14,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:14,036 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 00:39:14,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:39:14,036 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:14,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:14,037 INFO L85 PathProgramCache]: Analyzing trace with hash 234164316, now seen corresponding path program 1 times [2023-01-28 00:39:14,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:14,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998893693] [2023-01-28 00:39:14,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:14,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:14,291 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 00:39:14,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:14,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998893693] [2023-01-28 00:39:14,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998893693] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:14,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:14,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:39:14,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067920709] [2023-01-28 00:39:14,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:14,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:39:14,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:14,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:39:14,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:39:14,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-01-28 00:39:14,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 84 transitions, 787 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states 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 00:39:14,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:14,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-01-28 00:39:14,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:15,158 INFO L130 PetriNetUnfolder]: 4521/7355 cut-off events. [2023-01-28 00:39:15,158 INFO L131 PetriNetUnfolder]: For 20260/20740 co-relation queries the response was YES. [2023-01-28 00:39:15,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27188 conditions, 7355 events. 4521/7355 cut-off events. For 20260/20740 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 48023 event pairs, 962 based on Foata normal form. 455/7596 useless extension candidates. Maximal degree in co-relation 27155. Up to 2455 conditions per place. [2023-01-28 00:39:15,193 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 136 selfloop transitions, 18 changer transitions 15/202 dead transitions. [2023-01-28 00:39:15,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 202 transitions, 2026 flow [2023-01-28 00:39:15,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:39:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:39:15,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 853 transitions. [2023-01-28 00:39:15,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056312981624185 [2023-01-28 00:39:15,196 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 853 transitions. [2023-01-28 00:39:15,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 853 transitions. [2023-01-28 00:39:15,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:15,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 853 transitions. [2023-01-28 00:39:15,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 states 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 00:39:15,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states 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 00:39:15,201 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states 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 00:39:15,201 INFO L175 Difference]: Start difference. First operand has 73 places, 84 transitions, 787 flow. Second operand 7 states and 853 transitions. [2023-01-28 00:39:15,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 202 transitions, 2026 flow [2023-01-28 00:39:15,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 202 transitions, 1988 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-01-28 00:39:15,243 INFO L231 Difference]: Finished difference. Result has 75 places, 93 transitions, 911 flow [2023-01-28 00:39:15,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=911, PETRI_PLACES=75, PETRI_TRANSITIONS=93} [2023-01-28 00:39:15,244 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 31 predicate places. [2023-01-28 00:39:15,244 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 93 transitions, 911 flow [2023-01-28 00:39:15,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states 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 00:39:15,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:15,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:15,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:39:15,244 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:15,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:15,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1740631535, now seen corresponding path program 1 times [2023-01-28 00:39:15,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:15,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618376147] [2023-01-28 00:39:15,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:15,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:16,431 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 00:39:16,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:16,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618376147] [2023-01-28 00:39:16,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618376147] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:16,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:16,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:39:16,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664994120] [2023-01-28 00:39:16,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:16,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:39:16,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:16,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:39:16,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:39:16,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-01-28 00:39:16,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 93 transitions, 911 flow. Second operand has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states 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 00:39:16,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:16,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-01-28 00:39:16,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:17,968 INFO L130 PetriNetUnfolder]: 7093/11841 cut-off events. [2023-01-28 00:39:17,968 INFO L131 PetriNetUnfolder]: For 37879/38373 co-relation queries the response was YES. [2023-01-28 00:39:18,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49391 conditions, 11841 events. 7093/11841 cut-off events. For 37879/38373 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 85896 event pairs, 983 based on Foata normal form. 99/11666 useless extension candidates. Maximal degree in co-relation 49356. Up to 4018 conditions per place. [2023-01-28 00:39:18,033 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 138 selfloop transitions, 7 changer transitions 64/242 dead transitions. [2023-01-28 00:39:18,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 242 transitions, 2581 flow [2023-01-28 00:39:18,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:39:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:39:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 835 transitions. [2023-01-28 00:39:18,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4949614700652045 [2023-01-28 00:39:18,039 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 835 transitions. [2023-01-28 00:39:18,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 835 transitions. [2023-01-28 00:39:18,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:18,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 835 transitions. [2023-01-28 00:39:18,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 0 states have call successors, (0), 0 states 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 00:39:18,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states 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 00:39:18,045 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states 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 00:39:18,045 INFO L175 Difference]: Start difference. First operand has 75 places, 93 transitions, 911 flow. Second operand 7 states and 835 transitions. [2023-01-28 00:39:18,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 242 transitions, 2581 flow [2023-01-28 00:39:18,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 242 transitions, 2275 flow, removed 124 selfloop flow, removed 2 redundant places. [2023-01-28 00:39:18,839 INFO L231 Difference]: Finished difference. Result has 82 places, 98 transitions, 903 flow [2023-01-28 00:39:18,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=903, PETRI_PLACES=82, PETRI_TRANSITIONS=98} [2023-01-28 00:39:18,840 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 38 predicate places. [2023-01-28 00:39:18,840 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 98 transitions, 903 flow [2023-01-28 00:39:18,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states 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 00:39:18,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:18,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:18,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:39:18,841 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:18,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:18,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1791110355, now seen corresponding path program 2 times [2023-01-28 00:39:18,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:18,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614070265] [2023-01-28 00:39:18,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:18,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:39:19,171 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 00:39:19,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:39:19,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614070265] [2023-01-28 00:39:19,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614070265] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:39:19,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:39:19,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:39:19,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669673783] [2023-01-28 00:39:19,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:39:19,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:39:19,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:39:19,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:39:19,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:39:19,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-01-28 00:39:19,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 98 transitions, 903 flow. Second operand has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states 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 00:39:19,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:39:19,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-01-28 00:39:19,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:39:20,303 INFO L130 PetriNetUnfolder]: 5681/9502 cut-off events. [2023-01-28 00:39:20,303 INFO L131 PetriNetUnfolder]: For 27233/27834 co-relation queries the response was YES. [2023-01-28 00:39:20,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38049 conditions, 9502 events. 5681/9502 cut-off events. For 27233/27834 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 67644 event pairs, 942 based on Foata normal form. 211/9467 useless extension candidates. Maximal degree in co-relation 38016. Up to 3146 conditions per place. [2023-01-28 00:39:20,361 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 98 selfloop transitions, 22 changer transitions 74/216 dead transitions. [2023-01-28 00:39:20,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 216 transitions, 2172 flow [2023-01-28 00:39:20,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:39:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:39:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1068 transitions. [2023-01-28 00:39:20,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49239280774550487 [2023-01-28 00:39:20,365 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1068 transitions. [2023-01-28 00:39:20,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1068 transitions. [2023-01-28 00:39:20,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:39:20,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1068 transitions. [2023-01-28 00:39:20,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.66666666666667) internal successors, (1068), 9 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states 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 00:39:20,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states 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 00:39:20,371 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states 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 00:39:20,371 INFO L175 Difference]: Start difference. First operand has 82 places, 98 transitions, 903 flow. Second operand 9 states and 1068 transitions. [2023-01-28 00:39:20,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 216 transitions, 2172 flow [2023-01-28 00:39:20,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 216 transitions, 2136 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-01-28 00:39:20,736 INFO L231 Difference]: Finished difference. Result has 87 places, 77 transitions, 693 flow [2023-01-28 00:39:20,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=693, PETRI_PLACES=87, PETRI_TRANSITIONS=77} [2023-01-28 00:39:20,736 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2023-01-28 00:39:20,737 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 77 transitions, 693 flow [2023-01-28 00:39:20,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states 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 00:39:20,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:39:20,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:20,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:39:20,738 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:39:20,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:39:20,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1085559785, now seen corresponding path program 1 times [2023-01-28 00:39:20,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:39:20,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236659194] [2023-01-28 00:39:20,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:39:20,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:39:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:39:20,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:39:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:39:20,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:39:20,904 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:39:20,905 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-28 00:39:20,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-28 00:39:20,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-28 00:39:20,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-28 00:39:20,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-28 00:39:20,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-28 00:39:20,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-28 00:39:20,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:39:20,911 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:39:20,916 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:39:20,916 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:39:21,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:39:21 BasicIcfg [2023-01-28 00:39:21,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:39:21,017 INFO L158 Benchmark]: Toolchain (without parser) took 28951.29ms. Allocated memory was 343.9MB in the beginning and 5.8GB in the end (delta: 5.4GB). Free memory was 301.5MB in the beginning and 3.3GB in the end (delta: -3.0GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-01-28 00:39:21,017 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 255.9MB. Free memory is still 212.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:39:21,017 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.63ms. Allocated memory is still 343.9MB. Free memory was 301.5MB in the beginning and 277.5MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-28 00:39:21,017 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.60ms. Allocated memory is still 343.9MB. Free memory was 277.5MB in the beginning and 274.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:39:21,018 INFO L158 Benchmark]: Boogie Preprocessor took 53.01ms. Allocated memory is still 343.9MB. Free memory was 274.9MB in the beginning and 272.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:39:21,018 INFO L158 Benchmark]: RCFGBuilder took 772.83ms. Allocated memory is still 343.9MB. Free memory was 272.9MB in the beginning and 303.4MB in the end (delta: -30.4MB). Peak memory consumption was 31.8MB. Max. memory is 16.0GB. [2023-01-28 00:39:21,018 INFO L158 Benchmark]: TraceAbstraction took 27502.18ms. Allocated memory was 343.9MB in the beginning and 5.8GB in the end (delta: 5.4GB). Free memory was 302.1MB in the beginning and 3.3GB in the end (delta: -3.0GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-01-28 00:39:21,019 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.41ms. Allocated memory is still 255.9MB. Free memory is still 212.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 542.63ms. Allocated memory is still 343.9MB. Free memory was 301.5MB in the beginning and 277.5MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 75.60ms. Allocated memory is still 343.9MB. Free memory was 277.5MB in the beginning and 274.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 53.01ms. Allocated memory is still 343.9MB. Free memory was 274.9MB in the beginning and 272.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 772.83ms. Allocated memory is still 343.9MB. Free memory was 272.9MB in the beginning and 303.4MB in the end (delta: -30.4MB). Peak memory consumption was 31.8MB. Max. memory is 16.0GB. * TraceAbstraction took 27502.18ms. Allocated memory was 343.9MB in the beginning and 5.8GB in the end (delta: 5.4GB). Free memory was 302.1MB in the beginning and 3.3GB in the end (delta: -3.0GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 139 PlacesBefore, 44 PlacesAfterwards, 128 TransitionsBefore, 32 TransitionsAfterwards, 3300 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 10097 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3639, independent: 3371, independent conditional: 0, independent unconditional: 3371, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1752, independent: 1705, independent conditional: 0, independent unconditional: 1705, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3639, independent: 1666, independent conditional: 0, independent unconditional: 1666, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 1752, unknown conditional: 0, unknown unconditional: 1752] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t601; [L870] FCALL, FORK 0 pthread_create(&t601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t601, ((void *)0), P0, ((void *)0))=-3, t601={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L871] 0 pthread_t t602; [L872] FCALL, FORK 0 pthread_create(&t602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t602, ((void *)0), P1, ((void *)0))=-2, t601={5:0}, t602={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t603; [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L874] FCALL, FORK 0 pthread_create(&t603, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t603, ((void *)0), P2, ((void *)0))=-1, t601={5:0}, t602={6:0}, t603={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L875] 0 pthread_t t604; [L805] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L876] FCALL, FORK 0 pthread_create(&t604, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t604, ((void *)0), P3, ((void *)0))=0, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=0, x=2, y=1, z=2] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0: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$$choice2=0, x=2, y=1, z=2] [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice2=0, x=2, y=1, z=2] [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L891] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0: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=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 876]: 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: 872]: 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: 870]: 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 9 procedures, 170 locations, 7 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: 27.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 19.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 465 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 465 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1262 IncrementalHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 26 mSDtfsCounter, 1262 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=911occurred in iteration=9, InterpolantAutomatonStates: 58, 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.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 915 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 00:39:21,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...