./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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 ../sv-benchmarks/c/pthread-wmm/safe004_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 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 08:43:34,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 08:43:34,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 08:43:34,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 08:43:34,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 08:43:34,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 08:43:34,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 08:43:34,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 08:43:34,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 08:43:34,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 08:43:34,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 08:43:34,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 08:43:34,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 08:43:34,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 08:43:34,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 08:43:34,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 08:43:34,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 08:43:34,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 08:43:34,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 08:43:34,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 08:43:34,242 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 08:43:34,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 08:43:34,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 08:43:34,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 08:43:34,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 08:43:34,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 08:43:34,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 08:43:34,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 08:43:34,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 08:43:34,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 08:43:34,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 08:43:34,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 08:43:34,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 08:43:34,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 08:43:34,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 08:43:34,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 08:43:34,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 08:43:34,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 08:43:34,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 08:43:34,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 08:43:34,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 08:43:34,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 08:43:34,273 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 08:43:34,305 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 08:43:34,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 08:43:34,306 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 08:43:34,307 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 08:43:34,307 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 08:43:34,308 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 08:43:34,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 08:43:34,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 08:43:34,309 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 08:43:34,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 08:43:34,310 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 08:43:34,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 08:43:34,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 08:43:34,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 08:43:34,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 08:43:34,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 08:43:34,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 08:43:34,312 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 08:43:34,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 08:43:34,312 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 08:43:34,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 08:43:34,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 08:43:34,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 08:43:34,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 08:43:34,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:43:34,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 08:43:34,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 08:43:34,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 08:43:34,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 08:43:34,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 08:43:34,315 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 08:43:34,315 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 08:43:34,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 08:43:34,316 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 [2022-07-21 08:43:34,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 08:43:34,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 08:43:34,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 08:43:34,664 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 08:43:34,664 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 08:43:34,666 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-07-21 08:43:34,735 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1204ae6dc/0093d4259abe4ea2aca855929b610751/FLAGa49efb89a [2022-07-21 08:43:35,345 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 08:43:35,349 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-07-21 08:43:35,369 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1204ae6dc/0093d4259abe4ea2aca855929b610751/FLAGa49efb89a [2022-07-21 08:43:35,641 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1204ae6dc/0093d4259abe4ea2aca855929b610751 [2022-07-21 08:43:35,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 08:43:35,645 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 08:43:35,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 08:43:35,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 08:43:35,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 08:43:35,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:43:35" (1/1) ... [2022-07-21 08:43:35,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70320223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:43:35, skipping insertion in model container [2022-07-21 08:43:35,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:43:35" (1/1) ... [2022-07-21 08:43:35,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 08:43:35,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 08:43:35,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-07-21 08:43:36,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:43:36,157 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 08:43:36,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-07-21 08:43:36,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:43:36,288 INFO L208 MainTranslator]: Completed translation [2022-07-21 08:43:36,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:43:36 WrapperNode [2022-07-21 08:43:36,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 08:43:36,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 08:43:36,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 08:43:36,291 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 08:43:36,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:43:36" (1/1) ... [2022-07-21 08:43:36,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:43:36" (1/1) ... [2022-07-21 08:43:36,364 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2022-07-21 08:43:36,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 08:43:36,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 08:43:36,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 08:43:36,366 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 08:43:36,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:43:36" (1/1) ... [2022-07-21 08:43:36,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:43:36" (1/1) ... [2022-07-21 08:43:36,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:43:36" (1/1) ... [2022-07-21 08:43:36,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:43:36" (1/1) ... [2022-07-21 08:43:36,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:43:36" (1/1) ... [2022-07-21 08:43:36,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:43:36" (1/1) ... [2022-07-21 08:43:36,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:43:36" (1/1) ... [2022-07-21 08:43:36,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 08:43:36,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 08:43:36,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 08:43:36,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 08:43:36,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:43:36" (1/1) ... [2022-07-21 08:43:36,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:43:36,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:43:36,477 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) [2022-07-21 08:43:36,503 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 [2022-07-21 08:43:36,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 08:43:36,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-21 08:43:36,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 08:43:36,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 08:43:36,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 08:43:36,525 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-21 08:43:36,525 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-21 08:43:36,525 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-21 08:43:36,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-21 08:43:36,526 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-21 08:43:36,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-21 08:43:36,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 08:43:36,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-21 08:43:36,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 08:43:36,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 08:43:36,528 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-21 08:43:36,719 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 08:43:36,721 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 08:43:37,386 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 08:43:37,898 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 08:43:37,899 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 08:43:37,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:43:37 BoogieIcfgContainer [2022-07-21 08:43:37,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 08:43:37,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 08:43:37,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 08:43:37,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 08:43:37,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:43:35" (1/3) ... [2022-07-21 08:43:37,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60443154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:43:37, skipping insertion in model container [2022-07-21 08:43:37,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:43:36" (2/3) ... [2022-07-21 08:43:37,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60443154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:43:37, skipping insertion in model container [2022-07-21 08:43:37,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:43:37" (3/3) ... [2022-07-21 08:43:37,909 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-07-21 08:43:37,915 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-21 08:43:37,923 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 08:43:37,924 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-21 08:43:37,924 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-21 08:43:38,015 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-21 08:43:38,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-07-21 08:43:38,109 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2022-07-21 08:43:38,110 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:43:38,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-07-21 08:43:38,114 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-07-21 08:43:38,119 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-07-21 08:43:38,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:43:38,144 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1306d8da, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6c607457 [2022-07-21 08:43:38,145 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-21 08:43:38,158 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2022-07-21 08:43:38,158 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:43:38,158 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:38,159 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:38,160 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:38,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:38,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1877201928, now seen corresponding path program 1 times [2022-07-21 08:43:38,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:38,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360466841] [2022-07-21 08:43:38,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:38,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:38,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:38,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360466841] [2022-07-21 08:43:38,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360466841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:38,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:38,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 08:43:38,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454506024] [2022-07-21 08:43:38,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:38,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:43:38,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:38,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:43:38,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 08:43:38,519 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 114 [2022-07-21 08:43:38,522 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:38,522 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:38,522 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 114 [2022-07-21 08:43:38,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:38,813 INFO L129 PetriNetUnfolder]: 124/549 cut-off events. [2022-07-21 08:43:38,814 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-07-21 08:43:38,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 780 conditions, 549 events. 124/549 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2964 event pairs, 24 based on Foata normal form. 23/541 useless extension candidates. Maximal degree in co-relation 729. Up to 155 conditions per place. [2022-07-21 08:43:38,827 INFO L132 encePairwiseOnDemand]: 109/114 looper letters, 18 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2022-07-21 08:43:38,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 115 transitions, 285 flow [2022-07-21 08:43:38,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:43:38,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 08:43:38,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2022-07-21 08:43:38,848 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9327485380116959 [2022-07-21 08:43:38,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2022-07-21 08:43:38,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2022-07-21 08:43:38,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:38,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2022-07-21 08:43:38,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:38,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:38,870 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:38,872 INFO L186 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 319 transitions. [2022-07-21 08:43:38,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 115 transitions, 285 flow [2022-07-21 08:43:38,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 115 transitions, 280 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-21 08:43:38,882 INFO L242 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-07-21 08:43:38,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-07-21 08:43:38,889 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-07-21 08:43:38,890 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-07-21 08:43:38,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:38,891 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:38,891 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:38,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 08:43:38,892 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:38,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:38,894 INFO L85 PathProgramCache]: Analyzing trace with hash 185903545, now seen corresponding path program 1 times [2022-07-21 08:43:38,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:38,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659393716] [2022-07-21 08:43:38,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:38,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:39,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:39,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:39,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659393716] [2022-07-21 08:43:39,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659393716] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:39,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:39,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:43:39,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741732000] [2022-07-21 08:43:39,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:39,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:43:39,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:39,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:43:39,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:43:39,225 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-07-21 08:43:39,226 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:39,226 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:39,231 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-07-21 08:43:39,231 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:39,805 INFO L129 PetriNetUnfolder]: 488/1440 cut-off events. [2022-07-21 08:43:39,806 INFO L130 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-07-21 08:43:39,810 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2334 conditions, 1440 events. 488/1440 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10227 event pairs, 90 based on Foata normal form. 0/1396 useless extension candidates. Maximal degree in co-relation 2283. Up to 403 conditions per place. [2022-07-21 08:43:39,816 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 19 selfloop transitions, 2 changer transitions 48/147 dead transitions. [2022-07-21 08:43:39,816 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 147 transitions, 434 flow [2022-07-21 08:43:39,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:43:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:43:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 888 transitions. [2022-07-21 08:43:39,820 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8654970760233918 [2022-07-21 08:43:39,821 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 888 transitions. [2022-07-21 08:43:39,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 888 transitions. [2022-07-21 08:43:39,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:39,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 888 transitions. [2022-07-21 08:43:39,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.66666666666667) internal successors, (888), 9 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:39,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:39,828 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:39,828 INFO L186 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 888 transitions. [2022-07-21 08:43:39,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 147 transitions, 434 flow [2022-07-21 08:43:39,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 147 transitions, 416 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-21 08:43:39,834 INFO L242 Difference]: Finished difference. Result has 129 places, 95 transitions, 216 flow [2022-07-21 08:43:39,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=129, PETRI_TRANSITIONS=95} [2022-07-21 08:43:39,836 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-07-21 08:43:39,836 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 95 transitions, 216 flow [2022-07-21 08:43:39,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:39,837 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:39,837 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:39,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 08:43:39,837 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:39,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:39,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1199464864, now seen corresponding path program 1 times [2022-07-21 08:43:39,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:39,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169284201] [2022-07-21 08:43:39,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:39,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:40,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:40,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169284201] [2022-07-21 08:43:40,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169284201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:40,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:40,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:43:40,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654818219] [2022-07-21 08:43:40,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:40,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:43:40,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:40,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:43:40,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:43:40,052 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-07-21 08:43:40,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 95 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:40,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:40,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-07-21 08:43:40,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:40,604 INFO L129 PetriNetUnfolder]: 746/1549 cut-off events. [2022-07-21 08:43:40,604 INFO L130 PetriNetUnfolder]: For 403/403 co-relation queries the response was YES. [2022-07-21 08:43:40,610 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3156 conditions, 1549 events. 746/1549 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9115 event pairs, 361 based on Foata normal form. 36/1523 useless extension candidates. Maximal degree in co-relation 3098. Up to 705 conditions per place. [2022-07-21 08:43:40,616 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 25 selfloop transitions, 3 changer transitions 43/147 dead transitions. [2022-07-21 08:43:40,617 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 147 transitions, 487 flow [2022-07-21 08:43:40,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:43:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:43:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 883 transitions. [2022-07-21 08:43:40,620 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8606237816764133 [2022-07-21 08:43:40,620 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 883 transitions. [2022-07-21 08:43:40,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 883 transitions. [2022-07-21 08:43:40,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:40,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 883 transitions. [2022-07-21 08:43:40,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.11111111111111) internal successors, (883), 9 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:40,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:40,626 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:40,626 INFO L186 Difference]: Start difference. First operand has 129 places, 95 transitions, 216 flow. Second operand 9 states and 883 transitions. [2022-07-21 08:43:40,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 147 transitions, 487 flow [2022-07-21 08:43:40,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 147 transitions, 453 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-07-21 08:43:40,636 INFO L242 Difference]: Finished difference. Result has 118 places, 97 transitions, 243 flow [2022-07-21 08:43:40,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=243, PETRI_PLACES=118, PETRI_TRANSITIONS=97} [2022-07-21 08:43:40,637 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -1 predicate places. [2022-07-21 08:43:40,638 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 97 transitions, 243 flow [2022-07-21 08:43:40,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:40,638 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:40,639 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:40,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 08:43:40,639 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:40,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:40,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1646942535, now seen corresponding path program 1 times [2022-07-21 08:43:40,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:40,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869082600] [2022-07-21 08:43:40,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:40,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:40,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:40,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869082600] [2022-07-21 08:43:40,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869082600] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:40,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:40,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 08:43:40,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190617432] [2022-07-21 08:43:40,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:40,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 08:43:40,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:40,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 08:43:40,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:43:40,958 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-07-21 08:43:40,959 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 97 transitions, 243 flow. Second operand has 11 states, 11 states have (on average 88.45454545454545) internal successors, (973), 11 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:40,960 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:40,960 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-07-21 08:43:40,960 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:41,836 INFO L129 PetriNetUnfolder]: 994/1998 cut-off events. [2022-07-21 08:43:41,837 INFO L130 PetriNetUnfolder]: For 1510/1522 co-relation queries the response was YES. [2022-07-21 08:43:41,845 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4645 conditions, 1998 events. 994/1998 cut-off events. For 1510/1522 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12040 event pairs, 193 based on Foata normal form. 48/1937 useless extension candidates. Maximal degree in co-relation 4582. Up to 650 conditions per place. [2022-07-21 08:43:41,852 INFO L132 encePairwiseOnDemand]: 98/114 looper letters, 26 selfloop transitions, 12 changer transitions 61/174 dead transitions. [2022-07-21 08:43:41,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 174 transitions, 641 flow [2022-07-21 08:43:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 08:43:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-21 08:43:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1494 transitions. [2022-07-21 08:43:41,858 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.819078947368421 [2022-07-21 08:43:41,858 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1494 transitions. [2022-07-21 08:43:41,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1494 transitions. [2022-07-21 08:43:41,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:41,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1494 transitions. [2022-07-21 08:43:41,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 93.375) internal successors, (1494), 16 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:41,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:41,866 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:41,866 INFO L186 Difference]: Start difference. First operand has 118 places, 97 transitions, 243 flow. Second operand 16 states and 1494 transitions. [2022-07-21 08:43:41,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 174 transitions, 641 flow [2022-07-21 08:43:41,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 174 transitions, 620 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-07-21 08:43:41,879 INFO L242 Difference]: Finished difference. Result has 135 places, 103 transitions, 362 flow [2022-07-21 08:43:41,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=362, PETRI_PLACES=135, PETRI_TRANSITIONS=103} [2022-07-21 08:43:41,882 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 16 predicate places. [2022-07-21 08:43:41,883 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 103 transitions, 362 flow [2022-07-21 08:43:41,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.45454545454545) internal successors, (973), 11 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:41,883 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:41,884 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:41,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 08:43:41,884 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:41,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:41,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1553705098, now seen corresponding path program 1 times [2022-07-21 08:43:41,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:41,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438759473] [2022-07-21 08:43:41,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:41,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:42,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:42,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438759473] [2022-07-21 08:43:42,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438759473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:42,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:42,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:43:42,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178421727] [2022-07-21 08:43:42,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:42,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:43:42,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:42,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:43:42,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:43:42,026 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-07-21 08:43:42,027 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 103 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:42,027 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:42,027 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-07-21 08:43:42,027 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:42,452 INFO L129 PetriNetUnfolder]: 591/1244 cut-off events. [2022-07-21 08:43:42,452 INFO L130 PetriNetUnfolder]: For 6003/6733 co-relation queries the response was YES. [2022-07-21 08:43:42,460 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5329 conditions, 1244 events. 591/1244 cut-off events. For 6003/6733 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6899 event pairs, 151 based on Foata normal form. 42/1224 useless extension candidates. Maximal degree in co-relation 5254. Up to 447 conditions per place. [2022-07-21 08:43:42,468 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 23 selfloop transitions, 2 changer transitions 31/138 dead transitions. [2022-07-21 08:43:42,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 138 transitions, 748 flow [2022-07-21 08:43:42,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:43:42,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:43:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 882 transitions. [2022-07-21 08:43:42,472 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8596491228070176 [2022-07-21 08:43:42,472 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 882 transitions. [2022-07-21 08:43:42,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 882 transitions. [2022-07-21 08:43:42,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:42,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 882 transitions. [2022-07-21 08:43:42,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:42,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:42,477 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:42,477 INFO L186 Difference]: Start difference. First operand has 135 places, 103 transitions, 362 flow. Second operand 9 states and 882 transitions. [2022-07-21 08:43:42,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 138 transitions, 748 flow [2022-07-21 08:43:42,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 138 transitions, 716 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-07-21 08:43:42,488 INFO L242 Difference]: Finished difference. Result has 134 places, 103 transitions, 360 flow [2022-07-21 08:43:42,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=360, PETRI_PLACES=134, PETRI_TRANSITIONS=103} [2022-07-21 08:43:42,491 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 15 predicate places. [2022-07-21 08:43:42,491 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 103 transitions, 360 flow [2022-07-21 08:43:42,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:42,492 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:42,492 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:42,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 08:43:42,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:42,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:42,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1346675460, now seen corresponding path program 1 times [2022-07-21 08:43:42,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:42,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594023517] [2022-07-21 08:43:42,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:42,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:42,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:42,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594023517] [2022-07-21 08:43:42,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594023517] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:42,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:42,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:43:42,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624140729] [2022-07-21 08:43:42,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:42,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:43:42,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:42,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:43:42,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:43:42,683 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-07-21 08:43:42,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 103 transitions, 360 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:42,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:42,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-07-21 08:43:42,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:43,170 INFO L129 PetriNetUnfolder]: 750/1679 cut-off events. [2022-07-21 08:43:43,170 INFO L130 PetriNetUnfolder]: For 7727/9005 co-relation queries the response was YES. [2022-07-21 08:43:43,179 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7011 conditions, 1679 events. 750/1679 cut-off events. For 7727/9005 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10104 event pairs, 243 based on Foata normal form. 28/1612 useless extension candidates. Maximal degree in co-relation 6935. Up to 641 conditions per place. [2022-07-21 08:43:43,189 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 37 selfloop transitions, 3 changer transitions 28/146 dead transitions. [2022-07-21 08:43:43,190 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 146 transitions, 826 flow [2022-07-21 08:43:43,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:43:43,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:43:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 872 transitions. [2022-07-21 08:43:43,193 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8499025341130604 [2022-07-21 08:43:43,193 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 872 transitions. [2022-07-21 08:43:43,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 872 transitions. [2022-07-21 08:43:43,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:43,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 872 transitions. [2022-07-21 08:43:43,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.88888888888889) internal successors, (872), 9 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:43,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:43,198 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:43,198 INFO L186 Difference]: Start difference. First operand has 134 places, 103 transitions, 360 flow. Second operand 9 states and 872 transitions. [2022-07-21 08:43:43,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 146 transitions, 826 flow [2022-07-21 08:43:43,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 146 transitions, 772 flow, removed 24 selfloop flow, removed 8 redundant places. [2022-07-21 08:43:43,214 INFO L242 Difference]: Finished difference. Result has 135 places, 103 transitions, 365 flow [2022-07-21 08:43:43,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=365, PETRI_PLACES=135, PETRI_TRANSITIONS=103} [2022-07-21 08:43:43,215 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 16 predicate places. [2022-07-21 08:43:43,215 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 103 transitions, 365 flow [2022-07-21 08:43:43,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:43,215 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:43,216 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:43,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 08:43:43,216 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:43,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:43,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1287246978, now seen corresponding path program 1 times [2022-07-21 08:43:43,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:43,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122427592] [2022-07-21 08:43:43,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:43,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:43,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:43,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:43,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122427592] [2022-07-21 08:43:43,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122427592] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:43,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:43,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 08:43:43,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985567439] [2022-07-21 08:43:43,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:43,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 08:43:43,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:43,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 08:43:43,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-21 08:43:43,561 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-07-21 08:43:43,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 103 transitions, 365 flow. Second operand has 13 states, 13 states have (on average 87.46153846153847) internal successors, (1137), 13 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:43,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:43,563 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-07-21 08:43:43,563 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:44,931 INFO L129 PetriNetUnfolder]: 790/1770 cut-off events. [2022-07-21 08:43:44,932 INFO L130 PetriNetUnfolder]: For 8885/9542 co-relation queries the response was YES. [2022-07-21 08:43:44,943 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7399 conditions, 1770 events. 790/1770 cut-off events. For 8885/9542 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11262 event pairs, 130 based on Foata normal form. 48/1709 useless extension candidates. Maximal degree in co-relation 7318. Up to 697 conditions per place. [2022-07-21 08:43:44,956 INFO L132 encePairwiseOnDemand]: 99/114 looper letters, 43 selfloop transitions, 21 changer transitions 71/209 dead transitions. [2022-07-21 08:43:44,956 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 209 transitions, 1498 flow [2022-07-21 08:43:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-21 08:43:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-07-21 08:43:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2544 transitions. [2022-07-21 08:43:44,962 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7969924812030075 [2022-07-21 08:43:44,963 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 2544 transitions. [2022-07-21 08:43:44,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 2544 transitions. [2022-07-21 08:43:44,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:44,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2544 transitions. [2022-07-21 08:43:44,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 90.85714285714286) internal successors, (2544), 28 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:44,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 114.0) internal successors, (3306), 29 states have internal predecessors, (3306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:44,977 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 114.0) internal successors, (3306), 29 states have internal predecessors, (3306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:44,978 INFO L186 Difference]: Start difference. First operand has 135 places, 103 transitions, 365 flow. Second operand 28 states and 2544 transitions. [2022-07-21 08:43:44,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 209 transitions, 1498 flow [2022-07-21 08:43:44,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 209 transitions, 1405 flow, removed 45 selfloop flow, removed 7 redundant places. [2022-07-21 08:43:44,992 INFO L242 Difference]: Finished difference. Result has 172 places, 115 transitions, 572 flow [2022-07-21 08:43:44,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=572, PETRI_PLACES=172, PETRI_TRANSITIONS=115} [2022-07-21 08:43:44,993 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 53 predicate places. [2022-07-21 08:43:44,994 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 115 transitions, 572 flow [2022-07-21 08:43:44,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 87.46153846153847) internal successors, (1137), 13 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:44,994 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:44,995 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:44,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 08:43:44,995 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:44,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:44,996 INFO L85 PathProgramCache]: Analyzing trace with hash 105452647, now seen corresponding path program 1 times [2022-07-21 08:43:44,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:44,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278583407] [2022-07-21 08:43:44,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:44,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:45,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:45,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278583407] [2022-07-21 08:43:45,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278583407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:45,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:45,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 08:43:45,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065230288] [2022-07-21 08:43:45,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:45,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 08:43:45,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:45,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 08:43:45,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-21 08:43:45,214 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-07-21 08:43:45,215 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 115 transitions, 572 flow. Second operand has 12 states, 12 states have (on average 87.58333333333333) internal successors, (1051), 12 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:45,215 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:45,215 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-07-21 08:43:45,215 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:45,986 INFO L129 PetriNetUnfolder]: 726/1754 cut-off events. [2022-07-21 08:43:45,987 INFO L130 PetriNetUnfolder]: For 21013/24116 co-relation queries the response was YES. [2022-07-21 08:43:46,001 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9883 conditions, 1754 events. 726/1754 cut-off events. For 21013/24116 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 12202 event pairs, 149 based on Foata normal form. 54/1698 useless extension candidates. Maximal degree in co-relation 9781. Up to 681 conditions per place. [2022-07-21 08:43:46,010 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 39 selfloop transitions, 13 changer transitions 51/177 dead transitions. [2022-07-21 08:43:46,010 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 177 transitions, 1649 flow [2022-07-21 08:43:46,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:43:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-21 08:43:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1274 transitions. [2022-07-21 08:43:46,014 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7982456140350878 [2022-07-21 08:43:46,014 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1274 transitions. [2022-07-21 08:43:46,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1274 transitions. [2022-07-21 08:43:46,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:46,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1274 transitions. [2022-07-21 08:43:46,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 91.0) internal successors, (1274), 14 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:46,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:46,021 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:46,021 INFO L186 Difference]: Start difference. First operand has 172 places, 115 transitions, 572 flow. Second operand 14 states and 1274 transitions. [2022-07-21 08:43:46,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 177 transitions, 1649 flow [2022-07-21 08:43:46,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 177 transitions, 1404 flow, removed 120 selfloop flow, removed 21 redundant places. [2022-07-21 08:43:46,079 INFO L242 Difference]: Finished difference. Result has 154 places, 115 transitions, 585 flow [2022-07-21 08:43:46,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=585, PETRI_PLACES=154, PETRI_TRANSITIONS=115} [2022-07-21 08:43:46,080 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 35 predicate places. [2022-07-21 08:43:46,080 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 115 transitions, 585 flow [2022-07-21 08:43:46,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.58333333333333) internal successors, (1051), 12 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:46,081 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:46,081 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:46,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 08:43:46,081 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:46,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:46,082 INFO L85 PathProgramCache]: Analyzing trace with hash 888299158, now seen corresponding path program 1 times [2022-07-21 08:43:46,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:46,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202625214] [2022-07-21 08:43:46,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:46,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:46,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:46,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202625214] [2022-07-21 08:43:46,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202625214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:46,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:46,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 08:43:46,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997130622] [2022-07-21 08:43:46,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:46,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 08:43:46,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:46,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 08:43:46,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-07-21 08:43:46,403 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2022-07-21 08:43:46,405 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 115 transitions, 585 flow. Second operand has 13 states, 13 states have (on average 86.61538461538461) internal successors, (1126), 13 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:46,405 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:46,405 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2022-07-21 08:43:46,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:47,024 INFO L129 PetriNetUnfolder]: 407/1053 cut-off events. [2022-07-21 08:43:47,025 INFO L130 PetriNetUnfolder]: For 9175/10953 co-relation queries the response was YES. [2022-07-21 08:43:47,031 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5288 conditions, 1053 events. 407/1053 cut-off events. For 9175/10953 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6259 event pairs, 180 based on Foata normal form. 11/969 useless extension candidates. Maximal degree in co-relation 5190. Up to 585 conditions per place. [2022-07-21 08:43:47,038 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 45 selfloop transitions, 17 changer transitions 38/173 dead transitions. [2022-07-21 08:43:47,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 173 transitions, 1490 flow [2022-07-21 08:43:47,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 08:43:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-07-21 08:43:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1868 transitions. [2022-07-21 08:43:47,042 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7802840434419381 [2022-07-21 08:43:47,043 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1868 transitions. [2022-07-21 08:43:47,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1868 transitions. [2022-07-21 08:43:47,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:47,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1868 transitions. [2022-07-21 08:43:47,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 88.95238095238095) internal successors, (1868), 21 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:47,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 114.0) internal successors, (2508), 22 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:47,051 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 114.0) internal successors, (2508), 22 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:47,051 INFO L186 Difference]: Start difference. First operand has 154 places, 115 transitions, 585 flow. Second operand 21 states and 1868 transitions. [2022-07-21 08:43:47,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 173 transitions, 1490 flow [2022-07-21 08:43:47,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 173 transitions, 1323 flow, removed 68 selfloop flow, removed 13 redundant places. [2022-07-21 08:43:47,072 INFO L242 Difference]: Finished difference. Result has 170 places, 122 transitions, 694 flow [2022-07-21 08:43:47,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=694, PETRI_PLACES=170, PETRI_TRANSITIONS=122} [2022-07-21 08:43:47,073 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 51 predicate places. [2022-07-21 08:43:47,073 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 122 transitions, 694 flow [2022-07-21 08:43:47,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 86.61538461538461) internal successors, (1126), 13 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:47,074 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:47,074 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:47,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 08:43:47,074 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:47,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:47,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1531628550, now seen corresponding path program 1 times [2022-07-21 08:43:47,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:47,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54077388] [2022-07-21 08:43:47,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:47,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:47,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:47,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54077388] [2022-07-21 08:43:47,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54077388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:47,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:47,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:43:47,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94903004] [2022-07-21 08:43:47,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:47,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:43:47,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:47,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:43:47,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:43:47,270 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-07-21 08:43:47,271 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 122 transitions, 694 flow. Second operand has 9 states, 9 states have (on average 89.11111111111111) internal successors, (802), 9 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:47,271 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:47,271 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-07-21 08:43:47,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:47,835 INFO L129 PetriNetUnfolder]: 473/1239 cut-off events. [2022-07-21 08:43:47,835 INFO L130 PetriNetUnfolder]: For 13734/15835 co-relation queries the response was YES. [2022-07-21 08:43:47,845 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6619 conditions, 1239 events. 473/1239 cut-off events. For 13734/15835 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7852 event pairs, 95 based on Foata normal form. 37/1173 useless extension candidates. Maximal degree in co-relation 6516. Up to 448 conditions per place. [2022-07-21 08:43:47,852 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 47 selfloop transitions, 22 changer transitions 38/182 dead transitions. [2022-07-21 08:43:47,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 182 transitions, 1715 flow [2022-07-21 08:43:47,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 08:43:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-21 08:43:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1124 transitions. [2022-07-21 08:43:47,854 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8216374269005848 [2022-07-21 08:43:47,854 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1124 transitions. [2022-07-21 08:43:47,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1124 transitions. [2022-07-21 08:43:47,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:47,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1124 transitions. [2022-07-21 08:43:47,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 93.66666666666667) internal successors, (1124), 12 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:47,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:47,859 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:47,860 INFO L186 Difference]: Start difference. First operand has 170 places, 122 transitions, 694 flow. Second operand 12 states and 1124 transitions. [2022-07-21 08:43:47,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 182 transitions, 1715 flow [2022-07-21 08:43:47,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 182 transitions, 1526 flow, removed 91 selfloop flow, removed 16 redundant places. [2022-07-21 08:43:47,902 INFO L242 Difference]: Finished difference. Result has 161 places, 129 transitions, 849 flow [2022-07-21 08:43:47,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=849, PETRI_PLACES=161, PETRI_TRANSITIONS=129} [2022-07-21 08:43:47,903 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 42 predicate places. [2022-07-21 08:43:47,903 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 129 transitions, 849 flow [2022-07-21 08:43:47,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.11111111111111) internal successors, (802), 9 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:47,904 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:47,904 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:47,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 08:43:47,904 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:47,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:47,905 INFO L85 PathProgramCache]: Analyzing trace with hash -545811125, now seen corresponding path program 1 times [2022-07-21 08:43:47,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:47,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211374497] [2022-07-21 08:43:47,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:47,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:48,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:48,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211374497] [2022-07-21 08:43:48,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211374497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:48,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:48,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-21 08:43:48,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754597568] [2022-07-21 08:43:48,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:48,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-21 08:43:48,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:48,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-21 08:43:48,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2022-07-21 08:43:48,612 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-07-21 08:43:48,614 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 129 transitions, 849 flow. Second operand has 21 states, 21 states have (on average 81.28571428571429) internal successors, (1707), 21 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:48,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:48,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-07-21 08:43:48,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:49,292 INFO L129 PetriNetUnfolder]: 328/947 cut-off events. [2022-07-21 08:43:49,292 INFO L130 PetriNetUnfolder]: For 10220/11443 co-relation queries the response was YES. [2022-07-21 08:43:49,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5300 conditions, 947 events. 328/947 cut-off events. For 10220/11443 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5958 event pairs, 44 based on Foata normal form. 22/906 useless extension candidates. Maximal degree in co-relation 5195. Up to 525 conditions per place. [2022-07-21 08:43:49,306 INFO L132 encePairwiseOnDemand]: 98/114 looper letters, 50 selfloop transitions, 17 changer transitions 13/148 dead transitions. [2022-07-21 08:43:49,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 148 transitions, 1246 flow [2022-07-21 08:43:49,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 08:43:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-07-21 08:43:49,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1575 transitions. [2022-07-21 08:43:49,310 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7271468144044322 [2022-07-21 08:43:49,310 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1575 transitions. [2022-07-21 08:43:49,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1575 transitions. [2022-07-21 08:43:49,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:49,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1575 transitions. [2022-07-21 08:43:49,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 82.89473684210526) internal successors, (1575), 19 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:49,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:49,317 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:49,318 INFO L186 Difference]: Start difference. First operand has 161 places, 129 transitions, 849 flow. Second operand 19 states and 1575 transitions. [2022-07-21 08:43:49,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 148 transitions, 1246 flow [2022-07-21 08:43:49,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 148 transitions, 1177 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-07-21 08:43:49,347 INFO L242 Difference]: Finished difference. Result has 173 places, 129 transitions, 854 flow [2022-07-21 08:43:49,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=854, PETRI_PLACES=173, PETRI_TRANSITIONS=129} [2022-07-21 08:43:49,348 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 54 predicate places. [2022-07-21 08:43:49,348 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 129 transitions, 854 flow [2022-07-21 08:43:49,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 81.28571428571429) internal successors, (1707), 21 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:49,349 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:49,349 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:49,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 08:43:49,349 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:49,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:49,350 INFO L85 PathProgramCache]: Analyzing trace with hash 534831099, now seen corresponding path program 1 times [2022-07-21 08:43:49,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:49,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055049902] [2022-07-21 08:43:49,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:49,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:49,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:49,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055049902] [2022-07-21 08:43:49,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055049902] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:49,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:49,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 08:43:49,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987485657] [2022-07-21 08:43:49,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:49,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 08:43:49,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:49,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 08:43:49,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-21 08:43:49,690 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2022-07-21 08:43:49,692 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 129 transitions, 854 flow. Second operand has 12 states, 12 states have (on average 86.83333333333333) internal successors, (1042), 12 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:49,692 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:49,692 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2022-07-21 08:43:49,692 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:50,351 INFO L129 PetriNetUnfolder]: 398/1148 cut-off events. [2022-07-21 08:43:50,351 INFO L130 PetriNetUnfolder]: For 13760/16648 co-relation queries the response was YES. [2022-07-21 08:43:50,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6479 conditions, 1148 events. 398/1148 cut-off events. For 13760/16648 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7550 event pairs, 89 based on Foata normal form. 31/1066 useless extension candidates. Maximal degree in co-relation 6368. Up to 405 conditions per place. [2022-07-21 08:43:50,366 INFO L132 encePairwiseOnDemand]: 102/114 looper letters, 46 selfloop transitions, 28 changer transitions 35/182 dead transitions. [2022-07-21 08:43:50,366 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 182 transitions, 1868 flow [2022-07-21 08:43:50,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 08:43:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-21 08:43:50,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1524 transitions. [2022-07-21 08:43:50,369 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7863777089783281 [2022-07-21 08:43:50,369 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1524 transitions. [2022-07-21 08:43:50,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1524 transitions. [2022-07-21 08:43:50,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:50,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1524 transitions. [2022-07-21 08:43:50,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 89.6470588235294) internal successors, (1524), 17 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:50,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:50,377 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:50,377 INFO L186 Difference]: Start difference. First operand has 173 places, 129 transitions, 854 flow. Second operand 17 states and 1524 transitions. [2022-07-21 08:43:50,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 182 transitions, 1868 flow [2022-07-21 08:43:50,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 182 transitions, 1726 flow, removed 51 selfloop flow, removed 21 redundant places. [2022-07-21 08:43:50,409 INFO L242 Difference]: Finished difference. Result has 174 places, 138 transitions, 1035 flow [2022-07-21 08:43:50,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1035, PETRI_PLACES=174, PETRI_TRANSITIONS=138} [2022-07-21 08:43:50,410 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 55 predicate places. [2022-07-21 08:43:50,410 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 138 transitions, 1035 flow [2022-07-21 08:43:50,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 86.83333333333333) internal successors, (1042), 12 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:50,411 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:50,411 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:50,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 08:43:50,411 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1888648556, now seen corresponding path program 1 times [2022-07-21 08:43:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:50,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368159665] [2022-07-21 08:43:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:50,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:50,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:50,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368159665] [2022-07-21 08:43:50,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368159665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:50,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:50,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-21 08:43:50,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105373129] [2022-07-21 08:43:50,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:50,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-21 08:43:50,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:50,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-21 08:43:50,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-07-21 08:43:50,733 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-07-21 08:43:50,734 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 138 transitions, 1035 flow. Second operand has 15 states, 15 states have (on average 84.6) internal successors, (1269), 15 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:50,734 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:50,734 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-07-21 08:43:50,734 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:51,504 INFO L129 PetriNetUnfolder]: 376/1295 cut-off events. [2022-07-21 08:43:51,504 INFO L130 PetriNetUnfolder]: For 15990/17445 co-relation queries the response was YES. [2022-07-21 08:43:51,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6977 conditions, 1295 events. 376/1295 cut-off events. For 15990/17445 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9933 event pairs, 86 based on Foata normal form. 44/1220 useless extension candidates. Maximal degree in co-relation 6869. Up to 424 conditions per place. [2022-07-21 08:43:51,516 INFO L132 encePairwiseOnDemand]: 100/114 looper letters, 41 selfloop transitions, 19 changer transitions 50/181 dead transitions. [2022-07-21 08:43:51,517 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 181 transitions, 2021 flow [2022-07-21 08:43:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 08:43:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-07-21 08:43:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1652 transitions. [2022-07-21 08:43:51,520 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.76269621421976 [2022-07-21 08:43:51,520 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1652 transitions. [2022-07-21 08:43:51,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1652 transitions. [2022-07-21 08:43:51,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:51,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1652 transitions. [2022-07-21 08:43:51,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 86.94736842105263) internal successors, (1652), 19 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:51,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:51,528 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:51,528 INFO L186 Difference]: Start difference. First operand has 174 places, 138 transitions, 1035 flow. Second operand 19 states and 1652 transitions. [2022-07-21 08:43:51,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 181 transitions, 2021 flow [2022-07-21 08:43:51,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 181 transitions, 1813 flow, removed 98 selfloop flow, removed 15 redundant places. [2022-07-21 08:43:51,571 INFO L242 Difference]: Finished difference. Result has 180 places, 124 transitions, 832 flow [2022-07-21 08:43:51,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=832, PETRI_PLACES=180, PETRI_TRANSITIONS=124} [2022-07-21 08:43:51,572 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 61 predicate places. [2022-07-21 08:43:51,572 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 124 transitions, 832 flow [2022-07-21 08:43:51,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 84.6) internal successors, (1269), 15 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:51,573 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:51,573 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:51,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 08:43:51,573 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:51,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:51,574 INFO L85 PathProgramCache]: Analyzing trace with hash 767061991, now seen corresponding path program 2 times [2022-07-21 08:43:51,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:51,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908007729] [2022-07-21 08:43:51,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:51,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:51,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:51,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908007729] [2022-07-21 08:43:51,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908007729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:51,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:51,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 08:43:51,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059627502] [2022-07-21 08:43:51,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:51,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 08:43:51,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:51,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 08:43:51,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-21 08:43:51,939 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-07-21 08:43:51,940 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 124 transitions, 832 flow. Second operand has 13 states, 13 states have (on average 87.61538461538461) internal successors, (1139), 13 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:51,941 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:51,941 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-07-21 08:43:51,941 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:52,561 INFO L129 PetriNetUnfolder]: 251/844 cut-off events. [2022-07-21 08:43:52,562 INFO L130 PetriNetUnfolder]: For 16151/16641 co-relation queries the response was YES. [2022-07-21 08:43:52,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4836 conditions, 844 events. 251/844 cut-off events. For 16151/16641 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5051 event pairs, 43 based on Foata normal form. 31/807 useless extension candidates. Maximal degree in co-relation 4727. Up to 345 conditions per place. [2022-07-21 08:43:52,571 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 52 selfloop transitions, 33 changer transitions 35/194 dead transitions. [2022-07-21 08:43:52,572 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 194 transitions, 2261 flow [2022-07-21 08:43:52,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 08:43:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-07-21 08:43:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1625 transitions. [2022-07-21 08:43:52,578 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7919103313840156 [2022-07-21 08:43:52,578 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1625 transitions. [2022-07-21 08:43:52,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1625 transitions. [2022-07-21 08:43:52,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:52,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1625 transitions. [2022-07-21 08:43:52,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 90.27777777777777) internal successors, (1625), 18 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:52,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:52,588 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:52,588 INFO L186 Difference]: Start difference. First operand has 180 places, 124 transitions, 832 flow. Second operand 18 states and 1625 transitions. [2022-07-21 08:43:52,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 194 transitions, 2261 flow [2022-07-21 08:43:52,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 194 transitions, 1881 flow, removed 149 selfloop flow, removed 21 redundant places. [2022-07-21 08:43:52,616 INFO L242 Difference]: Finished difference. Result has 180 places, 149 transitions, 1193 flow [2022-07-21 08:43:52,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1193, PETRI_PLACES=180, PETRI_TRANSITIONS=149} [2022-07-21 08:43:52,617 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 61 predicate places. [2022-07-21 08:43:52,617 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 149 transitions, 1193 flow [2022-07-21 08:43:52,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 87.61538461538461) internal successors, (1139), 13 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:52,618 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:52,618 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:52,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 08:43:52,618 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:52,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:52,620 INFO L85 PathProgramCache]: Analyzing trace with hash 735760371, now seen corresponding path program 3 times [2022-07-21 08:43:52,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:52,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777037186] [2022-07-21 08:43:52,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:52,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:53,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:53,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777037186] [2022-07-21 08:43:53,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777037186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:53,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:53,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-21 08:43:53,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851641738] [2022-07-21 08:43:53,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:53,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 08:43:53,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:53,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 08:43:53,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-07-21 08:43:53,021 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114 [2022-07-21 08:43:53,022 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 149 transitions, 1193 flow. Second operand has 16 states, 16 states have (on average 85.4375) internal successors, (1367), 16 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:53,022 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:53,023 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114 [2022-07-21 08:43:53,023 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:53,638 INFO L129 PetriNetUnfolder]: 216/779 cut-off events. [2022-07-21 08:43:53,639 INFO L130 PetriNetUnfolder]: For 12647/14671 co-relation queries the response was YES. [2022-07-21 08:43:53,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4320 conditions, 779 events. 216/779 cut-off events. For 12647/14671 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4722 event pairs, 44 based on Foata normal form. 25/743 useless extension candidates. Maximal degree in co-relation 4213. Up to 303 conditions per place. [2022-07-21 08:43:53,646 INFO L132 encePairwiseOnDemand]: 100/114 looper letters, 59 selfloop transitions, 24 changer transitions 27/182 dead transitions. [2022-07-21 08:43:53,647 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 182 transitions, 1995 flow [2022-07-21 08:43:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 08:43:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-21 08:43:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1412 transitions. [2022-07-21 08:43:53,650 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7741228070175439 [2022-07-21 08:43:53,650 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1412 transitions. [2022-07-21 08:43:53,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1412 transitions. [2022-07-21 08:43:53,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:53,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1412 transitions. [2022-07-21 08:43:53,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:53,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:53,656 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:53,656 INFO L186 Difference]: Start difference. First operand has 180 places, 149 transitions, 1193 flow. Second operand 16 states and 1412 transitions. [2022-07-21 08:43:53,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 182 transitions, 1995 flow [2022-07-21 08:43:53,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 182 transitions, 1824 flow, removed 83 selfloop flow, removed 12 redundant places. [2022-07-21 08:43:53,685 INFO L242 Difference]: Finished difference. Result has 181 places, 147 transitions, 1197 flow [2022-07-21 08:43:53,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1197, PETRI_PLACES=181, PETRI_TRANSITIONS=147} [2022-07-21 08:43:53,686 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 62 predicate places. [2022-07-21 08:43:53,686 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 147 transitions, 1197 flow [2022-07-21 08:43:53,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 85.4375) internal successors, (1367), 16 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:53,686 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:53,687 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:53,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 08:43:53,687 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:53,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:53,687 INFO L85 PathProgramCache]: Analyzing trace with hash 730993123, now seen corresponding path program 1 times [2022-07-21 08:43:53,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:53,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005519260] [2022-07-21 08:43:53,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:53,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:53,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:53,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005519260] [2022-07-21 08:43:53,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005519260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:53,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:53,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:43:53,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408494051] [2022-07-21 08:43:53,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:53,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:43:53,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:53,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:43:53,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:43:53,780 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-07-21 08:43:53,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 147 transitions, 1197 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:53,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:53,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-07-21 08:43:53,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:54,787 INFO L129 PetriNetUnfolder]: 2302/4540 cut-off events. [2022-07-21 08:43:54,788 INFO L130 PetriNetUnfolder]: For 77252/77415 co-relation queries the response was YES. [2022-07-21 08:43:54,858 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22674 conditions, 4540 events. 2302/4540 cut-off events. For 77252/77415 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 33044 event pairs, 90 based on Foata normal form. 82/4524 useless extension candidates. Maximal degree in co-relation 22573. Up to 1309 conditions per place. [2022-07-21 08:43:54,869 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 89 selfloop transitions, 6 changer transitions 140/311 dead transitions. [2022-07-21 08:43:54,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 311 transitions, 3996 flow [2022-07-21 08:43:54,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:43:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:43:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 977 transitions. [2022-07-21 08:43:54,872 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8570175438596491 [2022-07-21 08:43:54,872 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 977 transitions. [2022-07-21 08:43:54,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 977 transitions. [2022-07-21 08:43:54,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:54,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 977 transitions. [2022-07-21 08:43:54,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.7) internal successors, (977), 10 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:54,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:54,877 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:54,878 INFO L186 Difference]: Start difference. First operand has 181 places, 147 transitions, 1197 flow. Second operand 10 states and 977 transitions. [2022-07-21 08:43:54,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 311 transitions, 3996 flow [2022-07-21 08:43:54,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 311 transitions, 3662 flow, removed 90 selfloop flow, removed 17 redundant places. [2022-07-21 08:43:54,953 INFO L242 Difference]: Finished difference. Result has 169 places, 131 transitions, 889 flow [2022-07-21 08:43:54,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=889, PETRI_PLACES=169, PETRI_TRANSITIONS=131} [2022-07-21 08:43:54,954 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 50 predicate places. [2022-07-21 08:43:54,956 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 131 transitions, 889 flow [2022-07-21 08:43:54,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:54,956 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:54,957 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:54,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 08:43:54,957 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:54,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:54,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1351515203, now seen corresponding path program 1 times [2022-07-21 08:43:54,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:54,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215558184] [2022-07-21 08:43:54,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:54,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:55,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:55,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215558184] [2022-07-21 08:43:55,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215558184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:55,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:55,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:43:55,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631120894] [2022-07-21 08:43:55,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:55,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:43:55,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:55,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:43:55,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:43:55,074 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-07-21 08:43:55,075 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 131 transitions, 889 flow. Second operand has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:55,075 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:55,075 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-07-21 08:43:55,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:55,663 INFO L129 PetriNetUnfolder]: 745/1883 cut-off events. [2022-07-21 08:43:55,663 INFO L130 PetriNetUnfolder]: For 24230/24260 co-relation queries the response was YES. [2022-07-21 08:43:55,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9603 conditions, 1883 events. 745/1883 cut-off events. For 24230/24260 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13202 event pairs, 20 based on Foata normal form. 92/1967 useless extension candidates. Maximal degree in co-relation 9509. Up to 443 conditions per place. [2022-07-21 08:43:55,674 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 74 selfloop transitions, 9 changer transitions 77/236 dead transitions. [2022-07-21 08:43:55,674 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 236 transitions, 2710 flow [2022-07-21 08:43:55,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:43:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:43:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 971 transitions. [2022-07-21 08:43:55,676 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8517543859649123 [2022-07-21 08:43:55,676 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 971 transitions. [2022-07-21 08:43:55,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 971 transitions. [2022-07-21 08:43:55,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:55,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 971 transitions. [2022-07-21 08:43:55,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.1) internal successors, (971), 10 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:55,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:55,680 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:55,681 INFO L186 Difference]: Start difference. First operand has 169 places, 131 transitions, 889 flow. Second operand 10 states and 971 transitions. [2022-07-21 08:43:55,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 236 transitions, 2710 flow [2022-07-21 08:43:55,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 236 transitions, 2591 flow, removed 26 selfloop flow, removed 8 redundant places. [2022-07-21 08:43:55,708 INFO L242 Difference]: Finished difference. Result has 170 places, 127 transitions, 834 flow [2022-07-21 08:43:55,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=834, PETRI_PLACES=170, PETRI_TRANSITIONS=127} [2022-07-21 08:43:55,709 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 51 predicate places. [2022-07-21 08:43:55,709 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 127 transitions, 834 flow [2022-07-21 08:43:55,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:55,710 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:55,710 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:55,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 08:43:55,710 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:55,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:55,711 INFO L85 PathProgramCache]: Analyzing trace with hash 728467284, now seen corresponding path program 1 times [2022-07-21 08:43:55,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:55,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861141080] [2022-07-21 08:43:55,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:55,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:56,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:56,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861141080] [2022-07-21 08:43:56,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861141080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:56,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:56,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-21 08:43:56,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309944628] [2022-07-21 08:43:56,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:56,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 08:43:56,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:56,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 08:43:56,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-07-21 08:43:56,151 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2022-07-21 08:43:56,152 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 127 transitions, 834 flow. Second operand has 17 states, 17 states have (on average 83.52941176470588) internal successors, (1420), 17 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:56,152 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:56,152 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2022-07-21 08:43:56,153 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:56,673 INFO L129 PetriNetUnfolder]: 122/683 cut-off events. [2022-07-21 08:43:56,674 INFO L130 PetriNetUnfolder]: For 5857/5912 co-relation queries the response was YES. [2022-07-21 08:43:56,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3010 conditions, 683 events. 122/683 cut-off events. For 5857/5912 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4213 event pairs, 19 based on Foata normal form. 26/691 useless extension candidates. Maximal degree in co-relation 2904. Up to 182 conditions per place. [2022-07-21 08:43:56,680 INFO L132 encePairwiseOnDemand]: 98/114 looper letters, 39 selfloop transitions, 14 changer transitions 22/150 dead transitions. [2022-07-21 08:43:56,680 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 150 transitions, 1250 flow [2022-07-21 08:43:56,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 08:43:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-07-21 08:43:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1534 transitions. [2022-07-21 08:43:56,683 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7475633528265108 [2022-07-21 08:43:56,683 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1534 transitions. [2022-07-21 08:43:56,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1534 transitions. [2022-07-21 08:43:56,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:56,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1534 transitions. [2022-07-21 08:43:56,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 85.22222222222223) internal successors, (1534), 18 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:56,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:56,689 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:56,689 INFO L186 Difference]: Start difference. First operand has 170 places, 127 transitions, 834 flow. Second operand 18 states and 1534 transitions. [2022-07-21 08:43:56,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 150 transitions, 1250 flow [2022-07-21 08:43:56,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 150 transitions, 1190 flow, removed 22 selfloop flow, removed 9 redundant places. [2022-07-21 08:43:56,705 INFO L242 Difference]: Finished difference. Result has 182 places, 125 transitions, 805 flow [2022-07-21 08:43:56,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=805, PETRI_PLACES=182, PETRI_TRANSITIONS=125} [2022-07-21 08:43:56,706 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 63 predicate places. [2022-07-21 08:43:56,706 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 125 transitions, 805 flow [2022-07-21 08:43:56,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 83.52941176470588) internal successors, (1420), 17 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:56,707 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:56,707 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:56,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 08:43:56,707 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:56,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:56,708 INFO L85 PathProgramCache]: Analyzing trace with hash 108063790, now seen corresponding path program 2 times [2022-07-21 08:43:56,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:56,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542011900] [2022-07-21 08:43:56,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:56,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:57,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:57,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542011900] [2022-07-21 08:43:57,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542011900] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:57,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:57,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-21 08:43:57,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734056767] [2022-07-21 08:43:57,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:57,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 08:43:57,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:57,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 08:43:57,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-07-21 08:43:57,207 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2022-07-21 08:43:57,208 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 125 transitions, 805 flow. Second operand has 18 states, 18 states have (on average 83.44444444444444) internal successors, (1502), 18 states have internal predecessors, (1502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:57,209 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:57,209 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2022-07-21 08:43:57,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:57,742 INFO L129 PetriNetUnfolder]: 99/604 cut-off events. [2022-07-21 08:43:57,743 INFO L130 PetriNetUnfolder]: For 4493/4532 co-relation queries the response was YES. [2022-07-21 08:43:57,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2295 conditions, 604 events. 99/604 cut-off events. For 4493/4532 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3613 event pairs, 10 based on Foata normal form. 31/625 useless extension candidates. Maximal degree in co-relation 2185. Up to 113 conditions per place. [2022-07-21 08:43:57,748 INFO L132 encePairwiseOnDemand]: 100/114 looper letters, 30 selfloop transitions, 15 changer transitions 24/144 dead transitions. [2022-07-21 08:43:57,749 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 144 transitions, 1221 flow [2022-07-21 08:43:57,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 08:43:57,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-21 08:43:57,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1451 transitions. [2022-07-21 08:43:57,755 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7487100103199175 [2022-07-21 08:43:57,755 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1451 transitions. [2022-07-21 08:43:57,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1451 transitions. [2022-07-21 08:43:57,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:57,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1451 transitions. [2022-07-21 08:43:57,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 85.3529411764706) internal successors, (1451), 17 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:57,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:57,762 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:57,762 INFO L186 Difference]: Start difference. First operand has 182 places, 125 transitions, 805 flow. Second operand 17 states and 1451 transitions. [2022-07-21 08:43:57,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 144 transitions, 1221 flow [2022-07-21 08:43:57,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 144 transitions, 1102 flow, removed 40 selfloop flow, removed 19 redundant places. [2022-07-21 08:43:57,781 INFO L242 Difference]: Finished difference. Result has 181 places, 116 transitions, 698 flow [2022-07-21 08:43:57,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=698, PETRI_PLACES=181, PETRI_TRANSITIONS=116} [2022-07-21 08:43:57,782 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 62 predicate places. [2022-07-21 08:43:57,782 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 116 transitions, 698 flow [2022-07-21 08:43:57,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 83.44444444444444) internal successors, (1502), 18 states have internal predecessors, (1502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:57,783 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:57,783 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:57,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 08:43:57,784 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:57,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:57,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1889541102, now seen corresponding path program 1 times [2022-07-21 08:43:57,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:57,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633533493] [2022-07-21 08:43:57,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:57,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:43:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:43:57,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:43:57,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633533493] [2022-07-21 08:43:57,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633533493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:43:57,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:43:57,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:43:57,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073007338] [2022-07-21 08:43:57,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:43:57,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:43:57,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:43:57,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:43:57,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:43:57,920 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-07-21 08:43:57,921 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 116 transitions, 698 flow. Second operand has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:57,921 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:43:57,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-07-21 08:43:57,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:58,237 INFO L129 PetriNetUnfolder]: 178/643 cut-off events. [2022-07-21 08:43:58,237 INFO L130 PetriNetUnfolder]: For 6691/6699 co-relation queries the response was YES. [2022-07-21 08:43:58,241 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2919 conditions, 643 events. 178/643 cut-off events. For 6691/6699 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3726 event pairs, 8 based on Foata normal form. 28/668 useless extension candidates. Maximal degree in co-relation 2872. Up to 130 conditions per place. [2022-07-21 08:43:58,243 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 40 selfloop transitions, 12 changer transitions 25/152 dead transitions. [2022-07-21 08:43:58,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 152 transitions, 1348 flow [2022-07-21 08:43:58,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 08:43:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-21 08:43:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1029 transitions. [2022-07-21 08:43:58,246 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8205741626794258 [2022-07-21 08:43:58,246 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1029 transitions. [2022-07-21 08:43:58,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1029 transitions. [2022-07-21 08:43:58,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:58,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1029 transitions. [2022-07-21 08:43:58,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.54545454545455) internal successors, (1029), 11 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:58,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:58,250 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:58,251 INFO L186 Difference]: Start difference. First operand has 181 places, 116 transitions, 698 flow. Second operand 11 states and 1029 transitions. [2022-07-21 08:43:58,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 152 transitions, 1348 flow [2022-07-21 08:43:58,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 152 transitions, 1027 flow, removed 78 selfloop flow, removed 34 redundant places. [2022-07-21 08:43:58,263 INFO L242 Difference]: Finished difference. Result has 149 places, 112 transitions, 510 flow [2022-07-21 08:43:58,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=510, PETRI_PLACES=149, PETRI_TRANSITIONS=112} [2022-07-21 08:43:58,263 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 30 predicate places. [2022-07-21 08:43:58,264 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 112 transitions, 510 flow [2022-07-21 08:43:58,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:58,264 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:58,264 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:58,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 08:43:58,265 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:43:58,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:58,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2062780923, now seen corresponding path program 1 times [2022-07-21 08:43:58,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:58,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423902440] [2022-07-21 08:43:58,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:58,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:43:58,336 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 08:43:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:43:58,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 08:43:58,486 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 08:43:58,487 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-21 08:43:58,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-21 08:43:58,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-21 08:43:58,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-21 08:43:58,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-21 08:43:58,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-21 08:43:58,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 08:43:58,494 INFO L356 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:58,501 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-21 08:43:58,502 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 08:43:58,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 08:43:58 BasicIcfg [2022-07-21 08:43:58,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 08:43:58,641 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 08:43:58,642 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 08:43:58,642 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 08:43:58,642 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:43:37" (3/4) ... [2022-07-21 08:43:58,644 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 08:43:58,741 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 08:43:58,741 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 08:43:58,742 INFO L158 Benchmark]: Toolchain (without parser) took 23096.65ms. Allocated memory was 56.6MB in the beginning and 731.9MB in the end (delta: 675.3MB). Free memory was 39.4MB in the beginning and 381.1MB in the end (delta: -341.7MB). Peak memory consumption was 331.6MB. Max. memory is 16.1GB. [2022-07-21 08:43:58,742 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 46.1MB. Free memory was 28.3MB in the beginning and 28.2MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 08:43:58,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 641.68ms. Allocated memory is still 56.6MB. Free memory was 39.1MB in the beginning and 26.5MB in the end (delta: 12.6MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2022-07-21 08:43:58,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.60ms. Allocated memory is still 56.6MB. Free memory was 26.5MB in the beginning and 36.9MB in the end (delta: -10.5MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2022-07-21 08:43:58,743 INFO L158 Benchmark]: Boogie Preprocessor took 74.37ms. Allocated memory is still 56.6MB. Free memory was 36.9MB in the beginning and 33.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 08:43:58,743 INFO L158 Benchmark]: RCFGBuilder took 1461.10ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 33.9MB in the beginning and 32.6MB in the end (delta: 1.3MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2022-07-21 08:43:58,744 INFO L158 Benchmark]: TraceAbstraction took 20737.54ms. Allocated memory was 83.9MB in the beginning and 731.9MB in the end (delta: 648.0MB). Free memory was 31.9MB in the beginning and 418.9MB in the end (delta: -387.0MB). Peak memory consumption was 261.0MB. Max. memory is 16.1GB. [2022-07-21 08:43:58,744 INFO L158 Benchmark]: Witness Printer took 99.97ms. Allocated memory is still 731.9MB. Free memory was 418.9MB in the beginning and 381.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-07-21 08:43:58,746 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.31ms. Allocated memory is still 46.1MB. Free memory was 28.3MB in the beginning and 28.2MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 641.68ms. Allocated memory is still 56.6MB. Free memory was 39.1MB in the beginning and 26.5MB in the end (delta: 12.6MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.60ms. Allocated memory is still 56.6MB. Free memory was 26.5MB in the beginning and 36.9MB in the end (delta: -10.5MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.37ms. Allocated memory is still 56.6MB. Free memory was 36.9MB in the beginning and 33.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1461.10ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 33.9MB in the beginning and 32.6MB in the end (delta: 1.3MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20737.54ms. Allocated memory was 83.9MB in the beginning and 731.9MB in the end (delta: 648.0MB). Free memory was 31.9MB in the beginning and 418.9MB in the end (delta: -387.0MB). Peak memory consumption was 261.0MB. Max. memory is 16.1GB. * Witness Printer took 99.97ms. Allocated memory is still 731.9MB. Free memory was 418.9MB in the beginning and 381.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L720] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L721] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L722] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L723] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L724] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L725] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L729] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L730] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L731] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L732] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L733] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L734] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L735] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L844] 0 pthread_t t1873; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1873, ((void *)0), P0, ((void *)0))=-2, t1873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 pthread_t t1874; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1874, ((void *)0), P1, ((void *)0))=-1, t1873={5:0}, t1874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1875; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1875, ((void *)0), P2, ((void *)0))=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=2, y=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=2, y=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L776] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L776] 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) [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L778] 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 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L780] 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 [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L811] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L812] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L813] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L814] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L815] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L816] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 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) [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L758] 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 [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L760] 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 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=51, weak$$choice2=0, x=2, y=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 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) [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 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 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L859] 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 [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] EXPR 0 !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) [L866] 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) [L867] EXPR 0 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)) [L867] EXPR 0 !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) [L867] EXPR 0 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)) [L867] 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)) [L868] EXPR 0 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)) [L868] EXPR 0 !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) [L868] EXPR 0 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)) [L868] 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)) [L869] EXPR 0 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)) [L869] EXPR 0 !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) [L869] EXPR 0 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)) [L869] 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)) [L870] EXPR 0 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)) [L870] EXPR 0 !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) [L870] EXPR 0 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)) [L870] 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)) [L871] EXPR 0 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)) [L871] EXPR 0 !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) [L871] EXPR 0 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)) [L871] 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)) [L872] EXPR 0 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)) [L872] EXPR 0 !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) [L872] EXPR 0 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)) [L872] 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)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L877] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 845]: 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: 849]: 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: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.4s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1242 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1242 mSDsluCounter, 1271 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1899 mSDsCounter, 646 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3607 IncrementalHoareTripleChecker+Invalid, 4253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 646 mSolverCounterUnsat, 211 mSDtfsCounter, 3607 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 387 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1197occurred in iteration=15, InterpolantAutomatonStates: 285, 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.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1666 NumberOfCodeBlocks, 1666 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1558 ConstructedInterpolants, 0 QuantifiedInterpolants, 12437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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! [2022-07-21 08:43:58,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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