./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be50e7e5241b29f4a9e868e4f8ec6ed8a757d2cee90daca598ed21c4a5ee9d77 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:16:14,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:16:14,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:16:14,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:16:14,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:16:14,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:16:14,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:16:14,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:16:14,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:16:14,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:16:14,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:16:14,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:16:14,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:16:14,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:16:14,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:16:14,075 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:16:14,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:16:14,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:16:14,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:16:14,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:16:14,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:16:14,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:16:14,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:16:14,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:16:14,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:16:14,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:16:14,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:16:14,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:16:14,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:16:14,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:16:14,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:16:14,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:16:14,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:16:14,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:16:14,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:16:14,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:16:14,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:16:14,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:16:14,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:16:14,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:16:14,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:16:14,122 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:16:14,156 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:16:14,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:16:14,157 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:16:14,157 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:16:14,158 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:16:14,158 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:16:14,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:16:14,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:16:14,159 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:16:14,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:16:14,160 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:16:14,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:16:14,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:16:14,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:16:14,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:16:14,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:16:14,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:16:14,162 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:16:14,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:16:14,162 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:16:14,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:16:14,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:16:14,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:16:14,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:16:14,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:16:14,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:16:14,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:16:14,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:16:14,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:16:14,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:16:14,164 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:16:14,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:16:14,165 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:16:14,165 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:16:14,165 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:16:14,165 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be50e7e5241b29f4a9e868e4f8ec6ed8a757d2cee90daca598ed21c4a5ee9d77 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 -> TOGETHER [2023-08-30 23:16:14,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:16:14,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:16:14,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:16:14,459 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:16:14,459 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:16:14,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 23:16:15,651 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:16:15,960 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:16:15,961 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 23:16:15,975 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ddf66cd6/4f873791b85e4ca2b9bdbb3bdbefd9fc/FLAG54e878fc7 [2023-08-30 23:16:15,988 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ddf66cd6/4f873791b85e4ca2b9bdbb3bdbefd9fc [2023-08-30 23:16:15,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:16:15,991 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:16:15,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:16:15,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:16:15,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:16:15,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:16:15" (1/1) ... [2023-08-30 23:16:15,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4346ca01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:16:15, skipping insertion in model container [2023-08-30 23:16:15,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:16:15" (1/1) ... [2023-08-30 23:16:16,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:16:16,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:16:16,179 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.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 23:16:16,359 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:16:16,372 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:16:16,387 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.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 23:16:16,481 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:16:16,529 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:16:16,530 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:16:16,535 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:16:16,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:16:16 WrapperNode [2023-08-30 23:16:16,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:16:16,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:16:16,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:16:16,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:16:16,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:16:16" (1/1) ... [2023-08-30 23:16:16,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:16:16" (1/1) ... [2023-08-30 23:16:16,579 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2023-08-30 23:16:16,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:16:16,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:16:16,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:16:16,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:16:16,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:16:16" (1/1) ... [2023-08-30 23:16:16,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:16:16" (1/1) ... [2023-08-30 23:16:16,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:16:16" (1/1) ... [2023-08-30 23:16:16,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:16:16" (1/1) ... [2023-08-30 23:16:16,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:16:16" (1/1) ... [2023-08-30 23:16:16,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:16:16" (1/1) ... [2023-08-30 23:16:16,605 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:16:16" (1/1) ... [2023-08-30 23:16:16,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:16:16" (1/1) ... [2023-08-30 23:16:16,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:16:16,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:16:16,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:16:16,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:16:16,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:16:16" (1/1) ... [2023-08-30 23:16:16,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:16:16,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:16:16,646 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-08-30 23:16:16,668 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-08-30 23:16:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:16:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:16:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:16:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:16:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:16:16,684 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:16:16,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:16:16,684 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:16:16,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:16:16,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:16:16,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:16:16,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:16:16,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:16:16,686 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 23:16:16,825 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:16:16,841 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:16:17,164 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:16:17,393 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:16:17,394 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:16:17,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:16:17 BoogieIcfgContainer [2023-08-30 23:16:17,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:16:17,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:16:17,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:16:17,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:16:17,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:16:15" (1/3) ... [2023-08-30 23:16:17,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fccbf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:16:17, skipping insertion in model container [2023-08-30 23:16:17,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:16:16" (2/3) ... [2023-08-30 23:16:17,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fccbf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:16:17, skipping insertion in model container [2023-08-30 23:16:17,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:16:17" (3/3) ... [2023-08-30 23:16:17,405 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 23:16:17,416 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:16:17,425 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:16:17,426 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:16:17,426 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:16:17,489 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:16:17,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2023-08-30 23:16:17,580 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2023-08-30 23:16:17,580 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:16:17,585 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 46 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-08-30 23:16:17,586 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2023-08-30 23:16:17,591 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2023-08-30 23:16:17,595 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:16:17,610 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 182 flow [2023-08-30 23:16:17,613 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 182 flow [2023-08-30 23:16:17,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 182 flow [2023-08-30 23:16:17,642 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2023-08-30 23:16:17,642 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:16:17,643 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 46 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-08-30 23:16:17,645 INFO L119 LiptonReduction]: Number of co-enabled transitions 1174 [2023-08-30 23:16:21,556 INFO L134 LiptonReduction]: Checked pairs total: 3166 [2023-08-30 23:16:21,557 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-08-30 23:16:21,569 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:16:21,575 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=true, 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;@15cc52cc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:16:21,575 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 23:16:21,577 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-08-30 23:16:21,578 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:16:21,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:16:21,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 23:16:21,579 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:16:21,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:16:21,583 INFO L85 PathProgramCache]: Analyzing trace with hash 476963, now seen corresponding path program 1 times [2023-08-30 23:16:21,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:16:21,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824980699] [2023-08-30 23:16:21,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:16:21,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:16:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:16:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:16:21,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:16:21,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824980699] [2023-08-30 23:16:21,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824980699] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:16:21,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:16:21,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:16:21,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823247597] [2023-08-30 23:16:21,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:16:21,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:16:21,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:16:21,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:16:21,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:16:21,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 172 [2023-08-30 23:16:21,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:21,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:16:21,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 172 [2023-08-30 23:16:21,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:16:22,176 INFO L130 PetriNetUnfolder]: 173/315 cut-off events. [2023-08-30 23:16:22,176 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 23:16:22,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 315 events. 173/315 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1204 event pairs, 60 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 621. Up to 250 conditions per place. [2023-08-30 23:16:22,182 INFO L137 encePairwiseOnDemand]: 169/172 looper letters, 23 selfloop transitions, 2 changer transitions 2/29 dead transitions. [2023-08-30 23:16:22,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 121 flow [2023-08-30 23:16:22,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:16:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:16:22,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2023-08-30 23:16:22,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49612403100775193 [2023-08-30 23:16:22,202 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 256 transitions. [2023-08-30 23:16:22,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 256 transitions. [2023-08-30 23:16:22,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:16:22,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 256 transitions. [2023-08-30 23:16:22,213 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-08-30 23:16:22,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:22,217 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:22,219 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 256 transitions. [2023-08-30 23:16:22,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 121 flow [2023-08-30 23:16:22,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:16:22,224 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 42 flow [2023-08-30 23:16:22,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, 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-08-30 23:16:22,229 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-08-30 23:16:22,229 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 42 flow [2023-08-30 23:16:22,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:22,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:16:22,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:16:22,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:16:22,231 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:16:22,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:16:22,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1856191249, now seen corresponding path program 1 times [2023-08-30 23:16:22,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:16:22,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734788269] [2023-08-30 23:16:22,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:16:22,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:16:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:16:23,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:16:23,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:16:23,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734788269] [2023-08-30 23:16:23,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734788269] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:16:23,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:16:23,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:16:23,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12161535] [2023-08-30 23:16:23,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:16:23,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:16:23,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:16:23,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:16:23,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:16:23,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 172 [2023-08-30 23:16:23,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:23,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:16:23,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 172 [2023-08-30 23:16:23,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:16:23,494 INFO L130 PetriNetUnfolder]: 177/317 cut-off events. [2023-08-30 23:16:23,494 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2023-08-30 23:16:23,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 317 events. 177/317 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1081 event pairs, 53 based on Foata normal form. 14/327 useless extension candidates. Maximal degree in co-relation 661. Up to 212 conditions per place. [2023-08-30 23:16:23,497 INFO L137 encePairwiseOnDemand]: 164/172 looper letters, 21 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2023-08-30 23:16:23,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 124 flow [2023-08-30 23:16:23,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:16:23,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:16:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 302 transitions. [2023-08-30 23:16:23,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.438953488372093 [2023-08-30 23:16:23,500 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 302 transitions. [2023-08-30 23:16:23,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 302 transitions. [2023-08-30 23:16:23,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:16:23,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 302 transitions. [2023-08-30 23:16:23,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-08-30 23:16:23,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:23,506 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:23,506 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 42 flow. Second operand 4 states and 302 transitions. [2023-08-30 23:16:23,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 124 flow [2023-08-30 23:16:23,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:16:23,507 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 90 flow [2023-08-30 23:16:23,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2023-08-30 23:16:23,508 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2023-08-30 23:16:23,509 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 90 flow [2023-08-30 23:16:23,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:23,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:16:23,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:16:23,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:16:23,510 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:16:23,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:16:23,512 INFO L85 PathProgramCache]: Analyzing trace with hash -999855663, now seen corresponding path program 1 times [2023-08-30 23:16:23,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:16:23,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738914690] [2023-08-30 23:16:23,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:16:23,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:16:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:16:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:16:24,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:16:24,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738914690] [2023-08-30 23:16:24,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738914690] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:16:24,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:16:24,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:16:24,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309516862] [2023-08-30 23:16:24,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:16:24,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:16:24,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:16:24,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:16:24,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:16:24,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 172 [2023-08-30 23:16:24,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:24,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:16:24,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 172 [2023-08-30 23:16:24,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:16:24,563 INFO L130 PetriNetUnfolder]: 167/302 cut-off events. [2023-08-30 23:16:24,564 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2023-08-30 23:16:24,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 302 events. 167/302 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1039 event pairs, 68 based on Foata normal form. 5/302 useless extension candidates. Maximal degree in co-relation 844. Up to 159 conditions per place. [2023-08-30 23:16:24,567 INFO L137 encePairwiseOnDemand]: 165/172 looper letters, 24 selfloop transitions, 7 changer transitions 0/32 dead transitions. [2023-08-30 23:16:24,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 188 flow [2023-08-30 23:16:24,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:16:24,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:16:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 300 transitions. [2023-08-30 23:16:24,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.436046511627907 [2023-08-30 23:16:24,569 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 300 transitions. [2023-08-30 23:16:24,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 300 transitions. [2023-08-30 23:16:24,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:16:24,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 300 transitions. [2023-08-30 23:16:24,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:24,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:24,572 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:24,572 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 90 flow. Second operand 4 states and 300 transitions. [2023-08-30 23:16:24,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 188 flow [2023-08-30 23:16:24,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:16:24,575 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 142 flow [2023-08-30 23:16:24,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-30 23:16:24,576 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2023-08-30 23:16:24,576 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 142 flow [2023-08-30 23:16:24,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:24,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:16:24,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:16:24,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:16:24,577 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:16:24,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:16:24,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1777407638, now seen corresponding path program 1 times [2023-08-30 23:16:24,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:16:24,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946476937] [2023-08-30 23:16:24,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:16:24,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:16:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:16:25,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:16:25,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:16:25,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946476937] [2023-08-30 23:16:25,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946476937] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:16:25,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:16:25,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:16:25,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821227634] [2023-08-30 23:16:25,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:16:25,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:16:25,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:16:25,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:16:25,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:16:25,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 172 [2023-08-30 23:16:25,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 142 flow. Second operand has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:25,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:16:25,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 172 [2023-08-30 23:16:25,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:16:25,893 INFO L130 PetriNetUnfolder]: 162/299 cut-off events. [2023-08-30 23:16:25,894 INFO L131 PetriNetUnfolder]: For 255/262 co-relation queries the response was YES. [2023-08-30 23:16:25,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 299 events. 162/299 cut-off events. For 255/262 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1033 event pairs, 46 based on Foata normal form. 10/306 useless extension candidates. Maximal degree in co-relation 923. Up to 244 conditions per place. [2023-08-30 23:16:25,903 INFO L137 encePairwiseOnDemand]: 168/172 looper letters, 31 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2023-08-30 23:16:25,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 255 flow [2023-08-30 23:16:25,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:16:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:16:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 322 transitions. [2023-08-30 23:16:25,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4680232558139535 [2023-08-30 23:16:25,906 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 322 transitions. [2023-08-30 23:16:25,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 322 transitions. [2023-08-30 23:16:25,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:16:25,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 322 transitions. [2023-08-30 23:16:25,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:25,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:25,909 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:25,909 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 142 flow. Second operand 4 states and 322 transitions. [2023-08-30 23:16:25,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 255 flow [2023-08-30 23:16:25,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 246 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 23:16:25,913 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 156 flow [2023-08-30 23:16:25,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2023-08-30 23:16:25,914 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2023-08-30 23:16:25,914 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 156 flow [2023-08-30 23:16:25,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:25,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:16:25,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:16:25,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:16:25,916 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:16:25,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:16:25,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1248228985, now seen corresponding path program 1 times [2023-08-30 23:16:25,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:16:25,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6982492] [2023-08-30 23:16:25,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:16:25,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:16:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:16:26,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:16:26,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:16:26,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6982492] [2023-08-30 23:16:26,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6982492] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:16:26,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:16:26,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:16:26,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858866245] [2023-08-30 23:16:26,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:16:26,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:16:26,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:16:26,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:16:26,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:16:26,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 172 [2023-08-30 23:16:26,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 156 flow. Second operand has 7 states, 7 states have (on average 68.71428571428571) internal successors, (481), 7 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:26,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:16:26,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 172 [2023-08-30 23:16:26,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:16:27,155 INFO L130 PetriNetUnfolder]: 178/323 cut-off events. [2023-08-30 23:16:27,156 INFO L131 PetriNetUnfolder]: For 256/263 co-relation queries the response was YES. [2023-08-30 23:16:27,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 323 events. 178/323 cut-off events. For 256/263 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1179 event pairs, 39 based on Foata normal form. 11/330 useless extension candidates. Maximal degree in co-relation 1033. Up to 190 conditions per place. [2023-08-30 23:16:27,159 INFO L137 encePairwiseOnDemand]: 165/172 looper letters, 34 selfloop transitions, 14 changer transitions 0/51 dead transitions. [2023-08-30 23:16:27,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 350 flow [2023-08-30 23:16:27,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:16:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:16:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 441 transitions. [2023-08-30 23:16:27,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4273255813953488 [2023-08-30 23:16:27,163 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 441 transitions. [2023-08-30 23:16:27,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 441 transitions. [2023-08-30 23:16:27,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:16:27,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 441 transitions. [2023-08-30 23:16:27,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:27,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:27,167 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:27,167 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 156 flow. Second operand 6 states and 441 transitions. [2023-08-30 23:16:27,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 350 flow [2023-08-30 23:16:27,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:16:27,170 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 253 flow [2023-08-30 23:16:27,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=253, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2023-08-30 23:16:27,171 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2023-08-30 23:16:27,171 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 253 flow [2023-08-30 23:16:27,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.71428571428571) internal successors, (481), 7 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:27,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:16:27,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:16:27,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:16:27,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:16:27,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:16:27,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1605672167, now seen corresponding path program 1 times [2023-08-30 23:16:27,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:16:27,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274207739] [2023-08-30 23:16:27,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:16:27,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:16:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:16:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:16:29,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:16:29,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274207739] [2023-08-30 23:16:29,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274207739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:16:29,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:16:29,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 23:16:29,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082874094] [2023-08-30 23:16:29,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:16:29,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 23:16:29,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:16:29,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 23:16:29,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-30 23:16:29,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 172 [2023-08-30 23:16:29,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 253 flow. Second operand has 9 states, 9 states have (on average 70.44444444444444) internal successors, (634), 9 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:29,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:16:29,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 172 [2023-08-30 23:16:29,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:16:29,670 INFO L130 PetriNetUnfolder]: 289/542 cut-off events. [2023-08-30 23:16:29,671 INFO L131 PetriNetUnfolder]: For 973/981 co-relation queries the response was YES. [2023-08-30 23:16:29,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2160 conditions, 542 events. 289/542 cut-off events. For 973/981 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2450 event pairs, 11 based on Foata normal form. 26/565 useless extension candidates. Maximal degree in co-relation 2137. Up to 260 conditions per place. [2023-08-30 23:16:29,675 INFO L137 encePairwiseOnDemand]: 165/172 looper letters, 49 selfloop transitions, 16 changer transitions 17/85 dead transitions. [2023-08-30 23:16:29,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 85 transitions, 754 flow [2023-08-30 23:16:29,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:16:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:16:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 534 transitions. [2023-08-30 23:16:29,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4435215946843854 [2023-08-30 23:16:29,678 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 534 transitions. [2023-08-30 23:16:29,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 534 transitions. [2023-08-30 23:16:29,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:16:29,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 534 transitions. [2023-08-30 23:16:29,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 76.28571428571429) internal successors, (534), 7 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:29,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:29,684 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:29,684 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 253 flow. Second operand 7 states and 534 transitions. [2023-08-30 23:16:29,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 85 transitions, 754 flow [2023-08-30 23:16:29,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 85 transitions, 751 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 23:16:29,691 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 396 flow [2023-08-30 23:16:29,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=396, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-30 23:16:29,693 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2023-08-30 23:16:29,694 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 396 flow [2023-08-30 23:16:29,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 70.44444444444444) internal successors, (634), 9 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:29,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:16:29,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:16:29,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:16:29,695 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:16:29,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:16:29,696 INFO L85 PathProgramCache]: Analyzing trace with hash 623443701, now seen corresponding path program 2 times [2023-08-30 23:16:29,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:16:29,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895974291] [2023-08-30 23:16:29,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:16:29,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:16:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:16:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:16:31,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:16:31,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895974291] [2023-08-30 23:16:31,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895974291] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:16:31,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:16:31,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:16:31,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914883547] [2023-08-30 23:16:31,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:16:31,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 23:16:31,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:16:31,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 23:16:31,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-30 23:16:31,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 172 [2023-08-30 23:16:31,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 396 flow. Second operand has 8 states, 8 states have (on average 72.625) internal successors, (581), 8 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:31,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:16:31,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 172 [2023-08-30 23:16:31,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:16:31,464 INFO L130 PetriNetUnfolder]: 199/393 cut-off events. [2023-08-30 23:16:31,464 INFO L131 PetriNetUnfolder]: For 1496/1508 co-relation queries the response was YES. [2023-08-30 23:16:31,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1922 conditions, 393 events. 199/393 cut-off events. For 1496/1508 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1700 event pairs, 15 based on Foata normal form. 14/402 useless extension candidates. Maximal degree in co-relation 1894. Up to 268 conditions per place. [2023-08-30 23:16:31,468 INFO L137 encePairwiseOnDemand]: 163/172 looper letters, 47 selfloop transitions, 15 changer transitions 0/65 dead transitions. [2023-08-30 23:16:31,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 693 flow [2023-08-30 23:16:31,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:16:31,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:16:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 394 transitions. [2023-08-30 23:16:31,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45813953488372094 [2023-08-30 23:16:31,471 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 394 transitions. [2023-08-30 23:16:31,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 394 transitions. [2023-08-30 23:16:31,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:16:31,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 394 transitions. [2023-08-30 23:16:31,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:31,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:31,474 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:31,474 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 396 flow. Second operand 5 states and 394 transitions. [2023-08-30 23:16:31,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 693 flow [2023-08-30 23:16:31,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 645 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-30 23:16:31,480 INFO L231 Difference]: Finished difference. Result has 51 places, 51 transitions, 534 flow [2023-08-30 23:16:31,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=534, PETRI_PLACES=51, PETRI_TRANSITIONS=51} [2023-08-30 23:16:31,481 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 25 predicate places. [2023-08-30 23:16:31,481 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 534 flow [2023-08-30 23:16:31,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 72.625) internal successors, (581), 8 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:31,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:16:31,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:16:31,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:16:31,482 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:16:31,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:16:31,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1103785285, now seen corresponding path program 3 times [2023-08-30 23:16:31,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:16:31,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515513109] [2023-08-30 23:16:31,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:16:31,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:16:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:16:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:16:32,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:16:32,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515513109] [2023-08-30 23:16:32,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515513109] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:16:32,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:16:32,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:16:32,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996146370] [2023-08-30 23:16:32,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:16:32,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:16:32,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:16:32,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:16:32,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:16:32,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 172 [2023-08-30 23:16:32,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 534 flow. Second operand has 7 states, 7 states have (on average 72.85714285714286) internal successors, (510), 7 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:32,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:16:32,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 172 [2023-08-30 23:16:32,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:16:33,037 INFO L130 PetriNetUnfolder]: 206/414 cut-off events. [2023-08-30 23:16:33,037 INFO L131 PetriNetUnfolder]: For 1911/1924 co-relation queries the response was YES. [2023-08-30 23:16:33,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 414 events. 206/414 cut-off events. For 1911/1924 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1841 event pairs, 20 based on Foata normal form. 17/426 useless extension candidates. Maximal degree in co-relation 2131. Up to 218 conditions per place. [2023-08-30 23:16:33,041 INFO L137 encePairwiseOnDemand]: 166/172 looper letters, 54 selfloop transitions, 20 changer transitions 0/77 dead transitions. [2023-08-30 23:16:33,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 77 transitions, 890 flow [2023-08-30 23:16:33,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:16:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:16:33,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 464 transitions. [2023-08-30 23:16:33,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4496124031007752 [2023-08-30 23:16:33,044 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 464 transitions. [2023-08-30 23:16:33,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 464 transitions. [2023-08-30 23:16:33,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:16:33,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 464 transitions. [2023-08-30 23:16:33,046 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-08-30 23:16:33,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:33,048 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:33,048 INFO L175 Difference]: Start difference. First operand has 51 places, 51 transitions, 534 flow. Second operand 6 states and 464 transitions. [2023-08-30 23:16:33,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 77 transitions, 890 flow [2023-08-30 23:16:33,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 77 transitions, 865 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-30 23:16:33,055 INFO L231 Difference]: Finished difference. Result has 55 places, 59 transitions, 678 flow [2023-08-30 23:16:33,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=678, PETRI_PLACES=55, PETRI_TRANSITIONS=59} [2023-08-30 23:16:33,058 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 29 predicate places. [2023-08-30 23:16:33,058 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 59 transitions, 678 flow [2023-08-30 23:16:33,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 72.85714285714286) internal successors, (510), 7 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:33,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:16:33,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:16:33,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:16:33,061 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:16:33,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:16:33,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1577778879, now seen corresponding path program 4 times [2023-08-30 23:16:33,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:16:33,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361217213] [2023-08-30 23:16:33,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:16:33,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:16:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:16:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:16:34,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:16:34,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361217213] [2023-08-30 23:16:34,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361217213] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:16:34,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:16:34,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:16:34,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039683384] [2023-08-30 23:16:34,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:16:34,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:16:34,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:16:34,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:16:34,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:16:34,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 172 [2023-08-30 23:16:34,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 59 transitions, 678 flow. Second operand has 7 states, 7 states have (on average 73.85714285714286) internal successors, (517), 7 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:34,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:16:34,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 172 [2023-08-30 23:16:34,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:16:34,564 INFO L130 PetriNetUnfolder]: 204/417 cut-off events. [2023-08-30 23:16:34,565 INFO L131 PetriNetUnfolder]: For 2419/2433 co-relation queries the response was YES. [2023-08-30 23:16:34,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2312 conditions, 417 events. 204/417 cut-off events. For 2419/2433 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1918 event pairs, 16 based on Foata normal form. 18/430 useless extension candidates. Maximal degree in co-relation 2284. Up to 219 conditions per place. [2023-08-30 23:16:34,569 INFO L137 encePairwiseOnDemand]: 164/172 looper letters, 48 selfloop transitions, 35 changer transitions 0/86 dead transitions. [2023-08-30 23:16:34,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 86 transitions, 1052 flow [2023-08-30 23:16:34,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:16:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:16:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 475 transitions. [2023-08-30 23:16:34,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46027131782945735 [2023-08-30 23:16:34,579 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 475 transitions. [2023-08-30 23:16:34,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 475 transitions. [2023-08-30 23:16:34,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:16:34,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 475 transitions. [2023-08-30 23:16:34,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 79.16666666666667) internal successors, (475), 6 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:34,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:34,583 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:34,583 INFO L175 Difference]: Start difference. First operand has 55 places, 59 transitions, 678 flow. Second operand 6 states and 475 transitions. [2023-08-30 23:16:34,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 86 transitions, 1052 flow [2023-08-30 23:16:34,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 86 transitions, 1031 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 23:16:34,591 INFO L231 Difference]: Finished difference. Result has 61 places, 70 transitions, 916 flow [2023-08-30 23:16:34,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=916, PETRI_PLACES=61, PETRI_TRANSITIONS=70} [2023-08-30 23:16:34,592 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 35 predicate places. [2023-08-30 23:16:34,592 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 70 transitions, 916 flow [2023-08-30 23:16:34,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.85714285714286) internal successors, (517), 7 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:34,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:16:34,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:16:34,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:16:34,593 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:16:34,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:16:34,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1244697530, now seen corresponding path program 1 times [2023-08-30 23:16:34,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:16:34,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162956858] [2023-08-30 23:16:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:16:34,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:16:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:16:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:16:34,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:16:34,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162956858] [2023-08-30 23:16:34,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162956858] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:16:34,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:16:34,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:16:34,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928192830] [2023-08-30 23:16:34,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:16:34,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:16:34,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:16:34,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:16:34,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:16:34,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 172 [2023-08-30 23:16:34,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 70 transitions, 916 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:34,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:16:34,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 172 [2023-08-30 23:16:34,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:16:34,957 INFO L130 PetriNetUnfolder]: 272/532 cut-off events. [2023-08-30 23:16:34,957 INFO L131 PetriNetUnfolder]: For 3056/3061 co-relation queries the response was YES. [2023-08-30 23:16:34,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2982 conditions, 532 events. 272/532 cut-off events. For 3056/3061 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2569 event pairs, 85 based on Foata normal form. 6/534 useless extension candidates. Maximal degree in co-relation 2951. Up to 299 conditions per place. [2023-08-30 23:16:34,961 INFO L137 encePairwiseOnDemand]: 169/172 looper letters, 23 selfloop transitions, 2 changer transitions 62/88 dead transitions. [2023-08-30 23:16:34,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 88 transitions, 1242 flow [2023-08-30 23:16:34,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:16:34,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:16:34,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2023-08-30 23:16:34,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4844961240310077 [2023-08-30 23:16:34,963 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 250 transitions. [2023-08-30 23:16:34,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 250 transitions. [2023-08-30 23:16:34,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:16:34,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 250 transitions. [2023-08-30 23:16:34,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:34,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:34,966 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:34,966 INFO L175 Difference]: Start difference. First operand has 61 places, 70 transitions, 916 flow. Second operand 3 states and 250 transitions. [2023-08-30 23:16:34,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 88 transitions, 1242 flow [2023-08-30 23:16:34,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 1228 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 23:16:34,977 INFO L231 Difference]: Finished difference. Result has 62 places, 22 transitions, 188 flow [2023-08-30 23:16:34,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=62, PETRI_TRANSITIONS=22} [2023-08-30 23:16:34,978 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 36 predicate places. [2023-08-30 23:16:34,978 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 22 transitions, 188 flow [2023-08-30 23:16:34,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:34,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:16:34,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:16:34,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:16:34,979 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:16:34,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:16:34,980 INFO L85 PathProgramCache]: Analyzing trace with hash 493358754, now seen corresponding path program 2 times [2023-08-30 23:16:34,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:16:34,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008343421] [2023-08-30 23:16:34,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:16:34,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:16:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:16:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:16:35,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:16:35,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008343421] [2023-08-30 23:16:35,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008343421] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:16:35,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:16:35,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:16:35,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717905756] [2023-08-30 23:16:35,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:16:35,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:16:35,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:16:35,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:16:35,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:16:35,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 172 [2023-08-30 23:16:35,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 22 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:35,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:16:35,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 172 [2023-08-30 23:16:35,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:16:35,335 INFO L130 PetriNetUnfolder]: 28/76 cut-off events. [2023-08-30 23:16:35,335 INFO L131 PetriNetUnfolder]: For 425/425 co-relation queries the response was YES. [2023-08-30 23:16:35,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 76 events. 28/76 cut-off events. For 425/425 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 164 event pairs, 9 based on Foata normal form. 13/89 useless extension candidates. Maximal degree in co-relation 324. Up to 32 conditions per place. [2023-08-30 23:16:35,336 INFO L137 encePairwiseOnDemand]: 167/172 looper letters, 21 selfloop transitions, 4 changer transitions 1/28 dead transitions. [2023-08-30 23:16:35,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 28 transitions, 248 flow [2023-08-30 23:16:35,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:16:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:16:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2023-08-30 23:16:35,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4563953488372093 [2023-08-30 23:16:35,338 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 314 transitions. [2023-08-30 23:16:35,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 314 transitions. [2023-08-30 23:16:35,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:16:35,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 314 transitions. [2023-08-30 23:16:35,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:35,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:35,341 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:35,341 INFO L175 Difference]: Start difference. First operand has 62 places, 22 transitions, 188 flow. Second operand 4 states and 314 transitions. [2023-08-30 23:16:35,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 28 transitions, 248 flow [2023-08-30 23:16:35,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 171 flow, removed 15 selfloop flow, removed 24 redundant places. [2023-08-30 23:16:35,344 INFO L231 Difference]: Finished difference. Result has 37 places, 21 transitions, 105 flow [2023-08-30 23:16:35,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=37, PETRI_TRANSITIONS=21} [2023-08-30 23:16:35,344 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2023-08-30 23:16:35,344 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 21 transitions, 105 flow [2023-08-30 23:16:35,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:35,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:16:35,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:16:35,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:16:35,345 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:16:35,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:16:35,346 INFO L85 PathProgramCache]: Analyzing trace with hash 873312186, now seen corresponding path program 1 times [2023-08-30 23:16:35,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:16:35,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849769671] [2023-08-30 23:16:35,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:16:35,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:16:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:16:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:16:35,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:16:35,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849769671] [2023-08-30 23:16:35,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849769671] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:16:35,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:16:35,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:16:35,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80197357] [2023-08-30 23:16:35,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:16:35,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:16:35,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:16:35,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:16:35,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:16:35,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 172 [2023-08-30 23:16:35,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 21 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 74.6) internal successors, (373), 5 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:35,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:16:35,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 172 [2023-08-30 23:16:35,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:16:35,885 INFO L130 PetriNetUnfolder]: 9/37 cut-off events. [2023-08-30 23:16:35,886 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2023-08-30 23:16:35,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 37 events. 9/37 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 2 based on Foata normal form. 5/42 useless extension candidates. Maximal degree in co-relation 135. Up to 16 conditions per place. [2023-08-30 23:16:35,886 INFO L137 encePairwiseOnDemand]: 167/172 looper letters, 15 selfloop transitions, 6 changer transitions 1/24 dead transitions. [2023-08-30 23:16:35,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 24 transitions, 169 flow [2023-08-30 23:16:35,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:16:35,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:16:35,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 382 transitions. [2023-08-30 23:16:35,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4441860465116279 [2023-08-30 23:16:35,888 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 382 transitions. [2023-08-30 23:16:35,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 382 transitions. [2023-08-30 23:16:35,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:16:35,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 382 transitions. [2023-08-30 23:16:35,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 76.4) internal successors, (382), 5 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:35,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:35,892 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:35,892 INFO L175 Difference]: Start difference. First operand has 37 places, 21 transitions, 105 flow. Second operand 5 states and 382 transitions. [2023-08-30 23:16:35,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 24 transitions, 169 flow [2023-08-30 23:16:35,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 24 transitions, 132 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-08-30 23:16:35,893 INFO L231 Difference]: Finished difference. Result has 37 places, 21 transitions, 100 flow [2023-08-30 23:16:35,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=21} [2023-08-30 23:16:35,894 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2023-08-30 23:16:35,894 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 21 transitions, 100 flow [2023-08-30 23:16:35,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.6) internal successors, (373), 5 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:16:35,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:16:35,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:16:35,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:16:35,895 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 23:16:35,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:16:35,896 INFO L85 PathProgramCache]: Analyzing trace with hash -732256741, now seen corresponding path program 1 times [2023-08-30 23:16:35,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:16:35,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628819491] [2023-08-30 23:16:35,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:16:35,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:16:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:16:35,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:16:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:16:36,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:16:36,032 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:16:36,033 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-30 23:16:36,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-30 23:16:36,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-30 23:16:36,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-30 23:16:36,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-30 23:16:36,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 23:16:36,039 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:16:36,045 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:16:36,046 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:16:36,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:16:36 BasicIcfg [2023-08-30 23:16:36,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:16:36,115 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:16:36,115 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:16:36,115 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:16:36,116 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:16:17" (3/4) ... [2023-08-30 23:16:36,117 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:16:36,193 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:16:36,194 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:16:36,194 INFO L158 Benchmark]: Toolchain (without parser) took 20203.32ms. Allocated memory was 81.8MB in the beginning and 373.3MB in the end (delta: 291.5MB). Free memory was 58.1MB in the beginning and 279.9MB in the end (delta: -221.8MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB. [2023-08-30 23:16:36,194 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 60.8MB. Free memory was 38.7MB in the beginning and 38.7MB in the end (delta: 44.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:16:36,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.77ms. Allocated memory is still 81.8MB. Free memory was 57.9MB in the beginning and 54.4MB in the end (delta: 3.5MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2023-08-30 23:16:36,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.00ms. Allocated memory is still 81.8MB. Free memory was 54.4MB in the beginning and 51.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:16:36,195 INFO L158 Benchmark]: Boogie Preprocessor took 28.62ms. Allocated memory is still 81.8MB. Free memory was 51.5MB in the beginning and 49.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:16:36,196 INFO L158 Benchmark]: RCFGBuilder took 786.94ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 49.4MB in the beginning and 70.4MB in the end (delta: -21.0MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2023-08-30 23:16:36,196 INFO L158 Benchmark]: TraceAbstraction took 18715.99ms. Allocated memory was 98.6MB in the beginning and 373.3MB in the end (delta: 274.7MB). Free memory was 69.8MB in the beginning and 288.3MB in the end (delta: -218.5MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2023-08-30 23:16:36,196 INFO L158 Benchmark]: Witness Printer took 78.86ms. Allocated memory is still 373.3MB. Free memory was 288.3MB in the beginning and 279.9MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-08-30 23:16:36,199 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.22ms. Allocated memory is still 60.8MB. Free memory was 38.7MB in the beginning and 38.7MB in the end (delta: 44.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 543.77ms. Allocated memory is still 81.8MB. Free memory was 57.9MB in the beginning and 54.4MB in the end (delta: 3.5MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.00ms. Allocated memory is still 81.8MB. Free memory was 54.4MB in the beginning and 51.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.62ms. Allocated memory is still 81.8MB. Free memory was 51.5MB in the beginning and 49.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 786.94ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 49.4MB in the beginning and 70.4MB in the end (delta: -21.0MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18715.99ms. Allocated memory was 98.6MB in the beginning and 373.3MB in the end (delta: 274.7MB). Free memory was 69.8MB in the beginning and 288.3MB in the end (delta: -218.5MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. * Witness Printer took 78.86ms. Allocated memory is still 373.3MB. Free memory was 288.3MB in the beginning and 279.9MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 93 PlacesBefore, 26 PlacesAfterwards, 88 TransitionsBefore, 19 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 82 TotalNumberOfCompositions, 3166 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1375, independent: 1234, independent conditional: 0, independent unconditional: 1234, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 679, independent: 641, independent conditional: 0, independent unconditional: 641, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1375, independent: 593, independent conditional: 0, independent unconditional: 593, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 679, unknown conditional: 0, unknown unconditional: 679] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L826] 0 pthread_t t1585; [L827] FCALL, FORK 0 pthread_create(&t1585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1585, ((void *)0), P0, ((void *)0))=-1, t1585={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 2 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L828] 0 pthread_t t1586; [L829] FCALL, FORK 0 pthread_create(&t1586, ((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(&t1586, ((void *)0), P1, ((void *)0))=0, t1585={5:0}, t1586={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L788] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 2 y$flush_delayed = weak$$choice2 [L791] 2 y$mem_tmp = y [L792] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L793] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L794] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L795] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L796] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L798] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] 2 __unbuffered_p1_EBX = y [L800] 2 y = y$flush_delayed ? y$mem_tmp : y [L801] 2 y$flush_delayed = (_Bool)0 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$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L804] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 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, t1585={5:0}, t1586={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1585={5:0}, t1586={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 y$flush_delayed = weak$$choice2 [L845] 0 y$mem_tmp = y [L846] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L847] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L854] 0 y = y$flush_delayed ? y$mem_tmp : y [L855] 0 y$flush_delayed = (_Bool)0 [L857] 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=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 827]: 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: 829]: 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: 18.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 449 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 336 mSDsluCounter, 304 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 267 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1051 IncrementalHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 267 mSolverCounterUnsat, 91 mSDtfsCounter, 1051 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=916occurred in iteration=9, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 2415 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-08-30 23:16:36,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE