/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/rfi000_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:44:09,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:44:09,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:44:09,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:44:09,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:44:09,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:44:09,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:44:09,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:44:09,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:44:09,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:44:09,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:44:09,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:44:09,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:44:09,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:44:09,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:44:09,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:44:09,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:44:09,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:44:09,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:44:09,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:44:09,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:44:09,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:44:09,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:44:09,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:44:09,443 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:44:09,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:44:09,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:44:09,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:44:09,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:44:09,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:44:09,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:44:09,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:44:09,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:44:09,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:44:09,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:44:09,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:44:09,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:44:09,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:44:09,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:44:09,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:44:09,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:44:09,451 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:44:09,472 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:44:09,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:44:09,473 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:44:09,473 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:44:09,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:44:09,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:44:09,474 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:44:09,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:44:09,474 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:44:09,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:44:09,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:44:09,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:44:09,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:44:09,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:44:09,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:44:09,475 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:44:09,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:44:09,476 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:44:09,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:44:09,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:44:09,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:44:09,476 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:44:09,476 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:44:09,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:44:09,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:44:09,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:44:09,477 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:44:09,477 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:44:09,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:44:09,477 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:44:09,477 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:44:09,477 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:44:09,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:44:09,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:44:09,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:44:09,660 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:44:09,660 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:44:09,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2023-01-28 00:44:10,717 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:44:10,918 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:44:10,918 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2023-01-28 00:44:10,945 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a86aaf0a/4921904845984a78b3c8fb738795cf99/FLAG93b14b976 [2023-01-28 00:44:10,955 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a86aaf0a/4921904845984a78b3c8fb738795cf99 [2023-01-28 00:44:10,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:44:10,958 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:44:10,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:44:10,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:44:10,963 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:44:10,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:44:10" (1/1) ... [2023-01-28 00:44:10,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c37f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:44:10, skipping insertion in model container [2023-01-28 00:44:10,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:44:10" (1/1) ... [2023-01-28 00:44:10,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:44:11,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:44:11,112 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2023-01-28 00:44:11,288 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:44:11,297 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:44:11,306 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2023-01-28 00:44:11,340 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:44:11,362 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:44:11,363 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:44:11,368 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:44:11,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:44:11 WrapperNode [2023-01-28 00:44:11,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:44:11,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:44:11,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:44:11,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:44:11,373 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:44:11" (1/1) ... [2023-01-28 00:44:11,398 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:44:11" (1/1) ... [2023-01-28 00:44:11,426 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2023-01-28 00:44:11,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:44:11,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:44:11,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:44:11,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:44:11,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:44:11" (1/1) ... [2023-01-28 00:44:11,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:44:11" (1/1) ... [2023-01-28 00:44:11,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:44:11" (1/1) ... [2023-01-28 00:44:11,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:44:11" (1/1) ... [2023-01-28 00:44:11,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:44:11" (1/1) ... [2023-01-28 00:44:11,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:44:11" (1/1) ... [2023-01-28 00:44:11,455 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:44:11" (1/1) ... [2023-01-28 00:44:11,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:44:11" (1/1) ... [2023-01-28 00:44:11,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:44:11,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:44:11,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:44:11,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:44:11,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:44:11" (1/1) ... [2023-01-28 00:44:11,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:44:11,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:44:11,502 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:44:11,536 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:44:11,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:44:11,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:44:11,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:44:11,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:44:11,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:44:11,558 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:44:11,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:44:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:44:11,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:44:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:44:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:44:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:44:11,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:44:11,562 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:44:11,647 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:44:11,648 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:44:11,899 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:44:11,985 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:44:11,985 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:44:11,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:44:11 BoogieIcfgContainer [2023-01-28 00:44:11,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:44:11,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:44:11,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:44:11,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:44:11,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:44:10" (1/3) ... [2023-01-28 00:44:11,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65255e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:44:11, skipping insertion in model container [2023-01-28 00:44:11,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:44:11" (2/3) ... [2023-01-28 00:44:11,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65255e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:44:11, skipping insertion in model container [2023-01-28 00:44:11,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:44:11" (3/3) ... [2023-01-28 00:44:11,998 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt_pso.opt_rmo.opt.i [2023-01-28 00:44:12,009 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:44:12,009 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:44:12,009 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:44:12,039 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:44:12,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2023-01-28 00:44:12,085 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2023-01-28 00:44:12,085 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:44:12,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-01-28 00:44:12,089 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2023-01-28 00:44:12,091 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2023-01-28 00:44:12,094 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:44:12,100 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 182 flow [2023-01-28 00:44:12,102 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 182 flow [2023-01-28 00:44:12,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 182 flow [2023-01-28 00:44:12,115 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2023-01-28 00:44:12,115 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:44:12,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-01-28 00:44:12,117 INFO L119 LiptonReduction]: Number of co-enabled transitions 1156 [2023-01-28 00:44:14,680 INFO L134 LiptonReduction]: Checked pairs total: 3123 [2023-01-28 00:44:14,680 INFO L136 LiptonReduction]: Total number of compositions: 80 [2023-01-28 00:44:14,696 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:44:14,714 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;@1dbce8c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:44:14,714 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 00:44:14,716 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-01-28 00:44:14,716 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:44:14,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:14,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 00:44:14,717 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:44:14,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:14,720 INFO L85 PathProgramCache]: Analyzing trace with hash 391669105, now seen corresponding path program 1 times [2023-01-28 00:44:14,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:14,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346737848] [2023-01-28 00:44:14,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:14,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:44:15,000 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:44:15,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:44:15,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346737848] [2023-01-28 00:44:15,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346737848] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:44:15,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:44:15,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:44:15,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791595036] [2023-01-28 00:44:15,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:44:15,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:44:15,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:44:15,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:44:15,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:44:15,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 170 [2023-01-28 00:44:15,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states 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:44:15,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:44:15,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 170 [2023-01-28 00:44:15,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:44:15,125 INFO L130 PetriNetUnfolder]: 111/262 cut-off events. [2023-01-28 00:44:15,125 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 00:44:15,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 262 events. 111/262 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1168 event pairs, 18 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 466. Up to 154 conditions per place. [2023-01-28 00:44:15,128 INFO L137 encePairwiseOnDemand]: 167/170 looper letters, 17 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2023-01-28 00:44:15,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 25 transitions, 98 flow [2023-01-28 00:44:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:44:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:44:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2023-01-28 00:44:15,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5019607843137255 [2023-01-28 00:44:15,142 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 256 transitions. [2023-01-28 00:44:15,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 256 transitions. [2023-01-28 00:44:15,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:44:15,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 256 transitions. [2023-01-28 00:44:15,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:15,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states 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:44:15,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states 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:44:15,153 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 256 transitions. [2023-01-28 00:44:15,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 25 transitions, 98 flow [2023-01-28 00:44:15,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 25 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:44:15,155 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 42 flow [2023-01-28 00:44:15,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-01-28 00:44:15,158 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-01-28 00:44:15,159 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 42 flow [2023-01-28 00:44:15,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states 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:44:15,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:15,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:15,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:44:15,159 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:44:15,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:15,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1563059937, now seen corresponding path program 1 times [2023-01-28 00:44:15,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:15,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113524225] [2023-01-28 00:44:15,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:15,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:44:15,375 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:44:15,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:44:15,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113524225] [2023-01-28 00:44:15,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113524225] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:44:15,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:44:15,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:44:15,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226075482] [2023-01-28 00:44:15,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:44:15,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:44:15,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:44:15,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:44:15,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:44:15,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 170 [2023-01-28 00:44:15,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states 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:44:15,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:44:15,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 170 [2023-01-28 00:44:15,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:44:15,464 INFO L130 PetriNetUnfolder]: 155/282 cut-off events. [2023-01-28 00:44:15,464 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-01-28 00:44:15,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 282 events. 155/282 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 997 event pairs, 65 based on Foata normal form. 2/284 useless extension candidates. Maximal degree in co-relation 575. Up to 264 conditions per place. [2023-01-28 00:44:15,466 INFO L137 encePairwiseOnDemand]: 166/170 looper letters, 20 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-01-28 00:44:15,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 106 flow [2023-01-28 00:44:15,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:44:15,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:44:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2023-01-28 00:44:15,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2023-01-28 00:44:15,468 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 246 transitions. [2023-01-28 00:44:15,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 246 transitions. [2023-01-28 00:44:15,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:44:15,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 246 transitions. [2023-01-28 00:44:15,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states 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:44:15,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states 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:44:15,471 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states 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:44:15,471 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 42 flow. Second operand 3 states and 246 transitions. [2023-01-28 00:44:15,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 106 flow [2023-01-28 00:44:15,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:44:15,472 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 57 flow [2023-01-28 00:44:15,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-01-28 00:44:15,473 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-01-28 00:44:15,473 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 57 flow [2023-01-28 00:44:15,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states 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:44:15,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:15,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:15,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:44:15,473 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:44:15,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:15,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1210218657, now seen corresponding path program 1 times [2023-01-28 00:44:15,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:15,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170906471] [2023-01-28 00:44:15,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:15,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:44:15,800 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:44:15,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:44:15,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170906471] [2023-01-28 00:44:15,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170906471] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:44:15,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:44:15,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:44:15,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399506420] [2023-01-28 00:44:15,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:44:15,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:44:15,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:44:15,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:44:15,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:44:15,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 170 [2023-01-28 00:44:15,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 57 flow. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:44:15,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:44:15,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 170 [2023-01-28 00:44:15,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:44:15,896 INFO L130 PetriNetUnfolder]: 219/386 cut-off events. [2023-01-28 00:44:15,896 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2023-01-28 00:44:15,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 386 events. 219/386 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1363 event pairs, 62 based on Foata normal form. 23/409 useless extension candidates. Maximal degree in co-relation 854. Up to 199 conditions per place. [2023-01-28 00:44:15,900 INFO L137 encePairwiseOnDemand]: 162/170 looper letters, 26 selfloop transitions, 7 changer transitions 0/33 dead transitions. [2023-01-28 00:44:15,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 155 flow [2023-01-28 00:44:15,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:44:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:44:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 289 transitions. [2023-01-28 00:44:15,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2023-01-28 00:44:15,904 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 289 transitions. [2023-01-28 00:44:15,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 289 transitions. [2023-01-28 00:44:15,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:44:15,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 289 transitions. [2023-01-28 00:44:15,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states 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:44:15,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states 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:44:15,909 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states 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:44:15,909 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 57 flow. Second operand 4 states and 289 transitions. [2023-01-28 00:44:15,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 155 flow [2023-01-28 00:44:15,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 33 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:44:15,910 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 108 flow [2023-01-28 00:44:15,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2023-01-28 00:44:15,911 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2023-01-28 00:44:15,913 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 108 flow [2023-01-28 00:44:15,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:44:15,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:15,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:15,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:44:15,914 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:44:15,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:15,915 INFO L85 PathProgramCache]: Analyzing trace with hash 867621801, now seen corresponding path program 1 times [2023-01-28 00:44:15,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:15,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540380330] [2023-01-28 00:44:15,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:15,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:44:16,287 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:44:16,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:44:16,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540380330] [2023-01-28 00:44:16,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540380330] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:44:16,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:44:16,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:44:16,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919756461] [2023-01-28 00:44:16,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:44:16,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:44:16,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:44:16,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:44:16,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:44:16,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 170 [2023-01-28 00:44:16,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 states 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:44:16,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:44:16,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 170 [2023-01-28 00:44:16,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:44:16,388 INFO L130 PetriNetUnfolder]: 206/363 cut-off events. [2023-01-28 00:44:16,388 INFO L131 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2023-01-28 00:44:16,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 363 events. 206/363 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1255 event pairs, 80 based on Foata normal form. 5/368 useless extension candidates. Maximal degree in co-relation 1056. Up to 171 conditions per place. [2023-01-28 00:44:16,391 INFO L137 encePairwiseOnDemand]: 163/170 looper letters, 29 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2023-01-28 00:44:16,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 226 flow [2023-01-28 00:44:16,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:44:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:44:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 287 transitions. [2023-01-28 00:44:16,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42205882352941176 [2023-01-28 00:44:16,393 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 287 transitions. [2023-01-28 00:44:16,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 287 transitions. [2023-01-28 00:44:16,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:44:16,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 287 transitions. [2023-01-28 00:44:16,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:16,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states 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:44:16,402 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states 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:44:16,402 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 108 flow. Second operand 4 states and 287 transitions. [2023-01-28 00:44:16,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 226 flow [2023-01-28 00:44:16,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 220 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-01-28 00:44:16,406 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 153 flow [2023-01-28 00:44:16,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2023-01-28 00:44:16,407 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 8 predicate places. [2023-01-28 00:44:16,407 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 153 flow [2023-01-28 00:44:16,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 states 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:44:16,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:16,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:16,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:44:16,408 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:44:16,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:16,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1126400230, now seen corresponding path program 1 times [2023-01-28 00:44:16,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:16,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352197767] [2023-01-28 00:44:16,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:16,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:44:16,695 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:44:16,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:44:16,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352197767] [2023-01-28 00:44:16,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352197767] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:44:16,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:44:16,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:44:16,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787429983] [2023-01-28 00:44:16,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:44:16,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:44:16,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:44:16,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:44:16,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:44:16,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 170 [2023-01-28 00:44:16,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:16,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:44:16,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 170 [2023-01-28 00:44:16,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:44:16,831 INFO L130 PetriNetUnfolder]: 292/522 cut-off events. [2023-01-28 00:44:16,832 INFO L131 PetriNetUnfolder]: For 461/461 co-relation queries the response was YES. [2023-01-28 00:44:16,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1725 conditions, 522 events. 292/522 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2177 event pairs, 53 based on Foata normal form. 15/537 useless extension candidates. Maximal degree in co-relation 1707. Up to 256 conditions per place. [2023-01-28 00:44:16,834 INFO L137 encePairwiseOnDemand]: 160/170 looper letters, 26 selfloop transitions, 14 changer transitions 10/50 dead transitions. [2023-01-28 00:44:16,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 361 flow [2023-01-28 00:44:16,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:44:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:44:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 295 transitions. [2023-01-28 00:44:16,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4338235294117647 [2023-01-28 00:44:16,835 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 295 transitions. [2023-01-28 00:44:16,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 295 transitions. [2023-01-28 00:44:16,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:44:16,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 295 transitions. [2023-01-28 00:44:16,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 states 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:44:16,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states 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:44:16,837 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states 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:44:16,837 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 153 flow. Second operand 4 states and 295 transitions. [2023-01-28 00:44:16,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 361 flow [2023-01-28 00:44:16,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 50 transitions, 343 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-01-28 00:44:16,842 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 248 flow [2023-01-28 00:44:16,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2023-01-28 00:44:16,844 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2023-01-28 00:44:16,844 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 248 flow [2023-01-28 00:44:16,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:16,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:16,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:16,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:44:16,845 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:44:16,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:16,845 INFO L85 PathProgramCache]: Analyzing trace with hash 558634416, now seen corresponding path program 1 times [2023-01-28 00:44:16,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:16,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699293182] [2023-01-28 00:44:16,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:16,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:44:17,221 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:44:17,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:44:17,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699293182] [2023-01-28 00:44:17,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699293182] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:44:17,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:44:17,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:44:17,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119365264] [2023-01-28 00:44:17,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:44:17,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:44:17,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:44:17,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:44:17,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:44:17,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 170 [2023-01-28 00:44:17,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 248 flow. Second operand has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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:44:17,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:44:17,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 170 [2023-01-28 00:44:17,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:44:17,325 INFO L130 PetriNetUnfolder]: 133/254 cut-off events. [2023-01-28 00:44:17,325 INFO L131 PetriNetUnfolder]: For 629/652 co-relation queries the response was YES. [2023-01-28 00:44:17,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 254 events. 133/254 cut-off events. For 629/652 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 941 event pairs, 20 based on Foata normal form. 22/272 useless extension candidates. Maximal degree in co-relation 995. Up to 174 conditions per place. [2023-01-28 00:44:17,326 INFO L137 encePairwiseOnDemand]: 164/170 looper letters, 31 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2023-01-28 00:44:17,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 454 flow [2023-01-28 00:44:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:44:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:44:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 389 transitions. [2023-01-28 00:44:17,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4576470588235294 [2023-01-28 00:44:17,328 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 389 transitions. [2023-01-28 00:44:17,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 389 transitions. [2023-01-28 00:44:17,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:44:17,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 389 transitions. [2023-01-28 00:44:17,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 0 states have call successors, (0), 0 states 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:44:17,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:44:17,330 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:44:17,330 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 248 flow. Second operand 5 states and 389 transitions. [2023-01-28 00:44:17,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 454 flow [2023-01-28 00:44:17,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 441 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 00:44:17,332 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 335 flow [2023-01-28 00:44:17,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2023-01-28 00:44:17,333 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 14 predicate places. [2023-01-28 00:44:17,333 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 335 flow [2023-01-28 00:44:17,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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:44:17,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:17,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:17,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:44:17,334 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:44:17,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:17,334 INFO L85 PathProgramCache]: Analyzing trace with hash -679952090, now seen corresponding path program 2 times [2023-01-28 00:44:17,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:17,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915690569] [2023-01-28 00:44:17,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:17,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:44:18,139 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:44:18,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:44:18,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915690569] [2023-01-28 00:44:18,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915690569] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:44:18,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:44:18,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:44:18,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31130361] [2023-01-28 00:44:18,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:44:18,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:44:18,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:44:18,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:44:18,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:44:18,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 170 [2023-01-28 00:44:18,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 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:44:18,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:44:18,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 170 [2023-01-28 00:44:18,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:44:18,264 INFO L130 PetriNetUnfolder]: 163/298 cut-off events. [2023-01-28 00:44:18,264 INFO L131 PetriNetUnfolder]: For 772/772 co-relation queries the response was YES. [2023-01-28 00:44:18,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 298 events. 163/298 cut-off events. For 772/772 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1087 event pairs, 17 based on Foata normal form. 2/300 useless extension candidates. Maximal degree in co-relation 1295. Up to 184 conditions per place. [2023-01-28 00:44:18,266 INFO L137 encePairwiseOnDemand]: 159/170 looper letters, 34 selfloop transitions, 43 changer transitions 0/77 dead transitions. [2023-01-28 00:44:18,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 77 transitions, 814 flow [2023-01-28 00:44:18,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:44:18,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:44:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 428 transitions. [2023-01-28 00:44:18,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4196078431372549 [2023-01-28 00:44:18,268 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 428 transitions. [2023-01-28 00:44:18,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 428 transitions. [2023-01-28 00:44:18,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:44:18,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 428 transitions. [2023-01-28 00:44:18,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 71.33333333333333) internal successors, (428), 6 states have internal predecessors, (428), 0 states have call successors, (0), 0 states 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:44:18,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states 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:44:18,270 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states 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:44:18,270 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 335 flow. Second operand 6 states and 428 transitions. [2023-01-28 00:44:18,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 77 transitions, 814 flow [2023-01-28 00:44:18,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 77 transitions, 789 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-28 00:44:18,273 INFO L231 Difference]: Finished difference. Result has 47 places, 65 transitions, 774 flow [2023-01-28 00:44:18,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=774, PETRI_PLACES=47, PETRI_TRANSITIONS=65} [2023-01-28 00:44:18,273 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2023-01-28 00:44:18,274 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 65 transitions, 774 flow [2023-01-28 00:44:18,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 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:44:18,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:18,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:18,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:44:18,274 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:44:18,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:18,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1350962068, now seen corresponding path program 1 times [2023-01-28 00:44:18,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:18,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348615393] [2023-01-28 00:44:18,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:18,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:44:18,411 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:44:18,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:44:18,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348615393] [2023-01-28 00:44:18,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348615393] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:44:18,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:44:18,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:44:18,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088566762] [2023-01-28 00:44:18,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:44:18,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:44:18,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:44:18,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:44:18,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:44:18,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 170 [2023-01-28 00:44:18,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 65 transitions, 774 flow. Second operand has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 0 states have call successors, (0), 0 states 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:44:18,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:44:18,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 170 [2023-01-28 00:44:18,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:44:18,485 INFO L130 PetriNetUnfolder]: 166/325 cut-off events. [2023-01-28 00:44:18,486 INFO L131 PetriNetUnfolder]: For 1306/1308 co-relation queries the response was YES. [2023-01-28 00:44:18,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1601 conditions, 325 events. 166/325 cut-off events. For 1306/1308 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1344 event pairs, 21 based on Foata normal form. 10/335 useless extension candidates. Maximal degree in co-relation 1576. Up to 154 conditions per place. [2023-01-28 00:44:18,487 INFO L137 encePairwiseOnDemand]: 167/170 looper letters, 40 selfloop transitions, 3 changer transitions 34/79 dead transitions. [2023-01-28 00:44:18,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 1011 flow [2023-01-28 00:44:18,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:44:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:44:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 321 transitions. [2023-01-28 00:44:18,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47205882352941175 [2023-01-28 00:44:18,489 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 321 transitions. [2023-01-28 00:44:18,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 321 transitions. [2023-01-28 00:44:18,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:44:18,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 321 transitions. [2023-01-28 00:44:18,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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:44:18,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states 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:44:18,491 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states 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:44:18,491 INFO L175 Difference]: Start difference. First operand has 47 places, 65 transitions, 774 flow. Second operand 4 states and 321 transitions. [2023-01-28 00:44:18,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 1011 flow [2023-01-28 00:44:18,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 1002 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-01-28 00:44:18,494 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 377 flow [2023-01-28 00:44:18,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=377, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-01-28 00:44:18,495 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 25 predicate places. [2023-01-28 00:44:18,495 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 377 flow [2023-01-28 00:44:18,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 0 states have call successors, (0), 0 states 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:44:18,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:18,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:18,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:44:18,495 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:44:18,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:18,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1983511458, now seen corresponding path program 2 times [2023-01-28 00:44:18,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:18,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341168650] [2023-01-28 00:44:18,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:18,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:44:18,665 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:44:18,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:44:18,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341168650] [2023-01-28 00:44:18,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341168650] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:44:18,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:44:18,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:44:18,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014224669] [2023-01-28 00:44:18,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:44:18,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:44:18,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:44:18,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:44:18,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:44:18,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 170 [2023-01-28 00:44:18,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 377 flow. Second operand has 4 states, 4 states have (on average 75.5) internal successors, (302), 4 states have internal predecessors, (302), 0 states have call successors, (0), 0 states 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:44:18,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:44:18,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 170 [2023-01-28 00:44:18,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:44:18,720 INFO L130 PetriNetUnfolder]: 38/101 cut-off events. [2023-01-28 00:44:18,720 INFO L131 PetriNetUnfolder]: For 544/549 co-relation queries the response was YES. [2023-01-28 00:44:18,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 101 events. 38/101 cut-off events. For 544/549 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 316 event pairs, 7 based on Foata normal form. 28/128 useless extension candidates. Maximal degree in co-relation 421. Up to 50 conditions per place. [2023-01-28 00:44:18,721 INFO L137 encePairwiseOnDemand]: 165/170 looper letters, 20 selfloop transitions, 3 changer transitions 17/45 dead transitions. [2023-01-28 00:44:18,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 436 flow [2023-01-28 00:44:18,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:44:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:44:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 397 transitions. [2023-01-28 00:44:18,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46705882352941175 [2023-01-28 00:44:18,723 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 397 transitions. [2023-01-28 00:44:18,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 397 transitions. [2023-01-28 00:44:18,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:44:18,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 397 transitions. [2023-01-28 00:44:18,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 0 states 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:44:18,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:44:18,725 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:44:18,725 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 377 flow. Second operand 5 states and 397 transitions. [2023-01-28 00:44:18,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 436 flow [2023-01-28 00:44:18,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 334 flow, removed 21 selfloop flow, removed 13 redundant places. [2023-01-28 00:44:18,727 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 157 flow [2023-01-28 00:44:18,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2023-01-28 00:44:18,727 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2023-01-28 00:44:18,727 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 157 flow [2023-01-28 00:44:18,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 4 states have internal predecessors, (302), 0 states have call successors, (0), 0 states 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:44:18,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:18,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:18,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:44:18,728 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:44:18,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:18,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1851670527, now seen corresponding path program 1 times [2023-01-28 00:44:18,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:18,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878471860] [2023-01-28 00:44:18,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:18,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:44:18,926 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:44:18,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:44:18,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878471860] [2023-01-28 00:44:18,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878471860] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:44:18,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:44:18,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:44:18,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456384583] [2023-01-28 00:44:18,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:44:18,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:44:18,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:44:18,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:44:18,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:44:18,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 170 [2023-01-28 00:44:18,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 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:44:18,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:44:18,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 170 [2023-01-28 00:44:18,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:44:18,986 INFO L130 PetriNetUnfolder]: 11/46 cut-off events. [2023-01-28 00:44:18,986 INFO L131 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2023-01-28 00:44:18,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 46 events. 11/46 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 84 event pairs, 0 based on Foata normal form. 7/53 useless extension candidates. Maximal degree in co-relation 176. Up to 18 conditions per place. [2023-01-28 00:44:18,987 INFO L137 encePairwiseOnDemand]: 165/170 looper letters, 18 selfloop transitions, 5 changer transitions 6/34 dead transitions. [2023-01-28 00:44:18,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 275 flow [2023-01-28 00:44:18,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:44:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:44:18,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 464 transitions. [2023-01-28 00:44:18,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4549019607843137 [2023-01-28 00:44:18,989 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 464 transitions. [2023-01-28 00:44:18,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 464 transitions. [2023-01-28 00:44:18,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:44:18,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 464 transitions. [2023-01-28 00:44:18,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 77.33333333333333) internal successors, (464), 6 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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:44:18,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states 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:44:18,991 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states 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:44:18,991 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 157 flow. Second operand 6 states and 464 transitions. [2023-01-28 00:44:18,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 275 flow [2023-01-28 00:44:18,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 235 flow, removed 13 selfloop flow, removed 5 redundant places. [2023-01-28 00:44:18,992 INFO L231 Difference]: Finished difference. Result has 43 places, 25 transitions, 149 flow [2023-01-28 00:44:18,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=43, PETRI_TRANSITIONS=25} [2023-01-28 00:44:18,993 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2023-01-28 00:44:18,993 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 25 transitions, 149 flow [2023-01-28 00:44:18,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 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:44:18,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:18,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:18,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:44:18,994 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:44:18,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:18,994 INFO L85 PathProgramCache]: Analyzing trace with hash 626508478, now seen corresponding path program 1 times [2023-01-28 00:44:18,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:18,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716083465] [2023-01-28 00:44:18,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:18,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:44:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:44:19,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:44:19,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716083465] [2023-01-28 00:44:19,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716083465] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:44:19,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:44:19,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:44:19,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128002407] [2023-01-28 00:44:19,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:44:19,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:44:19,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:44:19,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:44:19,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:44:19,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 170 [2023-01-28 00:44:19,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 25 transitions, 149 flow. Second operand has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states 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:44:19,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:44:19,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 170 [2023-01-28 00:44:19,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:44:19,631 INFO L130 PetriNetUnfolder]: 9/46 cut-off events. [2023-01-28 00:44:19,632 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2023-01-28 00:44:19,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 46 events. 9/46 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 83 event pairs, 1 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 177. Up to 22 conditions per place. [2023-01-28 00:44:19,632 INFO L137 encePairwiseOnDemand]: 164/170 looper letters, 14 selfloop transitions, 5 changer transitions 10/32 dead transitions. [2023-01-28 00:44:19,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 257 flow [2023-01-28 00:44:19,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:44:19,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:44:19,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 453 transitions. [2023-01-28 00:44:19,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4441176470588235 [2023-01-28 00:44:19,634 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 453 transitions. [2023-01-28 00:44:19,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 453 transitions. [2023-01-28 00:44:19,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:44:19,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 453 transitions. [2023-01-28 00:44:19,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 0 states have call successors, (0), 0 states 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:44:19,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states 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:44:19,637 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states 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:44:19,638 INFO L175 Difference]: Start difference. First operand has 43 places, 25 transitions, 149 flow. Second operand 6 states and 453 transitions. [2023-01-28 00:44:19,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 257 flow [2023-01-28 00:44:19,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 219 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-01-28 00:44:19,639 INFO L231 Difference]: Finished difference. Result has 43 places, 21 transitions, 118 flow [2023-01-28 00:44:19,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=43, PETRI_TRANSITIONS=21} [2023-01-28 00:44:19,640 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2023-01-28 00:44:19,640 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 21 transitions, 118 flow [2023-01-28 00:44:19,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states 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:44:19,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:19,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:19,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:44:19,641 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:44:19,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:19,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1183433546, now seen corresponding path program 2 times [2023-01-28 00:44:19,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:19,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728545447] [2023-01-28 00:44:19,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:19,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:44:19,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:44:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:44:19,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:44:19,715 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:44:19,716 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 00:44:19,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 00:44:19,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 00:44:19,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 00:44:19,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 00:44:19,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:44:19,718 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:19,721 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:44:19,721 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:44:19,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:44:19 BasicIcfg [2023-01-28 00:44:19,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:44:19,751 INFO L158 Benchmark]: Toolchain (without parser) took 8792.92ms. Allocated memory was 625.0MB in the beginning and 801.1MB in the end (delta: 176.2MB). Free memory was 568.6MB in the beginning and 513.3MB in the end (delta: 55.3MB). Peak memory consumption was 233.0MB. Max. memory is 16.0GB. [2023-01-28 00:44:19,751 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 379.6MB. Free memory was 324.6MB in the beginning and 324.4MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:44:19,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.90ms. Allocated memory is still 625.0MB. Free memory was 568.6MB in the beginning and 546.0MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:44:19,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.44ms. Allocated memory is still 625.0MB. Free memory was 546.0MB in the beginning and 543.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:44:19,752 INFO L158 Benchmark]: Boogie Preprocessor took 31.60ms. Allocated memory is still 625.0MB. Free memory was 543.2MB in the beginning and 541.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:44:19,752 INFO L158 Benchmark]: RCFGBuilder took 535.01ms. Allocated memory is still 625.0MB. Free memory was 541.6MB in the beginning and 570.9MB in the end (delta: -29.4MB). Peak memory consumption was 25.5MB. Max. memory is 16.0GB. [2023-01-28 00:44:19,752 INFO L158 Benchmark]: TraceAbstraction took 7756.00ms. Allocated memory was 625.0MB in the beginning and 801.1MB in the end (delta: 176.2MB). Free memory was 570.1MB in the beginning and 513.3MB in the end (delta: 56.8MB). Peak memory consumption was 232.6MB. Max. memory is 16.0GB. [2023-01-28 00:44:19,753 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.10ms. Allocated memory is still 379.6MB. Free memory was 324.6MB in the beginning and 324.4MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 407.90ms. Allocated memory is still 625.0MB. Free memory was 568.6MB in the beginning and 546.0MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.44ms. Allocated memory is still 625.0MB. Free memory was 546.0MB in the beginning and 543.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.60ms. Allocated memory is still 625.0MB. Free memory was 543.2MB in the beginning and 541.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 535.01ms. Allocated memory is still 625.0MB. Free memory was 541.6MB in the beginning and 570.9MB in the end (delta: -29.4MB). Peak memory consumption was 25.5MB. Max. memory is 16.0GB. * TraceAbstraction took 7756.00ms. Allocated memory was 625.0MB in the beginning and 801.1MB in the end (delta: 176.2MB). Free memory was 570.1MB in the beginning and 513.3MB in the end (delta: 56.8MB). Peak memory consumption was 232.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 93 PlacesBefore, 26 PlacesAfterwards, 88 TransitionsBefore, 19 TransitionsAfterwards, 1156 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 80 TotalNumberOfCompositions, 3123 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1534, independent: 1394, independent conditional: 0, independent unconditional: 1394, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 669, independent: 640, independent conditional: 0, independent unconditional: 640, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1534, independent: 754, independent conditional: 0, independent unconditional: 754, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 669, unknown conditional: 0, unknown unconditional: 669] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1587; [L801] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1587, ((void *)0), P0, ((void *)0))=-1, t1587={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L802] 0 pthread_t t1588; [L803] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1588, ((void *)0), P1, ((void *)0))=0, t1587={5:0}, t1588={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L807] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L807] RET 0 assume_abort_if_not(main$tmp_guard0) [L809] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1587={5:0}, t1588={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 801]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 110 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 474 IncrementalHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 22 mSDtfsCounter, 474 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=774occurred in iteration=7, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 1632 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:44:19,771 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...